ToSS-it: A Cloud-Based Throwaway Spatial Index Structure for Dynamic Location Data

The widespread use of GPS-enabled devices have led to a number of emerging applications that require monitoring and querying a large number of moving objects, such as in location-based services, mobile phone social networking, UAV surveillance, and car navigation systems. In such applications, indexes for moving objects must support queries efficiently and also cope with frequent updates. In this paper, we propose a cloud-based throwaway index structure, dubbed ToSS-it, where we generate the index from scratch in a short period of time rather than updating it with every location change of the moving objects. ToSS-it employs inter-node and intra-node multi-core parallelism paradigm to rapidly construct a distributed Voronoi Diagram. ToSS-it scales out by using a voronoi partitioning technique that minimizes the network message exchanges between the nodes (i.e., The major overhead in parallel generation of Voronoi Diagrams), and scales up since it fully exploits the multi-core CPUs available on each server. As a comparison point, with the state-of-the-art cloud-based spatial index structure (RT-CAN), if at least 7% of the objects are moving and issue updates to the index, it is faster to recreate ToSS-it from scratch than updating RT-CAN.

[1]  Witold Litwin,et al.  k-RP*s: a scalable distributed data structure for high-performance multi-attribute access , 1996, Fourth International Conference on Parallel and Distributed Information Systems.

[2]  Barruquer Moner IX. References , 1971 .

[3]  Beng Chin Ooi,et al.  Query and Update Efficient B+-Tree Based Indexing of Moving Objects , 2004, VLDB.

[4]  Cyrus Shahabi,et al.  VoR-tree , 2010, Proc. VLDB Endow..

[5]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, Second Edition , 2000, Wiley Series in Probability and Mathematical Statistics.

[6]  Beng Chin Ooi,et al.  Indexing multi-dimensional data in a cloud system , 2010, SIGMOD Conference.

[7]  Cédric du Mouza,et al.  SD-Rtree: A Scalable Distributed Rtree , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[8]  Beng Chin Ooi,et al.  ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects , 2008, SIGMOD Conference.

[9]  Christopher M. Gold,et al.  Voronoi Hierarchies , 2006, GIScience.

[10]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[11]  Shahram Ghandeharizadeh,et al.  BG: A Benchmark to Evaluate Interactive Social Networking Actions , 2013, CIDR.

[12]  Jens Dittrich,et al.  Indexing Moving Objects Using Short-Lived Throwaway Indexes , 2009, SSTD.

[13]  Zhen He,et al.  Boosting Moving Object Indexing through Velocity Partitioning , 2012, Proc. VLDB Endow..

[14]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[15]  Franziska Hoffmann,et al.  Spatial Tessellations Concepts And Applications Of Voronoi Diagrams , 2016 .

[16]  Guoren Wang,et al.  An Efficient Quad-Tree Based Index Structure for Cloud Data Management , 2011, WAIM.

[17]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[18]  Beng Chin Ooi,et al.  Efficient Processing of k Nearest Neighbor Joins using MapReduce , 2012, Proc. VLDB Endow..

[19]  Ugur Demiryurek,et al.  Indexing Network Voronoi Diagrams , 2012, DASFAA.

[20]  Farnoush Banaei Kashani,et al.  Voronoi-Based Geospatial Query Processing with MapReduce , 2010, 2010 IEEE Second International Conference on Cloud Computing Technology and Science.

[21]  Yufei Tao,et al.  An efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces , 2004, IEEE Transactions on Knowledge and Data Engineering.

[22]  Divyakant Agrawal,et al.  Discovery of Influence Sets in Frequently Updated Databases , 2001, VLDB.

[23]  Naphtali Rishe,et al.  Experiences on Processing Spatial Data with MapReduce , 2009, SSDBM.

[24]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[25]  Christian S. Jensen,et al.  Thread-Level Parallel Indexing of Update Intensive Moving-Object Workloads , 2011, SSTD.

[26]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.