A Forward Scan based Plane Sweep Algorithm for Parallel Interval Joins

@article{Bouros2017AFS,
  title={A Forward Scan based Plane Sweep Algorithm for Parallel Interval Joins},
  author={Panagiotis Bouros and N. Mamoulis},
  journal={Proc. VLDB Endow.},
  year={2017},
  volume={10},
  pages={1346-1357}
}
The interval join is a basic operation that finds application in temporal, spatial, and uncertain databases. Although a number of centralized and distributed algorithms have been proposed for the efficient evaluation of interval joins, classic plane sweep approaches have not been considered at their full potential. A recent piece of related work proposes an optimized approach based on plane sweep (PS) for modern hardware, showing that it greatly outperforms previous work. However, this approach… Expand
In-Memory Interval Joins
O2iJoin: An Efficient Index-Based Algorithm for Overlap Interval Join
HINT: A Hierarchical Index for Intervals in Main Memory
Band Joins for Interval Data
ALGORITHM 1 : Plane-Sweep based Interval
Period Index: A Learned 2D Hash Index for Range and Duration Queries
Query Results over Ongoing Databases that Remain Valid as Time Passes By
  • Y. Mülle, M. Böhlen
  • Computer Science
  • 2020 IEEE 36th International Conference on Data Engineering (ICDE)
  • 2020
...
1
2
3
...

References

SHOWING 1-10 OF 27 REFERENCES
Scalable Sweeping-Based Spatial Join
Efficient processing of spatial joins using R-trees
Efficient evaluation of the valid-time natural join
Efficient temporal join processing using indices
Join operations in temporal databases
Efficient Algorithms for Large-Scale Temporal Aggregation
An interval join optimized for modern hardware
Improving Temporal Joins Using Histograms
Disjoint interval partitioning
An asymptotically optimal multiversion B-tree
...
1
2
3
...