(Enter summary)
Abstract: This paper surveys the data structures that were proposed for efficient
management of spatial data. These data structures were designed having
in mind the types of queries asked on spatial data, which are usually
proximity-based. It is thus essential to store together, in one sense or another,
"nearby" objects. This condition is crucial for performance when
the databases are very large---which is almost always the case---and data
accesses require lengthy I/O operations. (Update)
Context of citations to this paper: More
.... for proximity search group objects by proximity into hierarchies, and store them in another data structure such as a kd tree or R tree [13]. These conventional data structures do not work well for our purpose. First, kd tree or quad tree, do not support e#cient sequential...
Cited by: More
Efficient Proximity Search for 3-D Cuboids - Gao, Gupta
(Correct)
Active bibliography (related documents): More All
0.5: Multidimensional Access Methods - Gaede, Günther (1997)
(Correct)
0.5: It's Okay to Be Skinny, If Your Friends Are Fat - Maneewongvatana, Mount (1999)
(Correct)
0.5: Indexing in Spatial Databases - Ooi, Sacks-Davis, Han
(Correct)
Similar documents based on text: More All
0.0: TPIE - User Manual and Reference - Arge, Barve, Hutchinson, Procopiuc.. (1999)
(Correct)
0.0: Visualization and Interaction in the Computer Science.. - Magdalena Procopiuc (1996)
(Correct)
0.0: A Collection of Tools for Making Automata Theory.. - Bilska, Leider.. (1997)
(Correct)
BibTeX entry: (Update)
O. Procopiuc. Data structures for spatial database systems. http://citeseer.ist.psu.edu/procopiuc97data.html More
@misc{ procopiuc-data,
author = "O. Procopiuc",
title = "Data structures for spatial database systems",
text = "O. Procopiuc. Data structures for spatial database systems.",
url = "citeseer.ist.psu.edu/procopiuc97data.html" }
Citations (may not include all citations):
765
trees: a dynamic index structure for spatial searching (context) - Guttman - 1984
516
tree: An efficient and robust access method for points and r.. (context) - Beckmann, Kriegel et al. - 1990
346
Multidimensional binary search trees used for associative se.. (context) - Bentley - 1975
262
Multidimensional access methods
- Gaede, Gunther - 1997
210
On visible surface generation by a priori tree structures (context) - Fuchs, Kedem et al. - 1980
204
tree: An index structure for high-dimensional data (context) - Berchtold, Keim et al. - 1996
159
Efficient processing of spatial joins using R-trees (context) - Brinkhoff, Kriegel et al. - 1993
75
Data structures for range searching (context) - Bentley, Friedman - 1979
71
Fractals for secondary key retrieval
- Faloutsos, Roseman - 1989
52
Multidimensional binary search trees in database application.. (context) - Bentley - 1979
38
An implementation and performance analysis of spatial data a.. (context) - Greene - 1989
31
Comparison of approximations of complex objects used for app.. (context) - Brinkhoff, Kriegel et al. - 1993
30
Gral: An extensible relational database system for geometric.. (context) - Guting - 1989
29
Data structure and algorithm based on a linear key for a rec.. (context) - Abel, Smith - 1983
27
Multiattribute hashing using gray codes (context) - Faloutsos - 1986
22
DOT: A spatial access method using fractals
- Faloutsos, Rong - 1991
18
A comparative analysis of some two-dimensional orderings (context) - Abel, Mark - 1990
18
Tree-based access methods for spatial databases: Implementat.. (context) - Gunther, Bilmes - 1991
16
Optimal redundancy in spatial database systems
- Gaede - 1995
15
ACM Comput (context) - Comer, B-tree - 1979
14
Enclosing many boxes by an optimal pair of boxes
- Becker, Franciosa et al. - 1992
12
Implementation of the grid file: Design concepts and experie.. (context) - Hinrichs - 1985
8
Spatial database indices for large extended objects (context) - Gunther, Noltemeier - 1991
7
The spatial filter revisited (context) - Aref, Samet - 1994
6
Multikey retrieval from KD-trees and quad-trees (context) - Beckley, Evans et al. - 1985
6
An introduction to spatial database systems (context) - Guting - 1994
5
The hb -tree: a multi-attribute index supporting concurrency (context) - Evangelidis, Lomet et al. - 1997
5
Realm-based spatial data types: The ROSE algebra
- Guting, Schneider - 1995
5
A New Algorithm and a Cost Model for Jo (context) - Becker - 1992
4
Oversize shelves: A storage management technique for large s..
- Gunther, Gaede - 1996
2
Quad trees: A data structure for retrieval by composite key (context) - Finkel, Bentley - 1974
2
Optimal choice of discriminators in a balanced k-d binary se.. (context) - Filho - 1981
2
tree database organization: A dynamic multiattribute cluster.. (context) - Chang, Fu - 1981
1
Revised and extended version of a Ph. D. dissertation submit.. (context) - Gunther, for et al. - 1988
1
The twin grid file: A nearly space optimal (context) - Hutflesz, Six et al.
1
United States General Accounting Office (context) - Carlone, development et al. - 1992
1
ACM Special Interest Group on Management of Data (context) - Guenther, Buchmann et al. - 1990
1
Supporting VLSI geometry operations in a database system (context) - Banerjee, Kim - 1986
1
The cell tree: An object-oriented index structure for geomet.. (context) - Gunther - 1989
Documents on the same site (http://www.cs.duke.edu/~pankaj/spring97/cps234.html): More
Collision Detection Techniques for 3D Models - Gottschalk (1997)
(Correct)
A Survey of Polygonal Simplification Algorithms - Luebke (1997)
(Correct)
Robustness Issues in Computational Geometry - Keyser
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC