Please use this identifier to cite or link to this item:
|Title:||TOUCH: In-memory spatial join by hierarchical data-oriented partitioning|
|Citation:||Nobari, S.,Karras, P.,Tauheed, F.,Bressan, S.,Heinis, T.,Ailamaki, A. (2013). TOUCH: In-memory spatial join by hierarchical data-oriented partitioning. Proceedings of the ACM SIGMOD International Conference on Management of Data : 701-712. ScholarBank@NUS Repository. https://doi.org/10.1145/2463676.2463700|
|Abstract:||Efficient spatial joins are pivotal for many applications and particularly important for geographical information systems or for the simulation sciences where scientists work with spatial models. Past research has primarily focused on disk-based spatial joins; efficient in-memory approaches, however, are important for two reasons: a) main memory has grown so large that many datasets fit in it and b) the inmemory join is a very time-consuming part of all disk-based spatial joins. In this paper we develop TOUCH, a novel in-memory spatial join algorithm that uses hierarchical data-oriented space partitioning, thereby keeping both its memory footprint and the number of comparisons low. Our results show that TOUCH outperforms known in-memory spatial-join algorithms as well as in-memory implementations of disk-based join approaches. In particular, it has a one order of magnitude advantage over the memory-demanding state of the art in terms of number of comparisons (i.e., pairwise object comparisons), as well as execution time, while it is two orders of magnitude faster when compared to approaches with a similar memory footprint. Furthermore, TOUCH is more scalable than competing approaches as data density grows. Copyright © 2013 ACM.|
|Source Title:||Proceedings of the ACM SIGMOD International Conference on Management of Data|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 16, 2018
checked on Nov 9, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.