This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The D-Tree: An Index Structure for Planar Point Queries in Location-Based Wireless Services
December 2004 (vol. 16 no. 12)
pp. 1526-1542
Location-based services (LBSs), considered as a killer application in the wireless data market, provide information based on locations specified in the queries. In this paper, we examine the indexing issue for querying location-dependent data in wireless LBSs; in particular, we focus on an important class of queries, planar point queries. To address the issues of responsiveness, energy consumption, and bandwidth contention in wireless communications, an index has to minimize the search time and maintain a small storage overhead. It is shown that the traditional point-location algorithms and spatial index structures fail to achieve either objective or both. This paper proposes a new index structure, called D-tree, which indexes spatial regions based on the divisions that form the boundaries of the regions. We describe how to construct a binary D-tree index, how to process queries based on the D-tree, and how to page the binary D-tree. Moreover, two parameterized methods for partitioning the original space, called fixed grid assignment (FGA) and adaptive grid assignment (AGA), are proposed to enhance the D-tree. The performance of the D-tree is evaluated using both synthetic and real data sets. Experimental results show that the proposed D-tree outperforms the well-known indexes such as the {\rm{R^*{\hbox{-}}tree}}, and that both the FGA and AGA approaches can achieve different performance trade-offs between the index search time and storage overhead by fine-tuning their algorithmic parameters.

