The Community for Technology Leaders
RSS Icon
Issue No.03 - March (2012 vol.24)
pp: 547-560
Ken C.K. Lee , University of Massachusetts Dartmouth, Dartmouth
Wang-Chien Lee , Pennsylvania State University, University Park
Baihua Zheng , Singapore Management University, Singapore
Yuan Tian , Pennsylvania State University, University Park
In this paper, we present a new system framework called ROAD for spatial object search on road networks. ROAD is extensible to diverse object types and efficient for processing various location-dependent spatial queries (LDSQs), as it maintains objects separately from a given network and adopts an effective search space pruning technique. Based on our analysis on the two essential operations for LDSQ processing, namely, network traversal and object lookup, ROAD organizes a large road network as a hierarchy of interconnected regional subnetworks (called Rnets). Each Rnet is augmented with 1) shortcuts and 2) object abstracts to accelerate network traversals and provide quick object lookups, respectively. To manage those shortcuts and object abstracts, two cooperating indices, namely, Route Overlay and Association Directory are devised. In detail, we present 1) the Rnet hierarchy and several properties useful in constructing and maintaining the Rnet hierarchy, 2) the design and implementation of the ROAD framework, and 3) a suite of efficient search algorithms for single-source LDSQs and multisource LDSQs. We conduct a theoretical performance analysis and carry out a comprehensive empirical study to evaluate ROAD. The analysis and experiment results show the superiority of ROAD over the state-of-the-art approaches.
Location-dependent spatial query, spatial road network, indexing techniques, and search algorithms.
Ken C.K. Lee, Wang-Chien Lee, Baihua Zheng, Yuan Tian, "ROAD: A New Spatial Object Search Framework for Road Networks", IEEE Transactions on Knowledge & Data Engineering, vol.24, no. 3, pp. 547-560, March 2012, doi:10.1109/TKDE.2010.243
[1] Garmin, "POI Loader," , 2010.
[2] Google, "Map Maker,", 2010.
[3] M.R. Kolahdouzan and C. Shahabi, "Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases," Proc. 30th Int'l Conf. Very Large Data Bases (VLDB), pp. 840-851, 2004.
[4] H.-J. Cho and C.-W. Chung, "An Efficient and Scalable Approach to CNN Queries in a Road Network," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 865-876, 2005.
[5] H. Hu, D.L. Lee, and J. Xu, "Fast Nearest Neighbor Search on Road Networks," Proc. 10th Int'l Conf. Extending Database Technology (EDBT), pp. 186-203, 2006.
[6] H. Hu, D.L. Lee, and V.C.S. Lee, "Distance Indexing on Road Networks," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 894-905, 2006.
[7] D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, "Query Processing in Spatial Network Databases," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 802-813, 2003.
[8] M.L. Yiu, N. Mamoulis, and D. Papadias, "Aggregate Nearest Neighbor Queries in Road Networks," IEEE Trans. Knowledge and Data Eng., vol. 17, no. 6, pp. 820-833, 2005.
[9] R. Dechter and J. Pearl, "Generalized Best-First Search Strategies and the Optimality of $A^{\ast}$ ," J. ACM, vol. 32, no. 3, pp. 505-536, 1985.
[10] E.W. Dijkstra, "A Note on two Problems in Connexion with Graphs," Proc. Numerische Mathematik, pp. 269-271, 1959.
[11] N. Jing, Y.-W. Huang, and E.A. Rundensteiner, "Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation," IEEE Trans. Knowledge and Data Eng., vol. 10, no. 3, pp. 409-432, 1998.
[12] S. Jung and S. Pramanik, "An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps," IEEE Trans. Knowledge and Data Eng., vol. 14, no. 5, pp. 1029-1046, 2002.
[13] H. Samet, J. Sankaranarayanan, and H. Alborzi, "Scalable Network Distance Browsing in Spatial Databases," Proc. 2008 ACM SIGMOD Conf., pp. 43-54, 2008.
[14] J. Sankaranarayanan, H. Alborzi, and H. Samet, "Efficient Query Processing on Spatial Networks," Proc. 13th Ann. ACM Int'l Workshop on Geographic Information Systems, pp. 200-209, 2005.
[15] Y.-W. Huang, N. Jing, and E.A. Rundensteiner, "Effective Graph Clustering for Path Queries in Digital Map Databases," Proc. Fifth Int'l Conf. Information and Knowledge Management (CIKM '96), pp. 215-222, 1996.
[16] B. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," Bell Systems Technical J., vol. 49, no. 2, pp. 291-308, 1970.
[17] K.C.K. Lee, W.-C. Lee, and B. Zheng, "Fast Object Search on Road Networks," Proc. Int'l Conf. Extending Database Technology (EDBT), pp. 1018-1029, 2009.
[18] B.H. Bloom, "Space/Time Trade-Offs in Hash Coding with Allowable Errors," Comm. ACM, vol. 13, no. 7, pp. 422-426, 1970.
[19] C. Faloutsos and S. Christodoulakis, "Signature Files: An Access Method for Documents and Its Analytical Performance Evaluation," ACM Trans. Information Systems (TOIS), vol. 2, no. 4, pp. 267-288, 1984.
[20] F. Li, "Li's Collections of Real Road Network Data," http:/www., 2010.
[21] NAVTEQ, "Development Resources," http:/developer.navteq. com, 2010.
[22] S. Shekhar and D.-R. Liu, "CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations," IEEE Trans. Knowledge and Data Eng., vol. 9, no. 1, pp. 102-119, 1997.
[23] K. Deng, X. Zhou, and H.T. Shen, "Multi-source Skyline Query Processing in Road Networks," Proc. 23rd IEEE Int'l Conf. Data Eng. ICDE, pp. 796-805, 2007.
[24] Y. Du, D. Zhang, and T. Xia, "The Optimal-Location Query," Proc. Int'l Symp. Spatial and Temporal Databases (SSTD '05), pp. 163-180, 2005.
4 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool