Generalizing "search" in generalized search trees
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The generalized search tree, or GiST, defines the basic interfaces required to construct a hierarchical access method for database systems. As originally specified, GiSTs only support record selection. In this paper, we show how a small number of additional interfaces enable GiSTs to support a much larger class of search and computation operations. Members of this class, which includes nearest-neighbor and ranked search, user-defined aggregation and index-assisted selectivity estimation, are increasingly common in new database applications. The advantages of implementing these operations in the GiST framework include reduction of user development effort and the ability to use "industrial strength" concurrency and recovery mechanisms provided by expert implementors.Keywords
This publication has 17 references indexed in Scilit:
- Dynamic query optimization in Rdb/VMSPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Similarity indexing with the SS-treePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Concurrency and recovery in generalized search treesPublished by Association for Computing Machinery (ACM) ,1997
- Ranking in spatial databasesPublished by Springer Nature ,1995
- Replica control in distributed systemsPublished by Association for Computing Machinery (ACM) ,1991
- Equi-depth multidimensional histogramsPublished by Association for Computing Machinery (ACM) ,1988
- GENESIS: an extensible database management systemIEEE Transactions on Software Engineering, 1988
- A data management extension architecturePublished by Association for Computing Machinery (ACM) ,1987
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- System RACM Transactions on Database Systems, 1976