This Article 
 Bibliographic References 
 Add to: 
The Indispensability of Dispensable Indexes
January/February 1999 (vol. 11 no. 1)
pp. 17-27

Abstract—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] B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer, "On Optimal Multiversion Access Structures," Proc. Workshop Advances in Spatial Databases, pp. 123-141, 1993.
[2] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Conf. Management of Data, 1990.
[3] S. Berchtold, D. Keim, and H.-P. Kriegel, “The X-Tree: An Index Structure for High-Dimensional Data,” Proc. 22nd Conf. Very Large Data Bases, pp. 28-39, 1996.
[4] E. Bertino, "On Indexing Configuration in Object-Oriented Databases," VLDB J., vol. 3, no. 3, pp. 355-399, 1994.
[5] E. Bertino and W. Kim, “Indexing Technique for Queries on Nested Objects,” IEEE Trans. Knowledge and Data Eng., vol. 1, no. 2, pp. 196-214, 1989.
[6] E. Bertino, R. Sacks-Davis, B.C. Ooi, K.L. Tan, J. Zobel, B. Shidlovsky, and B. Cantania, Indexing Techniques for Advanced Database Systems, Kluwer, 1997.
[7] C.Y. Chan, C.H. Goh, and B.C. Ooi, "Indexing OODB Instances Based on Access Proximity," Proc. 13th IEEE Int'l Conf. Data Eng., pp. 14-21, 1997.
[8] M. Easton, "Key-Sequence Data Sets on Indelible Storage," IBM J. of Research and Development, vol. 30, pp. 230-241, 1986.
[9] C. Faloutsos and S. Roseman, "Fractals for Secondary Key Retrival," Proc. Symp. Principles of Database Systems, SIGMOD-SIGACT PODS, 1989.
[10] D. Greene, "An Implementation and Performance Analysis of Spatial Data Access Methods," Proc. Fifth IEEE Int'l Conf. Data Eng., pp. 606-615, 1989.
[11] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[12] C.S. Jensen, J. Clifford, R. Elmasri, S.K. Gadia, P. Hayes and S. Jajodia, eds., "A Glossary of Temporal Database Concepts," ACM SIGMOD Record, vol. 23, no. 1, pp. 52-64, Mar. 1994.
[13] W. Kim, K.C. Kim, and A. Dale, "Indexing Techniques for Object-Oriented Databases," W. Kim and F. Lochovsky, eds., Object-Oriented Concepts, Databases, and Applications, pp. 371-394, Addison-Wesley, 1989.
[14] A. Kumar, V.J. Tsotras, and C. Faloutsos, "Designing Access Methods for Bitemporal Databases," IEEE Trans. Knowledge and Data Eng., vol. 10, no. 1, pp. 1-20, 1998.
[15] S. Lanka and E. Mays, "Fully Persistent B+ Trees," Proc. ACM SIGMOD Conf., pp. 426-435, 1991.
[16] D. Lomet and B. Salzberg, "Access Methods for Multiversion Data," Proc. ACM SIGMOD Conf., pp. 315-324, 1989.
[17] C.C. Low, B.C. Ooi, and H. Lu, "H-Trees: A Dynamic Associative Search Index for OODB," Proc. SIGMOD Int'l Conf. Management Data, pp. 134-143, ACM, 1992.
[18] J. Nievergelt, H. Hinterberger, and K.C. Sevcik, "The Grid File: An Adaptable, Symmetric Multikey File Structure," ACM Trans. Database Systems, vol. 9, no. 1, pp. 38-71, Mar. 1984.
[19] J.A. Orenstein, "A Comparison of Spatial Query Processing Techniques for Native and Parameter Spaces," Proc. SIGMOD Int'l Conf. Management Data, pp. 343-352, ACM, 1990.
[20] D. Papadias, Y. Theodoridis, T. Sellis, and M.J. Egenhofer, “Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-Trees,” Proc. ACM Special Interest Group on Management of Data (SIGMOD '95), 1995.
[21] D. Rotem, "Spatial Join Indices," Proc. Seventh Int'l Conf. Data Eng., pp. 500-509, 1991.
[22] B. Salzberg and V.J. Tsotras, "A Comparison of Access Methods for Time-Evolving Data," Computing Survey, ACM, 1997, to appear.
[23] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+-Tree: A Dynamic Index for Multidimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB), 1987.
[24] P. Valduriez, “Join Indices,” ACM Trans. Database Systems, vol. 12, no. 2, 1987.
[25] Z. Xie and J. Han, “Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases,” Proc. 1994 Int'l Conf. Very Large Data Bases, pp. 522-533, Sept. 1994.
[26] J. Zobel, A. Moffat, and K. Ramamohanarao, "Guidelines for Presentation and Comparison of Indexing Techniques," SIGMOD Record, vol. 25, no. 3, pp. 10-15, ACM, 1996.

Index Terms:
Indexing structures, query processing.
Elisa Bertino, Beng Chin Ooi, "The Indispensability of Dispensable Indexes," IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 1, pp. 17-27, Jan.-Feb. 1999, doi:10.1109/69.755611
Usage of this product signifies your acceptance of the Terms of Use.