DBScholar

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
3621
Venue
SIGMOD
Year
2004
Pagerank
6.7925685e-05
Overall Rank
4,268 | 70.72%
DOI
10.1145/1007568.1007645

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{enderle_sigmod04,
        title = {{Joining Interval Data in Relational Databases}},
        author = {Enderle, Jost and Hampel, Matthias and Seidl, Thomas},
        series = {{SIGMOD} '04},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1007568.1007645},
        url = {https://dl.acm.org/doi/10.1145/1007568.1007645},
        year = {2004}
}

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