Database Paper Browser

Back to papers

Joining Interval Data in Relational Databases

Summary: Introduces Relational Interval Tree–based join algorithms for interval-valued attributes in relational databases. Implemented on top of any RDBMS, the approach yields substantial speedups over standard interval-join methods, with Oracle9i experiments demonstrating significant gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3559
Venue
SIGMOD
Year
2004
Pagerank
5.9604127e-05
Overall Rank
4,737 | 67.05%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 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