Multidimensional Access Methods

Multidimensional Access Methods (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Volker Gaede , Oliver Günther

Citations:

508 - 3 self

BibTeX

@MISC{Gaede98multidimensionalaccess,
    author = {Volker Gaede and Oliver Günther},
    title = {Multidimensional Access Methods},
    year = {1998}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects that overlap a given search region). More

Citations

1969	R-trees: a dynamic index structure for spatial searching - Guttman - 1984
1084	The Design and Analysis of Spatial Data Structures - Samet - 1990
911	Multidimensional binary search trees used for associative searching - Bentley - 1975
855	The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles - Beckmann, Kriegel, et al. - 1990
503	Efficient and effective clustering methods for spatial data mining - Ng, Han - 1994
501	The Ubiquitous B-Tree - Comer - 1979
465	The R -tree: an efficient and robust access method for points and rectangles - Beckmann, Kriegel, et al. - 1990
461	The X-tree : an index structure for high-dimensional data - Berchtold, Keim, et al. - 1996
419	Computational geometry - Preparata, Shamos - 1985
363	The Quadtree and Related Hierarchical Data Structures - Samet - 1984
362	The grid file: An adaptable, symmetric multikey file structure - Nievergelt, Hinterberger, et al. - 1984
343	The k-d-b-tree: a search structure for large multidimensional dynamic indexes - Robinson - 1981
288	On visible surface generation by a priori tree structures - Fuchs, Kedem, et al. - 1980
287	Efficient processing of spatial joins using r-trees - Brinkhoff, Kriegel, et al. - 1993
287	The R + -tree: a dynamic index for multi-dimensional objects - Sellis, Roussopoulos, et al. - 1987
273	Multidimensional spatial data structures - Samet - 2004
222	Space-Filling Curves - Sagan - 1994
208	Quad trees, a data structure for retrieval on composite keys - Finkel, Bentley - 1974
208	On Packing R-Trees - Kamel, Faloutsos - 1993
186	A.: Generalized search trees for database systems - Hellerstein, Naughton, et al. - 1995
177	The TV-tree: an index structure for high-dimensional data - Lin, Jagadish, et al. - 1994
174	Linear clustering of objects with multiple attributes. A - Jagadish - 1990
170	The Hilbert R-tree: An improved R-tree using fractals - Kamel, Faloustos - 1992
167	The hb-tree: a multiattribute indexing method with good guaranteed performance - Lomet, Salzberg - 1990
161	Spatial Query Processing in an ObjectOriented Database System - Orenstein - 1986
144	Direct spatial search on pictorial databases using packed r-trees - Roussopoulos, Leifker - 1985
138	Efficient locking for concurrent operations on B-trees - Lehman, Yao - 1981
138	T.K.: A model for the prediction of R-tree performance - Theodoridis, Sellis - 1996
137	A class of data structures for associative searching - Orenstein, Merrett - 1984
136	Beyond uniformity and independence: Analysis of r-trees using the concept of fractal dimension - Faloutsos, Kamel - 1994
131	Multi-Step Processing of Spatial Joins - Brinkhoff, Kriegel, et al. - 1994
131	FractaJs for secondary key retrieval - Faloutsos, Roseman - 1989
130	Data Structures for Range Searching - Bentley, Friedman - 1979
130	Spatial SQL: A query and presentation language - Egenhofer - 1994
127	Organization and maintenance of large ordered indices - Bayer, McCreight - 1972
112	Estimating the selectivity of spatial queries using the ‘correlation’ fractal dimension - Belussi, Faloutsos - 1995
110	Indexing for data models with constraints and classes (extended abstract - KANELLAKIS, RAMASWAMY, et al. - 1993
104	Extendible hashing – A fast access method for dynamic files - Fagin, Nievergelt, et al. - 1979
102	A computer oriented geodetic data base and a new technique in file sequencing - Morton - 1966
96	The LSD tree: spatial access to multi-dimensional point and non-point objects - Henrich, Six, et al. - 1989
96	Spatial Joins Using Seeded Trees - Lo, Ravishankar
96	Topological relations in the world of minimum bounding rectangles: a study with rtrees - Papadias, Sellis, et al. - 1995
92	The bang file: a new kind of grid file - Freeston - 1987
91	Concurrency of operations on B-trees - Bayer, Schkolnick - 1977
87	Efficient Computation of Spatial Joins - Günther - 1993
81	Linear hashing: a new tool for file and table addressing - Litwin - 1998
78	The Universal B-Tree for multidimensional indexing: General Concepts - Bayer - 1997
76	Towards an analysis of range query performance in spatial data structures - PAGEL, SIX, et al. - 1993
73	The P-range Tree: A New Data Structure for Range Searching - Subramanian, Ramaswamy - 1995
71	Redundancy in spatial databases - Orenstein - 1989