DBScholar

Back to papers

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)

Paper ID
8857
Venue
VLDB
Year
2000
Pagerank
0.0001202217
Overall Rank
1,139 | 92.19%
DOI
-

Incoming Non-self Citations Over Time

Authors

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 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.

Previous Page 1 / 1 Next

Semantically Similar Papers