Managing Intervals Efficiently in Object-Relational Databases
Summary: Relational Interval Tree (RI-tree) uses built-in relational indexes for interval management in object-relational DBs, avoiding index augmentation. Space and I/O: O(n/b) blocks, insert/delete O(log_b n), intersection O(h log_b n + r/b) with height h independent of n; Oracle8i experiments show up to 42× fewer disk accesses and 4.9× faster queries vs rivals. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hans-Peter Kriegel
- 2. Marco Pötke
- 3. Thomas Seidl
Incoming Citations (Sorted by Pagerank)
Showing 17 of 17 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0032118946 |
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016113151 |
| 24 | The R+-Tree: A Dynamic Index For Multi-Dimensional Objects | 1987 | VLDB | 0.00083300888 |
| 242 | Generalized Search Trees for Database Systems (Extended Abstract) | 1995 | VLDB | 0.00031093647 |
| 1,250 | Fractals for Secondary Key Retrieval | 1989 | PODS | 0.00013037936 |
| 2,010 | Indexing for Data Models with Constraints and Classes (Extended Abstract) | 1993 | PODS | 9.8046157e-05 |
| 2,272 | The Time Index: An Access Structure For Temporal Data | 1990 | VLDB | 9.1458869e-05 |
| 2,592 | Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data | 1991 | SIGMOD | 8.4841264e-05 |
Previous
Page 1 / 1
Next