2016 IEEE International Conference on Big Data (Big Data) 2016
DOI: 10.1109/bigdata.2016.7840944
|View full text |Cite
|
Sign up to set email alerts
|

Three-dimensional spatial join count exploiting CPU optimized STR R-tree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…We count pairs only in the same or the adjacent cells from which pairs can be closer than the matching scale. The code is then updated to employ a more sophisticated sort-tile-recursive (STR) R-tree scheme for a more efficient spatial indexing (Mitsuhashi et al 2016). Note that these different versions give identical results, and the difference lies only in the speed to perform the exact pair counting.…”
Section: Halo Catalogsmentioning
confidence: 99%
“…We count pairs only in the same or the adjacent cells from which pairs can be closer than the matching scale. The code is then updated to employ a more sophisticated sort-tile-recursive (STR) R-tree scheme for a more efficient spatial indexing (Mitsuhashi et al 2016). Note that these different versions give identical results, and the difference lies only in the speed to perform the exact pair counting.…”
Section: Halo Catalogsmentioning
confidence: 99%