Managing Intervals Efficiently in Object-Relational Databases
Summary: Introduces the Relational Interval Tree, an object-relational interval index using unmodified built-in DBMS indexes. It supports dynamic updates and intersection queries with strong I/O bounds, outperforming competing methods by up to 42× in disk accesses. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hans-Peter Kriegel (University of Munich)
- 2. Marco Pötke (University of Munich)
- 3. Thomas Seidl (University of Munich)
BibTeX Citation
@article{kriegel_vldb00,
title = {{Managing Intervals Efficiently in Object-Relational Databases}},
author = {Kriegel, Hans-Peter and Pötke, Marco and Seidl, Thomas},
journal = {PVLDB},
series = {{VLDB} '00},
year = {2000}
}
Incoming Citations (Sorted by Pagerank)
Showing 18 of 18 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.001992968 |
| 4 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0011405675 |
| 44 | The R+-Tree: A Dynamic Multi-Dimensional Index for Objects | 1987 | VLDB | 0.00045337853 |
| 206 | Generalized Search Trees for Database Systems (Extended Abstract) | 1995 | VLDB | 0.00024986675 |
| 1,226 | Fractals for Secondary Key Retrieval | 1989 | PODS | 0.00011431306 |
| 2,047 | Indexing for Data Models with Constraints and Classes (Extended Abstract) | 1993 | PODS | 9.123147e-05 |
| 2,149 | The Time Index: An Access Structure for Temporal Data | 1990 | VLDB | 8.9552337e-05 |
| 2,828 | Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data | 1991 | SIGMOD | 7.9650643e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 113 | Interval Hierarchies And Their Application To Predicate Files | 1977 | SIGMOD |
| 2 | 9,100 | Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes | 2009 | PODS |
| 3 | 9,503 | Main-Memory Operation Buffering for Efficient R-Tree Update | 2007 | VLDB |
| 4 | 7,831 | The hcC-tree: An Efficient Index Structure For Object Oriented Databases | 1994 | VLDB |
| 5 | 13,111 | Improving Performance with Bulk-Inserts in Oracle R-Trees | 2003 | VLDB |
| 6 | 9,522 | R-Tree Based Indexing of Now-Relative Bitemporal Data | 1998 | VLDB |
| 7 | 2,047 | Indexing for Data Models with Constraints and Classes (Extended Abstract) | 1993 | PODS |
| 8 | 3,034 | A Revised R*-tree in Comparison with Related Index Structures | 2009 | SIGMOD |
| 9 | 4,336 | Joining Interval Data in Relational Databases | 2004 | SIGMOD |
| 10 | 13,047 | Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases | 2005 | VLDB |