On Indexing Spatial and Temporal Data, Invited Project Review

[1]  Bernhard Seeger,et al.  On Optimal Multiversion Access Structures , 1993, SSD.

[2]  M. Stonebraker,et al.  The Sequoia 2000 Benchmark , 1993, SIGMOD Conference.

[3]  David B. Lomet,et al.  Transaction-Time Databases , 1993, Temporal Databases.

[4]  David B. Lomet,et al.  Access method concurrency with recovery , 1992, SIGMOD '92.

[5]  Eric Mays,et al.  Fully persistent B+-trees , 1991, SIGMOD '91.

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

[7]  David B. Lomet,et al.  The performance of a multiversion access method , 1990, SIGMOD '90.

[8]  David B. Lomet,et al.  Access methods for multiversion data , 1989, SIGMOD '89.

[9]  Betty Salzberg,et al.  File Structures: An Analytic Approach , 1988 .

[10]  Michael Stonebraker,et al.  The Design of the POSTGRES Storage System , 1988, VLDB.

[11]  Malcolm C. Easton,et al.  Key-Sequence Data Sets on Inedible Storage , 1986, IBM J. Res. Dev..

[12]  Betty Salzberg.  An Introduction to Data Base Design , 1986 .

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

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

[15]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[16]  Gio Wiederhold,et al.  Database Design , 1977 .

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