Plane Sweep Algorithm

In-Memory Interval Joins

The VLDB Journal ◽

10.1007/s00778-020-00639-0 ◽

2021 ◽

Author(s):

Panagiotis Bouros ◽

Nikos Mamoulis ◽

Dimitrios Tsitsigkos ◽

Manolis Terrovitis

Keyword(s):

Parallel Computation ◽

State Of The Art ◽

Complex Data ◽

Plane Sweep ◽

Join Algorithm ◽

Sweep Algorithm ◽

Join Algorithms ◽

Domain Partitioning ◽

Complex Data Structure ◽

Independent Tasks

AbstractThe interval join is a popular operation in temporal, spatial, and uncertain databases. The majority of interval join algorithms assume that input data reside on disk and so, their focus is to minimize the I/O accesses. Recently, an in-memory approach based on plane sweep (PS) for modern hardware was proposed which greatly outperforms previous work. However, this approach relies on a complex data structure and its parallelization has not been adequately studied. In this article, we investigate in-memory interval joins in two directions. First, we explore the applicability of a largely ignored forward scan (FS)-based plane sweep algorithm, for single-threaded join evaluation. We propose four optimizations for FS that greatly reduce its cost, making it competitive or even faster than the state-of-the-art. Second, we study in depth the parallel computation of interval joins. We design a non-partitioning-based approach that determines independent tasks of the join algorithm to run in parallel. Then, we address the drawbacks of the previously proposed hash-based partitioning and suggest a domain-based partitioning approach that does not produce duplicate results. Within our approach, we propose a novel breakdown of the partition-joins into mini-joins to be scheduled in the available CPU threads and propose an adaptive domain partitioning, aiming at load balancing. We also investigate how the partitioning phase can benefit from modern parallel hardware. Our thorough experimental analysis demonstrates the advantage of our novel partitioning-based approach for parallel computation.

Download Full-text

Plane Sweep Algorithm

Encyclopedia of GIS ◽

10.1007/978-3-319-17885-1_989 ◽

2017 ◽

pp. 1594-1597

Author(s):

Jordan Wood ◽

Sangho Kim

Keyword(s):

Plane Sweep ◽

Sweep Algorithm

Download Full-text

A plane-sweep algorithm for finding a closest pair among convex planar objects

STACS 92 - Lecture Notes in Computer Science ◽

10.1007/3-540-55210-3_186 ◽

1992 ◽

pp. 219-232 ◽

Cited By ~ 3

Author(s):

Frank Bartling ◽

Klaus Hinrichs

Keyword(s):

Plane Sweep ◽

Closest Pair ◽

Sweep Algorithm

Download Full-text

Overlay Algorithm for Simple Subdivision of Arbitrary Polygon in Plane

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.219-220.223 ◽

2011 ◽

Vol 219-220 ◽

pp. 223-227

Author(s):

Xi Juan Guo ◽

Lei Chang ◽

Yan Li Gao

Keyword(s):

Linear Time ◽

Simple Polygon ◽

Minkowski Sum ◽

Plane Sweep ◽

Sweep Algorithm ◽

Overlay Graph ◽

Planar Subdivisions ◽

Arbitrary Polygon ◽

Line Segment Intersection ◽

Important Branch

The overlay algorithm is an important branch in computational geometry field, it is an important process for computing exact Minkowski sum of two convex polyhedrons. By improving the existing plane sweep algorithm, the overlay algorithm for simple subdivision of arbitrary polygon in plane is given. The algorithm can be used to overlay arbitrary polygon after subdivision into simple polygon in the plane. It has lower time complexity than the existing overlay algorithm. The whole algorithm consists of three steps: line segment intersection, reconstructing topology and constructing the DCEL for overlay graph. The results show that the algorithm can compute the overlay of two planar subdivisions in linear time.

Download Full-text