DBScholar

Back to papers

Interval Hierarchies And Their Application To Predicate Files

Summary: Dynamic interval-hierarchy index for predicate files enabling efficient retrieval on simple conjunctive predicates. Search and maintenance algorithms provide O(log n) time for a file of n predicates, enabling scalable predicate management for data distribution and concurrency control. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2123
Venue
SIGMOD
Year
1977
Pagerank
0.00032684992
Overall Rank
113 | 99.23%
DOI
10.1145/509404.509431

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{wong_sigmod77,
        title = {{INTERVAL HIERARCHIES AND THEIR APPLICATION TO PREDICATE FILES}},
        author = {Wong, Kai C. and Edelberg, Murray},
        series = {{SIGMOD} '77},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/509404.509431},
        url = {https://dl.acm.org/doi/10.1145/509404.509431},
        year = {1977}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0020210012
3,654 Simple Rational Guidance for Chopping Up Transactions 1992 SIGMOD 7.2235482e-05
4,351 The Complexity Of Testing Predicate Locks 1979 SIGMOD 6.7495011e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers