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)
Incoming Non-self Citations Over Time
Authors
- 1. Kai C. Wong
- 2. Murray Edelberg
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.0032169493 |
| 2,935 | Simple Rational Guidance for Chopping Up Transactions | 1992 | SIGMOD | 7.8583979e-05 |
| 4,098 | The Complexity Of Testing Predicate Locks | 1979 | SIGMOD | 6.4546085e-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