Overlap Interval Partition Join
Summary: OIP for valid-time data; partition time into k granules with overlapping partitions, cluster gap indep. of interval length. OIPJOIN partitions; joins only overlapping partitions, derives optimal k from data and IO costs, beating overlap-join methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Anton Dignös
- 2. Michael H. Böhlen
- 3. Johann Gamper
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,154 | A Forward Scan based Plane Sweep Algorithm for Parallel Interval Joins | 2017 | VLDB | 5.1815134e-05 |
| 6,359 | Snapshot Semantics for Temporal Multiset Relations | 2019 | VLDB | 5.0963959e-05 |
| 7,915 | HINT: A Hierarchical Index for Intervals in Main Memory | 2022 | SIGMOD | 4.617775e-05 |
| 8,159 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 4.5729025e-05 |
| 8,857 | Distributed Evaluation of Top-k Temporal Joins | 2016 | SIGMOD | 4.4345027e-05 |
| 9,446 | TRACE: Real-time Compression of Streaming Trajectories in Road Networks | 2021 | VLDB | 4.3404859e-05 |
| 10,501 | Relevance Queries for Interval Data | 2025 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016162015 |
| 986 | Managing Intervals Efficiently in Object-Relational Databases | 2000 | VLDB | 0.00014838568 |
| 1,174 | Spatial Hash-Joins | 1996 | SIGMOD | 0.00013486418 |
| 3,255 | A Revised R*-tree in Comparison with Related Index Structures | 2009 | SIGMOD | 7.3160522e-05 |
| 3,457 | Size Separation Spatial Join | 1997 | SIGMOD | 7.0755358e-05 |
| 4,737 | Joining Interval Data in Relational Databases | 2004 | SIGMOD | 5.9604127e-05 |
| 4,780 | TOUCH: In-Memory Spatial Join by Hierarchical Data-Oriented Partitioning | 2013 | SIGMOD | 5.9263494e-05 |
| 6,454 | On Spatially Partitioned Temporal Join | 1994 | VLDB | 5.0569697e-05 |
| 6,830 | Temporal Alignment | 2012 | SIGMOD | 4.9136035e-05 |
| 7,203 | Indexing Methods for Moving Object Databases: Games and Other Applications | 2013 | SIGMOD | 4.8019323e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,953 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS | 5.8085795e-05 |
| 3,998 | Event-Join Optimization in Temporal Relational Databases | 1989 | VLDB | 6.5472662e-05 |
| 3,515 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS | 7.0220813e-05 |
| 2,275 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB | 9.1262202e-05 |
| 550 | Hash-Partitioned Join Method Using Dynamic Destaging Strategy | 1988 | VLDB | 0.00020359891 |
| 6,154 | A Forward Scan based Plane Sweep Algorithm for Parallel Interval Joins | 2017 | VLDB | 5.1815134e-05 |
| 6,619 | Near-Optimal Distributed Band-Joins through Recursive Partitioning | 2020 | SIGMOD | 4.9910152e-05 |
| 8,159 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 4.5729025e-05 |
| 4,737 | Joining Interval Data in Relational Databases | 2004 | SIGMOD | 5.9604127e-05 |
| 6,454 | On Spatially Partitioned Temporal Join | 1994 | VLDB | 5.0569697e-05 |