Database Paper Browser

Back to papers

A Forward Scan based Plane Sweep Algorithm for Parallel Interval Joins

Summary: Forward-scan plane-sweep for parallel interval joins; simple to implement, low memory, with two optimizations. Domain-based partitioning with non-duplicate results, mini-join decomposition, and adaptive core scheduling enable scalable parallelism; experiments validate efficiency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11420
Venue
VLDB
Year
2017
Pagerank
5.1815134e-05
Overall Rank
6,154 | 57.19%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
6,359 Snapshot Semantics for Temporal Multiset Relations 2019 VLDB 5.0963959e-05
7,332 The Complexity of Boolean Conjunctive Queries with Intersection Joins 2022 PODS 4.7606012e-05
7,915 HINT: A Hierarchical Index for Intervals in Main Memory 2022 SIGMOD 4.617775e-05
8,580 LIT: Lightning-fast In-memory Temporal Indexing 2024 SIGMOD 4.492241e-05
10,501 Relevance Queries for Interval Data 2025 SIGMOD 4.1945683e-05
11,334 SLAM: Efficient Sweep Line Algorithms for Kernel Density Visualization 2022 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.

Previous Page 1 / 1 Next

Semantically Similar Papers