2014

paper

english

EN In spatial databases collocation pattern discovery is one of the most interesting fields of data mining. It consists in searching for types of spatial objects that are frequently located together in a spatial neighborhood. With the advent of data gathering techniques, huge volumes of spatial data are being collected. To cope with processing of such datasets a GPU accelerated version of the collocation pattern mining algorithm has been proposed recently [3]. However, the method assumes that a supporting structure that contains information about neighborhoods (called iCPI-tree) is given in advance. In this paper we present a GPU-based version of iCPI-tree generation algorithm for the collocation pattern discovery problem. In an experimental evaluation we compare our GPU implementation with a parallel implementation of iCPI-tree generation method for CPU. Collected results show that proposed solution is multiple times faster than the CPU version of the algorithm.

276 - 289

10.1007/978-3-319-10933-6_21

https://link.springer.com/chapter/10.1007/978-3-319-10933-6_21

Advances in Databases and Information Systems : 18th East European Conference, ADBIS 2014, Ohrid, Macedonia, September 7-10, 2014 : proceedings

18th East European Conference on Advances in Databases and Information Systems and Associated Satellite Events, ADBIS 2014, 7-10.09.2014, Ohrid, Macedonia

WoS (15)