Abstract

In many massive dataset applications the data must be stored in space and query efficient data structures on external storage devices. Often the data needs to be changed dynamically. In this chapter we discuss recent advances in the development of provably worst-case efficient external memory dynamic data structures. We also briefly discuss some of the most popular external data structures used in practice.

Citations

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
1969	R-trees: A dynamic index structure for spatial searching - Guttman - 1984
855	The R*-tree: an efficient and robust access method for points and rectangles - Beckmann, Kriegel, et al. - 1990
634	An optimal algorithm for approximate nearest neighbor searching fixed dimensions - Arya, Mount, et al. - 1998
593	LEDA: A Platform for Combinatorial and Geometric Computing. MaxPlanck-Institut fuer Informatik, Saarbruecken - Mehlhorn, Naeher - 1995
508	Multidimensional access methods - Gaede, Günther - 1998
501	The ubiquitous B-tree - Comer - 1979
494	The input/output complexity of sorting and related problems. Commun - AGGARWAL, VITTER - 1988
461	The X-tree: An Index Structure for High-Dimensional Data - Berchtold, Keim, et al. - 1996
447	M-tree: an efficient access method for similarity search in metric spaces - Ciaccia, Patella, et al. - 1997
434	An introduction to disk drive modeling - Ruemmler, Wilkes - 1994
427	Nearest neighbor queries - Roussopoulos, Kelley, et al. - 1995
362	The Grid File: An Adaptable, Symmetric Multikey File Structure, Trans. Database Systems 9,1 - Nievergelt, Hinterberger, et al. - 1984
343	The KDB tree: a search structure for large multidimensional dynamic indexes - Robinson - 1981
342	The SR-tree: an index structure for high-dimensional nearest neighbor queries - Katayama, Satoh - 1997
287	The ‚ -tree: a dynamic index for multidimensional objects - Sellis, Roussopoulos, et al. - 1987
286	External memory algorithms and data structures: dealing with massive data - Vitter - 2001
282	Indexing the positions of continuously moving objects - Saltenis, Jensen, et al. - 2000
275	Similarity indexing with the SS-tree - White, Jain - 1996
244	Sorting and Searching, volume 3 of The Art of Computer Programming - Knuth - 1973
231	Making data structures persistent - Driscoll, Sarnak, et al. - 1989
229	Organization and Maintenance of Large Ordered Indexes - Bayer, McCreight - 1972
226	Algorithms for parallel memory I: Two-level memories - Vitter, Shriver - 1994
222	Erickson Geometric range searching and its relatives - Agarwal, J - 1998
215	Data structures for mobile data - Basch, Guibas, et al. - 1997
214	A decomposition of multidimensional point sets with application to k-nearest-neighbors and n-body potential fields - Callahan, Kosaraju - 1995
208	On packing R-trees - Kamel, Faloutsos - 1993
187	On Indexing Mobile Objects - Kollios, Gunopulos, et al. - 1999
177	A cost model for nearest neighbor search in high-dimensional data space - Berchtold, Böhm, et al. - 1997
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
164	Ranking in spatial databases - Hjaltason, Samet - 1995
162	Moving objects databases: Issues and solutions - Wolfson, Xu, et al. - 1998
161	Spatial query processing in an object-oriented database system - Orenstein - 1986
160	Patricia: A practical algorithm to retrieve information coded in alphanumeric - MORRISON - 1968
160	Planar point location using persistent search trees - Sarnak, Tarjan - 1986
159	External-memory graph algorithms - Chiang, Goodrich, et al. - 1995
157	Indexing moving points - Agarwal, Arge, et al. - 2000
156	Priority search trees - McCreight - 1985
149	Updating and querying databases that track mobile units. Distributed and Parallel Databases - Wolfson, Sistla, et al. - 1999
148	Comparison of access methods for time-evolving data - Salzberg, Tsotras - 1999
144	The buffer tree: A new technique for optimal I/O algorithms - Arge - 1995
144	Direct spatial search on pictorial databases using packed r-trees - Roussopoulos, Leifker - 1985
143	An asymptotically optimal multiversion B-tree - BECKER, GSCHWIND, et al. - 1996
142	Fractional cascading: I. A data structuring technique - Chazelle, Guibas - 1986
137	Data Structures and Algorithms 1: Sorting and Searching - Mehlhorn - 1984
122	The Design of Dynamic Data Structures - Overmars - 1983
121	A functional approach to data structures and its use in multidimensional searching - Chazelle - 1988
119	Cache-oblivious B-trees - BENDER, DEMAINE, et al. - 2000
117	External-memory computational geometry - Goodrich, Tsay, et al. - 1993