[1] C. Böhm, S. Berchtold, and D.A. Keim, “Searching in High-Dimensional Spaces— Index Structures for Improving the Performance of Multimedia Databases,” ACM Computing Surveys, vol. 33, no. 3, pp. 322-373, Sept. 2001.
[2] N. Beckmann and H.-P. Kriegel, “The ${\rm{R^*{\hbox{-}}Tree}}$ : An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Conf. Management of Data, pp. 322-331, 1990.
[3] S. Berchtold, D.A. Keim, and H.-P. Kriegel, “The X-Tree: An Index Structure for High-Dimensional Data,” Proc. 22nd Int'l Conf. Very Large Data Bases (VLDB '96), Sept. 1996.
[4] M. Berg, M. Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry— Algorithms and Applications. New York: Springer, 2000.
[5] E. Bertino, B.C. Ooi, R. Sacks-Davis, K.L. Tan, J. Zobel, B. Shilovsky, and B. Catania, Indexing Techniques for Advanced Database Systems. Boston: Kluwer Academic, 1997.
[6] P. Ciaccia, M. Patella, and P. Zezula, “M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces,” Proc. 23rd Very Large Databases Conf., pp. 426-435, Aug. 1997.
[7] The R-tree Portal, http:/www.rtreeportal.org, 2003.
[8] V. Gaede and O. Günther, “Multidimensional Access Methods,” ACM Computing Surveys, vol. 30, no. 2, pp. 170-231, June 1998.
[9] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, pp. 47-54, 1984.
[10] S.E. Hambrusch, C.-M. Liu, W.G. Aref, and S. Prabhakar, “Query Processing in Broadcasted Spatial Index Trees,” Proc. Seventh Int'l Symp. Spatial and Temporal Databases (SSTD '01), pp. 502-521, July 2001.
[11] J. Hightower and G. Borriello, “Location System for Ubiquitous Computing,” Computer, vol. 34, no. 8, pp. 57-66, Aug. 2001.
[12] Q.L. Hu, W.-C. Lee, and D.L. Lee, “Power Conservative Multi-Attribute Queries on Data Broadcast,” Proc. 16th Int'l Conf. Data Eng. (ICDE 2000), pp. 157-166, Feb. 2000.
[13] T. Imielinski, S. Viswanathan, and B.R. Badrinath, “Power Efficiency Filtering of Data on Air,” Proc. Fourth Int'l Conf. Extending Database Technology (EDBT '94), pp. 245-258, Mar. 1994.
[14] T. Imielinski, S. Viswanathan, and B.R. Badrinath, “Data on Air— Organization and Access,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, May-June 1997.
[15] N. Katayama and S. Satoh, “The SR-Tree: An Index Structure for High-Dimensional Nearest Neighbor Queries,” Proc. ACM SIGMOD Int'l Conf. Management of Data, May 1997.
[16] D.G. Kirkpatrick, “Optimal Search in Planar Subdivisions,” SIAM J. Computing, vol. 15, no. 2, pp. 28-35, 1983.
[17] R. Kravets and P. Krishnan, “Power Management Techniques for Mobile Communication,” Proc. Fourth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom '98), pp. 157-168, Oct. 1998.
[18] U. Kubach and K. Rothermel, “Exploiting Location Information for Infostation-Based Hoarding,” Proc. Seventh Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom '01), pp. 15-27, July 2001.
[19] D.L. Lee, W.-C. Lee, J. Xu, and B. Zheng, “Data Management in Location-Dependent Information Services: Challenges and Issues,” IEEE Pervasive Computing, vol. 1, no. 3, pp. 65-72, July-Sept. 2002.
[20] K. Lin, H.V. Jagadish, and C. Faloutsos, “The TV-Tree: An Index Structure for High-Dimensional Data,” Very Large Databases J., vol. 3, no. 4, pp. 517-542, 1994.
[21] B.C. Ooi, Efficient Query Processing in Geographic Information Systems. Springer Verlag, 1990.
[22] B.C. Ooi, R. Sacks-Davis, and K.J. Mcdonell, “Spatial Indexing in Binary Decomposition and Spatial Bounding,” Information Systems, vol. 16, no. 2, pp. 211-237, 1991.
[23] Q. Ren and M.H. Dunham, “Using Semantic Caching to Manage Location Dependent Data in Mobile Computing,” Proc. Sixth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom 2000), pp. 210-221, Aug. 2000.
[24] H. Samet, “The Quadtree and Related Hierarchical Data Structures,” ACM Computing Survey, vol. 16, no. 2, pp. 187-260, June 1984.
[25] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The ${\rm{R^+{\hbox{-}}Tree}}$ : A Dynamic Index for Multi-Dimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB '87), pp. 507-518, 1987.
[26] A.Y. Seydim, M.H. Dunham, and V. Kumar, “Location Dependent Query Processing,” Proc. Second ACM Int'l Workshop Data Eng. for Wireless and Mobile Access (MobiDE '01), pp. 47-53, May 2001.
[27] D. White and R. Jain, “Similarity Indexing with the SS-Tree,” Proc. 11th IEEE Int'l Conf. Data Eng. (ICDE '95), 1995.
[28] J. Xu, X. Tang, and D.L. Lee, “Performance Analysis of Location-Dependent Cache Invalidation Schemes for Mobile Environments,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 2, pp. 474-488, Mar./Apr. 2003.
[29] J. Xu, B. Zheng, W.-L. Lee, and D.L. Lee, “Energy-Efficient Index for Querying Location-Dependent Data in Mobile Broadcast Environments,” Proc. 19th IEEE Int'l Conf. Data Eng. (ICDE '03), pp. 239-250, Mar. 2003.
[30] J. Xu, W.-L. Lee, and X. Tang, “Exponential Index: A Parameterized Distributed Indexing Scheme for Data on Air,” Proc. Second ACM/USENIX Int'l Conf. Mobile Systems, Applications, and Services (MobiSys '04), June 2004.
[31] C. Yu, B.C. Ooi, K.-L. Tan, and H.V. Jagadish, “Indexing the Distance: An Efficient Method to KNN Processing,” Proc. 27th Int'l Conf. Very Large Data Bases (VLDB '01), pp. 421-430, Sept. 2001.
[32] J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D.L. Lee, “Location-Based Spatial Queries,” Proc. 18th ACM SIGMOD Conf., pp. 443-454, June 2003.
[33] B. Zheng, J. Xu, and D.L. Lee, “Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments,” IEEE Trans. Computers, special issue on database management and mobile computing, vol. 51, no. 10, pp. 1141-1153, Oct. 2002.
[34] B. Zheng, W.C. Lee, and D.L. Lee, “Semantic Cache for Mobile Proximity Search,” ACM Wireless Network, 2004.

Index Terms:
Location-dependent data, mobile computing, index structure, energy conservation, spatial database, data broadcast.
Citation:
Jianliang Xu, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee, "The D-Tree: An Index Structure for Planar Point Queries in Location-Based Wireless Services," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 12, pp. 1526-1542, Dec. 2004, doi:10.1109/TKDE.2004.97
Usage of this product signifies your acceptance of the Terms of Use.