Multidimensional Spatial Data Structures

University of Maryland 16.

[1]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[2]  Gregory Michael Hunter,et al.  Efficient computation and data structures for graphics. , 1978 .

[3]  Hanan Samet,et al.  A qualitative comparison study of data structures for large line segment databases , 1992, SIGMOD '92.

[4]  Christian Böhm,et al.  Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations , 1998, EDBT.

[5]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[6]  Christian Böhm,et al.  Independent quantization: an index compression technique for high-dimensional data spaces , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[7]  T. M. Williams,et al.  Optimizing Methods in Statistics , 1981 .

[8]  K. Knowlton,et al.  Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemes , 1980, Proceedings of the IEEE.

[9]  Hanan Samet,et al.  Iterative spatial join , 2003, TODS.

[10]  Jiong Yang,et al.  PK-tree: A Spatial Index Structure for High Dimensional Point Data , 1998, FODO.

[11]  Hanan Samet,et al.  Distance browsing in spatial databases , 1999, TODS.

[12]  Donald S. Fussell,et al.  HV/VH Trees: A New Spatial Data Structure for Fast Region Queries , 1993, 30th ACM/IEEE Design Automation Conference.

[13]  Jon Louis Bentley,et al.  Data Structures for Range Searching , 1979, CSUR.

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

[15]  John Edward Warnock,et al.  A hidden surface algorithm for computer generated halftone pictures , 1969 .

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

[17]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Comput. Graph. Image Process..

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

[19]  Martin J. Dürst,et al.  The design and analysis of spatial data structures. Applications of spatial data structures: computer graphics, image processing, and GIS , 1991 .

[20]  Bruce G. Baumgart.  A polyhedron representation for computer vision , 1975, AFIPS '75.

[21]  Hans-Jörg Schek,et al.  A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.

[22]  Walid G. Aref,et al.  Uniquely reporting spatial objects: yet another operation for comparing spatial data structures , 1992 .

[23]  Michael Freeston,et al.  The BANG file: A new kind of grid file , 1987, SIGMOD '87.

[24]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

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

[26]  Jonathan Goldstein,et al.  When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.

[27]  Reijo Sulonen,et al.  The EXCELL Method for Efficient Geometric Access to Data , 1982, 19th Design Automation Conference.

[28]  ARISTIDES A. G. REQUICHA,et al.  Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.

[29]  Walid G. Aref,et al.  Hashing by proximity to process duplicates in spatial databases , 1994, CIKM '94.

[30]  Pere Brunet,et al.  Object representation by means of nonminimal division quadtrees and octrees , 1985, TOGS.

[31]  Sharad Mehrotra,et al.  The hybrid tree: an index structure for high dimensional feature spaces , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[32]  Dana H. Ballard,et al.  Strip trees: a hierarchical representation for curves , 1981, CACM.

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

[34]  Bernhard Seeger,et al.  Data redundancy and duplicate detection in spatial join processing , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[35]  Hanan Samet,et al.  A Probabilistic Analysis of Trie-Based Sorting of Large Collections of Line Segments in Spatial Databases , 2005, SIAM J. Comput..

[36]  Hanan Samet,et al.  Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[37]  Michael Freeston.  A general solution of the n-dimensional B-tree problem , 1995, SIGMOD '95.

[38]  Hermann A. Maurer,et al.  Efficient worst-case data structures for range searching , 1978, Acta Informatica.

[39]  Kenneth Steiglitz,et al.  Operations on Images Using Quad Trees , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[40]  Hanan Samet,et al.  A consistent hierarchical representation for vector data , 1986, SIGGRAPH.

[41]  Clifford A. Shaffer,et al.  Digitizing the Plane with Cells of Nonuniform Size , 1987, Inf. Process. Lett..

[42]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[43]  M. Shneier.  Two hierarchical linear feature representations: Edge pyramids and edge quadtrees , 1981 .

[44]  Young-Koo Lee,et al.  Spatial Join Processing Using Corner Transformation , 1999, IEEE Trans. Knowl. Data Eng..

[45]  Jack A. Orenstein.  Multidimensional Tries Used for Associative Searching , 1982, Inf. Process. Lett..

[46]  Rudolf Bayer,et al.  Organization and maintenance of large ordered indexes , 1972, Acta Informatica.

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

[48]  Hanan Samet,et al.  Efficient Processing of Spatial Queries in Line Segment Databases , 1991, SSD.

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

[50]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[51]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[52]  Hanan Samet,et al.  Index-driven similarity search in metric spaces (Survey Article) , 2003, TODS.

[53]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[54]  Markku Tamminen.  Comment on Quad- and Octtrees , 1984, CACM.

[55]  Divyakant Agrawal,et al.  Vector approximation based indexing for non-uniform high dimensional data sets , 2000, CIKM '00.

[56]  Hanan Samet,et al.  Storing a collection of polygons using quadtrees , 1985, TOGS.

[57]  Hans-Peter Kriegel,et al.  The pyramid-technique: towards breaking the curse of dimensionality , 1998, SIGMOD '98.

[58]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[59]  Allen Klinger,et al.  PATTERNS AND SEARCH STATISTICS , 1971 .

[60]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

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

[62]  Gershon Kedem.  The Quad-CIF Tree: A Data Structure for Hierarchical On-Line Algorithms , 1982, 19th Design Automation Conference.

[63]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[64]  Hanan Samet,et al.  Ranking in Spatial Databases , 1995, SSD.

[65]  Andrew U. Frank,et al.  The Fieldtree: A Data Structure for Geographic Information Systems , 1990, SSD.

[66]  David B. Lomet,et al.  The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.