Expressive Location-Based Continuous Query Evaluation with Binary Decision Diagrams

Many location-based services require rich and expressive query language support for filtering large amounts of information over thousands of concurrently executing continuous queries. Parts of these queries may overlap or logically depend on each other suggesting the possibility to amortize the query execution over shared sub-queries and prune query execution according to dependencies to achieve real-time processing requirements inherent to many location-based applications. In this paper spatio-temporal queries constitute location constraints monitored by applications. We develop the Constraint Combination Binary Decision Diagrams (CCBDD), an efficient location constraint matching algorithm, and query indexing based on Binary Decision Diagrams. With CCBDD, redundant computations in shared sub-queries are avoided, and query dependencies are identified and pruned. Empirical results show that the CCBDD structure greatly improves matching performance with shared query execution and economical memory use.

[1]  Christian S. Jensen,et al.  Indexing the positions of continuously moving objects , 2000, SIGMOD '00.

[2]  Klaus H. Hinrichs,et al.  Managing uncertainty in moving objects databases , 2004, TODS.

[3]  Yilin Zhao,et al.  Standardization of mobile phone positioning for 3G systems , 2002, IEEE Commun. Mag..

[4]  Yufei Tao,et al.  Continuous Constraint Query Evaluation for Spatiotemporal Streams , 2007, SSTD.

[5]  Alon Efrat,et al.  Buddy tracking-efficient proximity detection among mobile friends , 2004, IEEE INFOCOM 2004.

[6]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[7]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[8]  Hans-Arno Jacobsen,et al.  Evaluating Proximity Relations Under Uncertainty , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[9]  Monica S. Lam,et al.  Cloning-based context-sensitive pointer alias analysis using binary decision diagrams , 2004, PLDI '04.

[10]  Hans-Arno Jacobsen,et al.  Efficient Constraint Processing for Highly Personalized Location Based Services , 2004, VLDB.

[11]  Beate Bollig,et al.  Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.

[12]  Yannis Manolopoulos,et al.  Closest pair queries in spatial databases , 2000, SIGMOD '00.

[13]  G. De Micheli,et al.  An application of zero-suppressed binary decision diagrams to clustering analysis of DNA microarray data , 2004, The 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[14]  S. Minato Binary Decision Diagrams and Applications for VLSI CAD , 1995 .

[15]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[16]  Walid G. Aref,et al.  Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects , 2002, IEEE Trans. Computers.

[17]  Hans-Arno Jacobsen,et al.  Efficient constraint processing for location-aware computing , 2005, MDM '05.

[18]  Philip S. Yu,et al.  Indexing continual range queries for location-aware mobile services , 2004, IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004.

[19]  R. I. Bahar,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[20]  Christian S. Jensen,et al.  Lopez: "Indexing the Positions of Continuously Moving Objects , 2000, SIGMOD 2000.

[21]  Walid G. Aref,et al.  SINA: scalable incremental processing of continuous queries in spatio-temporal databases , 2004, SIGMOD '04.

[22]  Randal E. Bryant Binary decision diagrams and beyond: enabling technologies for formal verification , 1995, ICCAD.

[23]  Alexander Saldanha,et al.  Fast discrete function evaluation using decision diagrams , 1995, ICCAD.

[24]  Walid G. Aref,et al.  Scalable spatio-temporal continuous query processing for location-aware services , 2004, Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004..

[25]  Hans-Arno Jacobsen,et al.  Adaptive location constraint processing , 2007, SIGMOD '07.

[26]  Masahiro Fujita,et al.  Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation , 1997, Formal Methods Syst. Des..

[27]  Jianliang Xu,et al.  Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services , 2005, The VLDB Journal.

[28]  Hans-Arno Jacobsen,et al.  A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[29]  Dimitrios Gunopulos,et al.  On indexing mobile objects , 1999, PODS '99.

[30]  Yufei Tao,et al.  Location-based spatial queries , 2003, SIGMOD '03.

[31]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.