A Class of Data Structures for Associative Searching
Summary: Map tuples to integers by bit-interleaving (Morton/Z-order), letting conventional 1D indexes (e.g., B-trees) index multidimensional data. Produces a class of structures—an efficiently balanceable kd-tree variant, a simpler multidimensional B-tree, and related range-search indexes—that also support efficient set operations. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. J. A. Orenstein (University of Massachusetts Amherst)
- 2. T. H. Merrett (McGill University)
BibTeX Citation
@inproceedings{orenstein_pods84,
address = {New York, NY, USA},
series = {{PODS} '84},
title = {{A Class of Data Structures for Associative Searching}},
url = {https://dl.acm.org/doi/10.1145/588011.588037},
doi = {10.1145/588011.588037},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Orenstein, J. A. and Merrett, T. H.},
year = {1984}
}Incoming Citations (Sorted by Pagerank)
Showing 39 of 39 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8 | The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes | 1981 | SIGMOD | 0.00081207565 |
| 528 | Interpolation-Based Index Maintenance | 1983 | PODS | 0.00016854501 |
| 857 | Storage Mappings For Multidimensional Linear Dynamic Hashing | 1983 | PODS | 0.00013392166 |
| 8,573 | A Dynamic Hash File for Random and Sequential Accessing | 1983 | VLDB | 5.2982459e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,554 | MULTIKEY RETRIEVAL from K-d TREES and QUAD-TREES | 1985 | SIGMOD |
| 2 | 13,277 | Fast High-Dimensional Data Search in Incomplete Databases | 1998 | VLDB |
| 3 | 4,183 | Distributing a Search Tree Among a Growing Number of Processors | 1994 | SIGMOD |
| 4 | 2,051 | Indexing for Data Models with Constraints and Classes (Extended Abstract) | 1993 | PODS |
| 5 | 1,514 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS |
| 6 | 3,761 | Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures | 2016 | PODS |
| 7 | 12,828 | Worst-Case Efficient Range Search Indexing | 2009 | PODS |
| 8 | 4,466 | Balanced Multidimensional Extendible Hash Tree | 1986 | PODS |
| 9 | 6,597 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB |
| 10 | 8 | The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes | 1981 | SIGMOD |