A review of recent work on multi-attribute access methods
- 1 September 1992
- journal article
- review article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 21 (3) , 56-63
- https://doi.org/10.1145/140979.141006
Abstract
Most database systems provide database designers with single attribute indexing capability via some form of B+tree. Multi-attribute search structures are rare, and are mostly found in systems specialized to some more narrow application area, e.g. geographic databases. The reason is that no multi-attirbute search structure has been demonstrated, with high confidence. Multi-attribute search is an active area of research. This paper reviews the state of this field and some of the difficult problems, and reviews some recent notable papers.Keywords
This publication has 12 references indexed in Scilit:
- A qualitative comparison study of data structures for large line segment databasesPublished by Association for Computing Machinery (ACM) ,1992
- The hB-tree: a multiattribute indexing method with good guaranteed performanceACM Transactions on Database Systems, 1990
- Linear clustering of objects with multiple attributesPublished by Association for Computing Machinery (ACM) ,1990
- Access methods for multiversion dataPublished by Association for Computing Machinery (ACM) ,1989
- Redundancy in spatial databasesPublished by Association for Computing Machinery (ACM) ,1989
- PROBE spatial data modeling and query processing in an image database applicationIEEE Transactions on Software Engineering, 1988
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- A class of data structures for associative searchingPublished by Association for Computing Machinery (ACM) ,1984
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Organization and maintenance of large ordered indexesActa Informatica, 1972