| Summary: | 碩士 === 國立中正大學 === 資訊工程研究所 === 81 === In an object-oriented database, the scope of a query is often a
class hierarchy rooted at a particular class. That is, a query
may either request instances chosen only from a root class, or
it may request instances which are chosen from any subclass of
the root class. So, the database indexing method must support
efficient retrieval from either a single class or from a
hierarchy of classes.In this paper,we propose a new
hierarchical indexing structure called SL-tree. The SL-
tree indexing structure is based on the B+-tree. It has a B+-
like tree for each class of a class hierarchy, and these
trees are nested according to their superclass-subclass
relationships. The simulation results indicate that SL-
tree need few nesting pointers and that they form an
efficient indexing structure for object-oriented databases.
|
|---|
