A class of data structures for associative searching

  • Authors:
  • J. A. Orenstein;T. H. Merrett

  • Affiliations:
  • University of Massachusetts, Amherst;School of Computer Science, McGill University

  • Venue:
  • PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

By interleaving the bits of the binary representations of the attribute values in a tuple, an integer corresponding to the tuple is created. A set of these integers represents a relation. The usual ordering of these integers corresponds to an ordering of multidimensional data that allows the use of conventional file organizations, such as Btrees, in the efficient processing of multidimensional queries (e.g. range queries). The class of data structures generated by this scheme includes a type of kd tree whose balance can be efficiently maintained, a multidimensional Btree which is simpler than previously proposed generalizations, and some previously reported data structures for range searching. All of the data structures in this class also support the efficient implementation of the set operations.