The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2012 vol.24)
pp: 665-677
Jeffrey Xu Yu , Chinese University of Hong Kong, Hong Kong
Huida Qiu , Peking University, Beijing
Xiao Jiang , Peking University, Beijing
Jun Gao , Peking University, Beijing
Dongqing Yang , Peking University, Beijing
ABSTRACT
Motivated by the needs such as group relationship analysis, this paper introduces a new operation on graphs, named top-k path join, which discovers the top-k simple shortest paths between two given node sets. Rather than discovering the top-k simple paths between each node pair, this paper proposes a holistic join method which answers the top-k path join by finding constrained top-k simple shortest paths between two nodes, and then devises an efficient method to handle the latter problem. Specifically, we transform the graph by encoding the precomputed shortest paths to the target node, and use the transformed graph in the candidate path searching. We show that the candidate path searching on the transformed graph not only has the same result as that on the original graph but also can be terminated much earlier with the aid of precomputed results. We also discuss two other optimization strategies, including considering the join constraint in the candidate path generation as early as possible, and pruning search space in each candidate path generation with an adaptively determined threshold. The final extensive experimental results also show that our method offers a significant performance improvement over existing ones.
INDEX TERMS
Graph, shortest path, join, Top-K.
CITATION
Jeffrey Xu Yu, Huida Qiu, Xiao Jiang, Jun Gao, Dongqing Yang, "Holistic Top-k Simple Shortest Path Join in Graphs", IEEE Transactions on Knowledge & Data Engineering, vol.24, no. 4, pp. 665-677, April 2012, doi:10.1109/TKDE.2011.117
REFERENCES
[1] S. Abiteboul and V. Vianu, "Regular Path Queries with Constraints," Proc. 16th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS), pp. 122-133, 1997.
[2] R. Akbarinia, E. Pacitti, and P. Valduriez, "Optimal Aggregation Algorithms for Middleware," Proc. 20th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS), 2001.
[3] R. Akbarinia, E. Pacitti, and P. Valduriez, "Best Position Algorithms for Top-k Queries," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB), pp. 495-506, 2007.
[4] S. Al-Khalifa, H.V. Jagadish, J.M. Patel, Y. Wu, N. Koudas, and D. Srivastava, "Structural Joins: A Primitive for Efficient xml Query Pattern Matching," Proc. 18th Int'l Conf. Dat Eng. (ICDE), p. 141, 2002.
[5] N. Bruno, N. Koudas, and D. Srivastava, "Holistic Twig Joins: Optimal xml Pattern Matching," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 310-321, 2002.
[6] J. Cheng and J. Xu Yu, "On-Line Exact Shortest Distance Query Processing," Proc. 12th Int'l Conf. Extending Database Technology: Advances in Database Technology (EDBT), pp. 481-492, 2009.
[7] J. Cheng, J. Xu Yu, B. Ding, P.S. Yu, and H. Wang, "Fast Graph Pattern Matching," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE), pp. 913-922, 2008.
[8] E. de Queirós, V. Martins, and M.M.B. Pascoal, "A New Implementation of Yen's Ranking Loopless Paths Algorithm," 4OR: A Quarterly J. Operations Research, vol. 1, no. 2, pp. 121-134, 2003.
[9] E. de Queirós Vieira Martins, M.M.B. Pascoal, and J. Luis E. Dos Santos, "Deviation Algorithms for Ranking Shortest Paths," Int'l J. Foundations of Computer Science, vol. 10, no. 3, pp. 247-262, 1999.
[10] D. Eppstein, "Finding the k Shortest Paths," SIAM J. Computing, vol. 28, no. 2, pp. 652-673, 1998.
[11] E.W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
[12] J. Gao, H. Qiu, X. Jiang, T. Wang, and D. Yang, "Fast Top-k Simple Shortest Paths Discovery in Graphs," Proc. 19th ACM Int'l Conf. Information and Knowledge Management (CIKM), pp. 509-518, 2010.
[13] G. Gottlob, C. Koch, and R. Pichler, "Efficient Algorithms for Processing Xpath Queries," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 95-106, 2002.
[14] T. Grust, "Accelerating xpath Location Steps," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 109-120, 2002.
[15] H. He and A.K. Singh, "Graphs-at-a-Time: Query Language and Access Methods for Graph Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 405-418, 2008.
[16] J. Hershberger, M. Maxel, and S. Suri, "Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation," ACM Trans. Algorithms, vol. 3, p. 45:1-45:19, 2007.
[17] J. Hershberger and S. Suri, "Vickrey Prices and Shortest Paths: What Is an Edge Worth," Proc. IEEE 42nd Symp. Foundations of Computer Science (FOCS), pp. 252-259, 2001.
[18] J. Hershberger, S. Suri, and A.M. Bhosle, "On the Difficulty of Some Shortest Path Problems," ACM Trans. Algorithms, vol. 3, no. 1, pp. 5:1-5:15, 2007.
[19] R. Jin, H. Hong, H. Wang, N. Ruan, and Y. Xiang, "Computing Label-Constraint Reachability in Graph Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 123-134, 2010.
[20] 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.
[21] T. Nicholson, "Finding the Shortest Route between Two Points in a Network," Computer J., vol. 9, pp. 275-280, 1966.
[22] P.E. Hart, N.J. Nilsson, and B. Raphael, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths," IEEE Trans. System Science and Cybernetics., vol. SSC-4, no. 2, pp. 100-107, July 1968.
[23] I. Tatarinov, S. Viglas, K.S. Beyer, J. Shanmugasundaram, E.J. Shekita, and C. Zhang, "Storing and Querying Ordered xml Using a Relational Database System," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 204-215, 2002.
[24] S. TriBl 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.
[25] J.Y. YEN, "Finding the k Shortest Loopless Paths in a Network," Management Science, vol. 17, pp. 712-716, 1971.
[26] L. Zou, L. Chen, and M. TamerÖzsu, "Distance-Join: Pattern Match Query in a Large Graph Database," Proc. VLDB Endowment, vol. 2, no. 1, pp. 886-897, 2009.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool