2015
DOI: 10.1007/978-3-319-20424-6_19
|View full text |Cite
|
Sign up to set email alerts
|

Configuring Spatial Grids for Efficient Main Memory Joins

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 4 publications
0
3
0
Order By: Relevance
“…It partitions space in a uniform grid and assigns the elements, belonging to the pivots, to the cells they overlap with. Finally, it probes the grid with the elements from the candidate set to find pairs of intersecting elements [11]. When TRANSFORMERS uses the node level as data layout it additionally filters elements before the in-memory join.…”
Section: Transformers Indexingmentioning
confidence: 99%
See 2 more Smart Citations
“…It partitions space in a uniform grid and assigns the elements, belonging to the pivots, to the cells they overlap with. Finally, it probes the grid with the elements from the candidate set to find pairs of intersecting elements [11]. When TRANSFORMERS uses the node level as data layout it additionally filters elements before the in-memory join.…”
Section: Transformers Indexingmentioning
confidence: 99%
“…Like the approaches we compare it with and driven by our motivating application, TRANSFORMERS is designed to join two static spatial datasets and we do not compare it to self-joins or trajectory joins. PBSM and TRANSFORMERS use the grid hash join [11] as the in-memory join algorithm, while R-TREE uses the plane sweep. R-TREE is based on R-Trees bulkloaded using the STR approach [10].…”
Section: A Experimental Setupmentioning
confidence: 99%
See 1 more Smart Citation