The Indispensability of Dispensable Indexes

The design of new indexes has been driven by many factors, such as data types, operations, and application environment. The increasing demand for database systems to support new applications such as online analytical processing (OLAP), spatial databases, and temporal databases has continued to fuel the development of new indexes. In this paper, we summarize the major considerations in developing new indexes, paying particular attention to progress made in the design of indexes for spatial, temporal databases, and object-oriented databases (OODB). Our discussion focuses on the general concepts or features of these indexes, thus presenting the building blocks for meeting the challenges of designing new indexes for novel applications to be encountered in the future.

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

[2]  Doron Rotem.  Spatial join indices , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[3]  Timos K. Sellis,et al.  Topological relations in the world of minimum bounding rectangles: a study with R-trees , 1995, SIGMOD '95.

[4]  Jack A. Orenstein.  A comparison of spatial query processing techniques for native and parameter spaces , 1990, SIGMOD '90.

[5]  Witold Litwin,et al.  A New Method for Fast Data Searches with Keys , 1987, IEEE Software.

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

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

[8]  Hans-Peter Kriegel,et al.  The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.

[9]  Christos Faloutsos,et al.  Fractals for secondary key retrieval , 1989, PODS.

[10]  Arie Segev,et al.  A consensus glossary of temporal database concepts , 1994, SIGMOD 1994.

[11]  Jiawei Han,et al.  Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases , 1994, VLDB.

[12]  Elisa Bertino,et al.  Index configuration in object-oriented databases , 1994, VLDB J..

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

[14]  Kotagiri Ramamohanarao,et al.  Guidelines for presentation and comparison of indexing techniques , 1996, SGMD.

[15]  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).

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

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

[18]  Beng Chin Ooi,et al.  Indexing OODB instances based on access proximity , 1997, Proceedings 13th International Conference on Data Engineering.

[19]  Elisa Bertino,et al.  Indexing Techniques for Queries on Nested Objects , 1989, IEEE Trans. Knowl. Data Eng..

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

[21]  Won Kim,et al.  Indexing Techniques for Object-Oriented Databases , 1989, Object-Oriented Concepts, Databases, and Applications.

[22]  Beng Chin Ooi,et al.  H-trees: a dynamic associative search index for OODB , 1992, SIGMOD '92.

[23]  Vassilis J. Tsotras,et al.  Comparison of access methods for time-evolving data , 1999, CSUR.

[24]  Diane Greene,et al.  An implementation and performance analysis of spatial data access methods , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[25]  Patrick Valduriez,et al.  Join indices , 1987, TODS.

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

[27]  Christos Faloutsos,et al.  Designing Access Methods for Bitemporal Databases , 1998, IEEE Trans. Knowl. Data Eng..