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)
Incoming Non-self Citations Over Time
Authors
- 1. Jost Enderle (Rheinisch-Westfaelische Technische Hochschule Aachen)
- 2. Matthias Hampel (Ludwig Maximilian University of Munich)
- 3. Thomas Seidl (Rheinisch-Westfaelische Technische Hochschule Aachen)
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.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,295 | Lightning Fast and Space Efficient Inequality Joins | 2015 | VLDB | 7.448168e-05 |
| 4,568 | Overlap Interval Partition Join | 2014 | SIGMOD | 6.5300934e-05 |
| 5,145 | Conjunctive Queries with Inequalities Under Updates | 2018 | VLDB | 6.2566119e-05 |
| 5,482 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB | 6.111411e-05 |
| 6,223 | A Forward Scan based Plane Sweep Algorithm for Parallel Interval Joins | 2017 | VLDB | 5.8457826e-05 |
| 6,955 | The Complexity of Boolean Conjunctive Queries with Intersection Joins | 2022 | PODS | 5.6342744e-05 |
| 7,609 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 5.4847975e-05 |
| 9,053 | Distributed Evaluation of Top-k Temporal Joins | 2016 | SIGMOD | 5.230408e-05 |
| 13,047 | Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases | 2005 | VLDB | 4.9793485e-05 |
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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,596 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |
| 2 | 1,552 | Incremental Distance Join Algorithms for Spatial Databases | 1998 | SIGMOD |
| 3 | 1,618 | Efficient Processing of Joins on Set-valued Attributes | 2003 | SIGMOD |
| 4 | 146 | Efficient Processing of Spatial Joins Using R-trees | 1993 | SIGMOD |
| 5 | 1,514 | Computing Joins Of Relations | 1975 | SIGMOD |
| 6 | 7,609 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD |
| 7 | 4,063 | Event-Join Optimization in Temporal Relational Databases | 1989 | VLDB |
| 8 | 6,287 | On Spatially Partitioned Temporal Join | 1994 | VLDB |
| 9 | 1,128 | Managing Intervals Efficiently in Object-Relational Databases | 2000 | VLDB |
| 10 | 13,047 | Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases | 2005 | VLDB |