The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2012 vol.24)
pp: 1276-1290
Dimitris Sacharidis , Athena Research Center, Athens
Theodore Dalamagas , Athena Research Center, Athens
Spiros Skiadopoulos , University of Peloponnese, Tripolis
Timos Sellis , Athena Research Center, Athens
ABSTRACT
The recent advances in the infrastructure of Geographic Information Systems (GIS), and the proliferation of GPS technology, have resulted in the abundance of geodata in the form of sequences of points of interest (POIs), waypoints, etc. We refer to sets of such sequences as route collections. In this work, we consider path queries on frequently updated route collections: given a route collection and two points n_s and n_t, a path query returns a path, i.e., a sequence of points, that connects n_s to n_t. We introduce two path query evaluation paradigms that enjoy the benefits of search algorithms (i.e., fast index maintenance) while utilizing transitivity information to terminate the search sooner. Efficient indexing schemes and appropriate updating procedures are introduced. An extensive experimental evaluation verifies the advantages of our methods compared to conventional graph-based search.
INDEX TERMS
Route collections, path queries, frequent updates.
CITATION
Dimitris Sacharidis, Theodore Dalamagas, Spiros Skiadopoulos, Timos Sellis, "Evaluating Path Queries over Frequently Updated Route Collections", IEEE Transactions on Knowledge & Data Engineering, vol.24, no. 7, pp. 1276-1290, July 2012, doi:10.1109/TKDE.2011.30
REFERENCES
[1] P. Bouros, S. Skiadopoulos, T. Dalamagas, D. Sacharidis, and T.K. Sellis, "Evaluating Reachability Queries over Path Collections," Proc. Int'l Conf. Scientific and Statistical Database Management (SSDBM), pp. 398-416, 2009.
[2] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. The MIT Press and McGraw-Hill Book Company, 2001.
[3] E. Cohen, E. Halperin, H. Kaplan, and U. Zwick, "Reachability and Distance Queries via 2-Hop Labels," Proc. Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 937-946, 2002.
[4] R. Schenkel, A. Theobald, and G. Weikum, "Hopi: An Efficient Connection Index for Complex xml Document Collections," Proc. Int'l Conf. Extending Database Technology (EDBT), pp. 237-255, 2004.
[5] R. Schenkel, A. Theobald, and G. Weikum, "Efficient Creation and Incremental Maintenance of the Hopi Index for Complex XML Document Collections," Proc. Int'l Conf. Data Eng. (ICDE), pp. 360-371, 2005.
[6] J. Cheng, J.X. Yu, X. Lin, H. Wang, and P.S. Yu, "Fast Computation of Reachability Labeling for Large Graphs," Proc. Int'l Conf. Extending Database Technology (EDBT), pp. 961-979, 2006.
[7] J. Cheng, J.X. Yu, X. Lin, H. Wang, and P.S. Yu, "Fast Computing Reachability Labelings for Large Graphs with High Compression Rate," Proc. Int'l Conf. Extending Database Technology (EDBT), pp. 193-204, 2008.
[8] R. Bramandia, B. Choi, and W.K. Ng, "On Incremental Maintenance of 2-Hop Labeling of Graphs," Proc. Int'l Conf. World Wide Web (WWW), pp. 845-854, 2008.
[9] R. Jin, Y. Xiang, N. Ruan, and D. Fuhry, "3-Hop: A High-Compression Indexing Scheme for Reachability Query," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 813-826, 2009.
[10] R. Agrawal, A. Borgida, and H.V. Jagadish, "Efficient Management of Transitive Relationships in Large Data and Knowledge Bases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 253-262, 1989.
[11] H. Wang, H. He, J. Yang, P.S. Yu, and J.X. Yu, "Dual Labeling: Answering Graph Reachability Queries in Constant Time," Proc. Int'l Conf. Data Eng. (ICDE), p. 75, 2006.
[12] S. Trißl and U. Leser, "Fast and Practical Indexing and Querying of Very Large Graphs," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 845-856, 2007.
[13] R. Jin, Y. Xiang, N. Ruan, and H. Wang, "Efficiently Answering Reachability Queries on Very Large Directed Graphs," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 595-608, 2008.
[14] R. Agrawal and H.V. Jagadish, "Direct Algorithms for Computing the Transitive Closure of Database Relations," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 255-266, 1987.
[15] H. Lu, "New Strategies for Computing the Transitive Closure of a Database Relation," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 267-274, 1987.
[16] Y.E. Ioannidis and R. Ramakrishnan, "Efficient Transitive Closure Algorithms," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 382-394, 1988.
[17] E. Cohen, E. Halperin, H. Kaplan, and U. Zwick, "Reachability and Distance Queries via 2-Hop Labels," SIAM J. Computing, vol. 32, no. 5, pp. 1338-1355, 2003.
[18] D.S. Johnson, "Approximation Algorithms for Combinatorial Problems," J. Computer and System Sciences, vol. 9, no. 3, pp. 256-278, 1974.
[19] J. Zobel and A. Moffat, "Inverted Files for Text Search Engines," ACM Computation Survey, vol. 38, no. 2,article 6, 2006.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool