The design of the cell tree: an object-oriented index structure for geometric databases

The design of the cell tree, an object-oriented dynamic index structure for geometric databases, is described. The data objects in the database are represented as unions of convex point sets (cells). The cell tree is a balanced tree structure whose leaves contain the cells and whose interior nodes correspond to a hierarchy of nested convex polyhedra. This index structure allows quick access to the cells (and thereby to the data objects) that occupy a given location in space. The cell tree is designed for paged secondary memory to minimize the number of disk accesses occurring during a tree search. Point locations and range searches can be carried out very efficiently using the cell tree.<<ETX>>

[1]  H. Whitney.  Geometric Integration Theory , 1957 .

[2]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[3]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[4]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

[5]  Markku Tamminen,et al.  Efficient spatial access to a data base , 1982, SIGMOD '82.

[6]  Henry Fuchs,et al.  Near real-time shaded display of rigid objects , 1983, SIGGRAPH.

[7]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[8]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[9]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[10]  Klaus H. Hinrichs,et al.  Storage and Access Structures for Geometric Data Bases , 1985, FODO.

[11]  Klaus Hinrichs,et al.  The grid file system , 1985 .

[12]  Klaus H. Hinrichs.  The grid file system: implementation and case studies of applications , 1985 .

[13]  Nick Roussopoulos,et al.  Direct spatial search on pictorial databases using packed R-trees , 1985, SIGMOD Conference.

[14]  Hans-Peter Kriegel,et al.  Multidimensional Order Preserving Linear Hashing with Partial Expansions , 1986, ICDT.

[15]  Michael Stonebraker,et al.  An Analysis of Rule Indexing Implementations in Data Base Systems , 1986, Expert Database Conf..

[16]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[17]  Eugene Wong,et al.  A Dual Space Representation for Geometric Data , 1987, VLDB.

[18]  Christos Faloutsos,et al.  Analysis of object oriented spatial access methods , 1987, SIGMOD '87.

[19]  Oliver Günther,et al.  Efficient Structures for Geometric Data Management , 1988, Lecture Notes in Computer Science.

[20]  Diane Greene,et al.  An implementation and performance analysis of spatial data access methods , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[21]  Jeff A. Bilmes,et al.  The Implementation of the Cell Tree: Design Alternatives and Performance Evaluation , 1989, BTW.

[22]  Eugene Wong,et al.  A dual approach to detect polyhedral intersections in arbitrary dimensions , 1991, BIT.