Database Paper Browser

Back to papers

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)

Paper ID
8666
Venue
VLDB
Year
2000
Pagerank
0.00014838568
Overall Rank
986 | 93.15%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 17 of 17 citing papers.

Rank Citing Paper Year Venue Pagerank
750 Adaptive Precision Setting for Cached Approximate Values 2001 SIGMOD 0.00017220819
1,027 Accelerating XPath Location Steps 2002 SIGMOD 0.0001458865
2,308 Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data 2004 VLDB 9.0591406e-05
4,117 Staircase Join: Teach a Relational DBMS to Watch its (Axis) Steps 2003 VLDB 6.4371566e-05
4,737 Joining Interval Data in Relational Databases 2004 SIGMOD 5.9604127e-05
5,190 Overlap Interval Partition Join 2014 SIGMOD 5.6381091e-05
6,154 A Forward Scan based Plane Sweep Algorithm for Parallel Interval Joins 2017 VLDB 5.1815134e-05
6,694 Optimal Splitters for Temporal and Multi-version Databases 2013 SIGMOD 4.9586454e-05
7,513 Ranking Large Temporal Data 2012 VLDB 4.7180617e-05
7,915 HINT: A Hierarchical Index for Intervals in Main Memory 2022 SIGMOD 4.617775e-05
8,580 LIT: Lightning-fast In-memory Temporal Indexing 2024 SIGMOD 4.492241e-05
9,569 Spatial Data Management for Computer-Aided Design 2001 SIGMOD 4.3254416e-05
10,017 Fast Indexing for Temporal Information Retrieval 2026 SIGMOD 4.1945683e-05
10,501 Relevance Queries for Interval Data 2025 SIGMOD 4.1945683e-05
10,556 Efficient Concurrent Updates to Persistent Randomized Binary Search Trees 2025 VLDB 4.1945683e-05
11,825 Efficient Top-k Indexing via General Reductions 2016 PODS 4.1945683e-05
12,564 Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases 2005 VLDB 4.1945683e-05
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.0032169493
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016162015
24 The R+-Tree: A Dynamic Index For Multi-Dimensional Objects 1987 VLDB 0.00083378538
242 Generalized Search Trees for Database Systems (Extended Abstract) 1995 VLDB 0.00031110894
1,249 Fractals for Secondary Key Retrieval 1989 PODS 0.00013044758
2,003 Indexing for Data Models with Constraints and Classes (Extended Abstract) 1993 PODS 9.8126082e-05
2,265 The Time Index: An Access Structure For Temporal Data 1990 VLDB 9.154915e-05
2,586 Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data 1991 SIGMOD 8.4928908e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
8,767 Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes 2009 PODS 4.456315e-05
19 Interval Hierarchies And Their Application To Predicate Files 1977 SIGMOD 0.00091625014
9,258 Main-Memory Operation Buffering for Efficient R-Tree Update 2007 VLDB 4.3690661e-05
7,550 The hcC-tree: An Efficient Index Structure For Object Oriented Databases 1994 VLDB 4.713674e-05
12,628 Improving Performance with Bulk-Inserts in Oracle R-Trees 2003 VLDB 4.1945683e-05
9,116 R-Tree Based Indexing of Now-Relative Bitemporal Data 1998 VLDB 4.3928853e-05
2,003 Indexing for Data Models with Constraints and Classes (Extended Abstract) 1993 PODS 9.8126082e-05
3,255 A Revised R*-tree in Comparison with Related Index Structures 2009 SIGMOD 7.3160522e-05
4,737 Joining Interval Data in Relational Databases 2004 SIGMOD 5.9604127e-05
12,564 Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases 2005 VLDB 4.1945683e-05