Distance-Aware Join for Indoor Moving Objects

Indoor spaces accommodate large parts of people's lives. Relevant techniques are thus needed to efficiently manage indoor moving objects, whose positions are detected by technologies, such as Assisted GPS, Wi-Fi, RFID, and Bluetooth. Among such techniques, the distance-aware join processing is of importance in practice for indoor spatial databases. Such join operators leverage a series of applications, such as indoor mobile service and facility monitoring. However, distance-aware joining over indoor moving objects is challenging because: (1) indoor spaces are characterized by many special entities and thus render distance calculation very complex; (2) the limitations of indoor positioning technologies create inherent uncertainties in indoor moving objects data. In this paper, we study two representative join predicates in indoor settings, semi-range join and semi-neighborhood join. To implement them, we define and categorize the indoor distances between indoor uncertain objects, and derive different distance bounds that can facilitate the join processing. We design a composite index scheme that integrates indoor geometries, indoor topologies, as well as indoor uncertain objects, and thus supports the join processing efficiently. The results of extensive experimental studies demonstrate that our proposals are efficient and scalable in evaluating distance-aware join over indoor moving objects.

[1]  Jiyeong Lee,et al.  A Spatial Access-Oriented Implementation of a 3-D GIS Topological Data Model for Urban Entities , 2004, GeoInformatica.

[2]  Hua Lu,et al.  A Foundation for Efficient Indoor Distance-Aware Query Processing , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[3]  Hua Lu,et al.  Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space , 2010, EDBT '10.

[4]  Lei Chen,et al.  Similarity Join Processing on Uncertain Data Streams , 2011, IEEE Transactions on Knowledge and Data Engineering.

[5]  Xiang Lian,et al.  Probabilistic Group Nearest Neighbor Queries in Uncertain Databases , 2008, IEEE Transactions on Knowledge and Data Engineering.

[6]  Hans-Peter Kriegel,et al.  Probabilistic Nearest-Neighbor Query on Uncertain Objects , 2007, DASFAA.

[7]  Hua Lu,et al.  Graph Model Based Indoor Tracking , 2009, 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware.

[8]  Dik Lun Lee,et al.  A Lattice-Based Semantic Location Model for Indoor Navigation , 2008, The Ninth International Conference on Mobile Data Management (mdm 2008).

[9]  Seth Teller,et al.  Topology of Urban Environments , 2007 .

[10]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[11]  Hua Lu,et al.  Scalable continuous range monitoring of moving objects in symbolic indoor space , 2009, CIKM.

[12]  Byung Suk Lee,et al.  Performance Evaluation of Main-Memory R-tree Variants , 2003, SSTD.

[13]  Yiannos Manoli,et al.  Multi-modal sensor data and information fusion for localization in indoor environments , 2010, 2010 7th Workshop on Positioning, Navigation and Communication.

[14]  Dieter Pfoser,et al.  Capturing the Uncertainty of Moving-Object Representations , 1999, SSD.

[15]  Feifei Li,et al.  Semantics of Ranking Queries for Probabilistic Data and Expected Ranks , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[16]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[17]  Xiang Lian,et al.  Monochromatic and bichromatic reverse skyline search over uncertain databases , 2008, SIGMOD Conference.

[18]  Sunil Prabhakar,et al.  Evaluating probabilistic queries over imprecise data , 2003, SIGMOD '03.

[19]  E. Rank,et al.  Analysis of Building Structure and Topology Based on Graph Theory , 2004 .

[20]  Reynold Cheng,et al.  Efficient Evaluation of Imprecise Location-Dependent Queries , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[21]  Yufei Tao,et al.  Query Processing in Spatial Network Databases , 2003, VLDB.

[22]  Christian Böhm,et al.  The k-Nearest Neighbour Join: Turbo Charging the KDD Process , 2004, Knowledge and Information Systems.

[23]  Hua Lu,et al.  Indexing the Trajectories of Moving Objects in Symbolic Indoor Space , 2009, SSTD.

[24]  Hans-Peter Kriegel,et al.  Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning , 2010, SSDBM.

[25]  Kyuseok Shim,et al.  Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases , 1995, VLDB.

[26]  Kyriakos Mouratidis,et al.  Spatial Queries in the Presence of Obstacles , 2004, EDBT.

[27]  Kai Zheng,et al.  Spatial query processing for fuzzy objects , 2012, The VLDB Journal.

[28]  Yufei Tao,et al.  All-nearest-neighbors queries in spatial databases , 2004, Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004..

[29]  Hanspeter A. Mallot,et al.  Graph-based models of space in architecture and cognitive science: a comparative analysis , 2005 .

[30]  Hua Lu,et al.  Spatio-temporal joins on symbolic indoor tracking data , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[31]  Hua Lu,et al.  Efficient distance-aware query evaluation on indoor moving objects , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[32]  T. H. Kolbe,et al.  A Multilayered Space-Event Model for Navigation in Indoor Spaces , 2009 .

[33]  Jignesh M. Patel,et al.  Efficient Evaluation of All-Nearest-Neighbor Queries , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[34]  A. Prasad Sistla,et al.  Querying the Uncertain Position of Moving Objects , 1997, Temporal Databases, Dagstuhl.

[35]  Christian Böhm,et al.  High performance clustering based on the similarity join , 2000, CIKM '00.

[36]  Sunil Prabhakar,et al.  Querying imprecise data in moving object environments , 2003, IEEE Transactions on Knowledge and Data Engineering.