Abstract
Efficient processing of continual range queries is important in providing location-aware mobile services. In this paper, we study a new main memory-based approach to indexing continual range queries to support location-aware mobile services. The query index is used to quickly answer the following question continually: “Which moving objects are currently located inside the boundaries of individual queries?” We present a covering tile-based (COVET) query index. A set of virtual tiles are predefined, each with a unique ID. One or more of the virtual tiles are used to strictly cover the region defined by an individual range query. The query ID is inserted into the ID lists associated with the covering tiles. These covering tiles touch each other only at the edges. A COVET index maintains a mapping between a covering tile and all the queries that contain that tile. For any object position, search is conducted indirectly via the covering tiles. More importantly, a COVET-based query index allows query evaluation to take advantage of incremental changes in object locations. Computation can be saved for those objects that have not moved outside the boundaries of covering tiles. Simulations are conducted to evaluate the effectiveness of the COVET index and compare virtual tiles of different shapes and sizes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agarwal PK, Arge L, Erickson J. Indexing moving objects. In: Proc. of ACM Symp. on Principles of Database Systems, 2000.
Aggarwal CC, Agrawal D. On nearest neighbor indexing of nonlinear trajectories. In: Proc. of ACM Symp. on Principles of Database Systems, 2003.
Aguilera MK, Strom RE, Sturman DC, Astley M, Chandra TD. Matching events in a content-based subscription system. In: Proc. of Symp. on Principles of Distributed Computing, 1999.
Cai Y, Hua KA. An adaptive query management technique for real-time monitoring of spatial regions in mobile database systems. In: Proc. of Int. Performance, Computing and Communication Conf., 2002.
Chen J, DeWitt D, Tian F, Wang Y. NiagaraCQ: A scalable continuous query system for Internet databases. In: Proc. of ACM SIGMOD Int. Conf. on Management of Data, 2000;379–390.
Chon HD, Agrawal D, Abbadi AE. Query processing for moving objects with space-time grid storage model. In: Proc. of IEEE Int. Conf. on Mobile Data Management, 2002.
Fabret F, Jacobsen HA, Llirbat F, Pereira J, Ross KA, Shasha D. Filtering algorithms and implementation for very fast publish/subscribe systems. In: Proc. of ACM SIGMOD Int. Conf. on Management of Data, 2001.
Forlizzi L, Guting RH, Nardelli E, Scheider M. A data model and data structures for moving objects. In: Proc. of ACM SIGMOD Int. Conf. on Management of Data, 2000.
Gaede V, Günther O. Multidimensional access methods. ACM Computing Surveys, 1998, 30(2):170–231.
Gedik B, Wu K-L, Yu PS, Liu L. Motion adaptive indexing for moving continual queries over moving objects. In Proc. of ACM Conf. on Information and Knowledge Management, 2004.
Guting RH, Bohlen MH, Erwig M, Jensen CS, Lorentzos NA, Schneider M, Vazirgiannis M. A foundation for representing and querying moving objects. ACM Trans. on Database Systems, 2000;25(1):1–42.
Guttman A. R-trees: A dynamic index structure for spatial searching. In: Proc. of ACM SIGMOD Int. Conf. on Management of Data, 1984.
Hanson E, Johnson T. Selection predicate indexing for active databases using interval skip lists. Information Systems, 1996;21(3):269–298.
Kalashnikov DV, Prabhakar S, Aref WG, Hambrusch SE. Efficient evaluation of continuous range queries on moving objects. In: Proc. of Int. Conf. on Database and Expert Systems Applications, 2002.
Kollios G, Gunopulos D, Tsotras VJ. On indexing mobile objects. In: Proc. of ACM Symp. on Principles of Database Systems, 1999.
Lazaridis I, Porkaew K, Mehrotra S. Dynamic queries over mobile objects. In: Proc. of Int. Conf. on Extending Database Technology, 2002.
Liu L, Pu C, Tang W. Continual queries for Internet scale event-driven information delivery. IEEE Trans. on Knowledge and Data Engineering, 11(4):610–628;July/Aug. 1999.
Park HK, Son JH, Kim MH. An efficient spatiotemporal indexing method for moving objects in mobile communication environments. In: Proc. of Int. Conf. on Mobile Data Management, 2003.
Parkinson BW, Spilker JJ, Axelrad P, Eng P. Global Positioning System: Theory and Applications, volume 2. American Institute of Aeronautics and Astronautics, 1996.
Pfoser D, Jensen CS, Theodoridis Y. Novel approaches to the indexing of moving object trajectories. In: Proc. of Very Large Data Bases, 2000.
Prabhakar S, Xia Y, Kalashnikov DV, Aref WG, Hambrusch SE. Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects. IEEE Trans. on Computers 51:1124–1140;Oct. 2002.
Samet H. Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
Sistla AP, Wolfson O, Chamberlain S, Dao S. Modeling and querying moving objects. In: Proc. of IEEE Int. Conf. on Data Engineering, 1997.
Tao Y, Papadias D, Shen Q. The TPR*-Tree: An optimized spatio-temporal access method for predictive queries. In: Proc. of Very Large Data Bases, 2003.
Šaltenis S, Jensen CS, Leutenegger ST, Lopez MA. Indexing the positions of continuously moving objects. In: Proc. of ACM SIGMOD Int. Conf. on Management of Data, 2000.
Wolfson O, Chamberlain S, Dao S, Jiang L, Mendez G. Cost and imprecision in modeling the position of moving objects. In: Proc. of IEEE Int. Conf. on Data Engineering, 1998.
Wolfson O, Sistla AP, Chamberlain S, Yesha Y. Updating and querying databases that track mobile units. Distributed and Parallel Databases 1999;7(3):257–387.
Wu K-L, Chen S-K, Yu PS. VCR indexing for fast event matching for highly-overlapping range predicates. In: Proc. of 2004 ACM Symp. on Applied Computing, 2004.
Wu K-L, Chen S-K, Yu PS. Indexing continual range queries for location-aware mobile services. In: Proc. of IEEE Int. Conf. on e-Technology, e-Commerce and e-Service, Mar. 2004;233–240.
Wu K-L, Yu PS. Efficient query monitoring using adaptive multiple key hashing. In: Proc. of ACM Int. Conf. on Information and Knowledge Management, 2002;477–484.
Author information
Authors and Affiliations
Corresponding author
Additional information
Kun-Lung Wu received the B.S. degree in Electrical Engineering from National Taiwan University, the M.S. and Ph.D. degrees in Computer Science from the University of Illinois at Urbana-Champaign. He is with the Software Tools and Techniques group at the IBM Thomas J. Watson Research Center at Hawthorne, NY. His research interests include stream data analysis, database systems, mobile computing, Internet technologies and applications, multimedia systems, and distributed computing. Dr. Wu has published many papers in referred conferences and journals. He also holds or has applied for many patents in the US and other countries.
He was an Associate Editor for the IEEE Transactions on Knowledge and Data Engineering. He has served in many international conferences and workshops as a program or organizing committee member. He was the General Chair for the third International Workshop on Advanced Issues on E-commerce and Web-Based Information Systems, WECWIS 2002. He received the Best Paper Award in the IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE 2004. He received an IBM Corporate Environmental Affair Excellence Award in 2003. Dr. Wu is an IBM Master Inventor in the Research Division. He has received several Invention Achievement Awards. Dr. Wu is a senior member of the IEEE and ACM.
Shyh-Kwei Chen received the BS degree in Computer Science and Information Engineering from National Taiwan University, Taipei, Taiwan, in 1983, the MS degree in Computer Science from the University of Minnesota, Minneapolis, in 1987, and the Ph.D. degree in Computer Science from the University of Illinois at Urbana-Champaign, in 1994.
Dr. Chen has been with the IBM Thomas J. Watson Research Center, Yorktown Heights, New York since October 1994, where he is currently a Research Staff Member. His current research interests include XML, electronic commerce, business performance management, data engineering, and compilers. He is a member of the ACM, the IEEE and the IEEE Computer Society.
Philip S. Yu received the B.S. degree in E.E. from National Taiwan University, the M.S. and Ph.D. degrees in E.E. from Stanford University, and the M.B.A. degree from New York University. He is with the IBM Thomas J. Watson Research Center and currently manager of the Software Tools and Techniques group. His research interests include data mining, Internet applications and technologies, database systems, multimedia systems, parallel and distributed processing, and performance modeling. Dr. Yu has published more than 420 papers in refereed journals and conferences. He holds or has applied for more than 250 US patents.
Dr. Yu is a Fellow of the ACM and a Fellow of the IEEE. He was the Editor-in-Chief of IEEE Transactions on Knowledge and Data Engineering. He is also an associate editor of ACM Transactions on the Internet Technology and that of ACM Transactions on Knowledge Discovery in Data. He is a member of the IEEE Data Engineering steering committee and is also on the steering committee of IEEE Conference on Data Mining. He was an editor and advisory board member of IEEE Transactions on Knowledge and Data Engineering and also a guest co-editor of the special issue on mining of databases. In addition to serving as program committee member on various conferences, he was the program co-chairs of the 11th Intl. Conference on Data Engineering and the 6th Pacific Area Conference on Knowledge Discovery and Data Mining, and the program chairs of the 2nd Intl. Workshop on Research Issues on Data Engineering: Transaction and Query Processing, the PAKDD Workshop on Knowledge Discovery from Advanced Databases, and the 2nd Intl. Workshop on Advanced Issues of E-Commerce and Web-based Information Systems. He served as the general chair of the 14th Intl. Conference on Data Engineering and the general co-chair of the 2nd IEEE Intl. Conference on Data Mining. He has received several IBM and external honors including Best Paper Award, 2 IBM Outstanding Innovation Awards, an Outstanding Technical Achievement Award, 2 Research Division Awards and the 84th plateau of Invention Achievement Awards. He received an Outstanding Contributions Award from IEEE Intl. Conference on Data Mining in 2003 and also an IEEE Region 1 Award for “promoting and perpetuating numerous new electrical engineering concepts” in 1999. Dr. Yu is an IBM Master Inventor and was recognized as one of the IBM's ten top leading inventors in 1999.
Rights and permissions
About this article
Cite this article
Wu, KL., Chen, SK. & Yu, P.S. Efficient Processing of Continual Range Queries for Location-Aware Mobile Services. Inf Syst Front 7, 435–448 (2005). https://doi.org/10.1007/s10796-005-4813-5
Issue Date:
DOI: https://doi.org/10.1007/s10796-005-4813-5