
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jun Gao, Jeffrey Xu Yu, Huida Qiu, Xiao Jiang, Tengjiao Wang, Dongqing Yang, "Holistic Topk Simple Shortest Path Join in Graphs," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 4, pp. 665677, April, 2012.  
BibTex  x  
@article{ 10.1109/TKDE.2011.117, author = {Jun Gao and Jeffrey Xu Yu and Huida Qiu and Xiao Jiang and Tengjiao Wang and Dongqing Yang}, title = {Holistic Topk Simple Shortest Path Join in Graphs}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {24}, number = {4}, issn = {10414347}, year = {2012}, pages = {665677}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.117}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Holistic Topk Simple Shortest Path Join in Graphs IS  4 SN  10414347 SP665 EP677 EPD  665677 A1  Jun Gao, A1  Jeffrey Xu Yu, A1  Huida Qiu, A1  Xiao Jiang, A1  Tengjiao Wang, A1  Dongqing Yang, PY  2012 KW  Graph KW  shortest path KW  join KW  TopK. VL  24 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] S. Abiteboul and V. Vianu, "Regular Path Queries with Constraints," Proc. 16th ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems (PODS), pp. 122133, 1997.
[2] R. Akbarinia, E. Pacitti, and P. Valduriez, "Optimal Aggregation Algorithms for Middleware," Proc. 20th ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems (PODS), 2001.
[3] R. Akbarinia, E. Pacitti, and P. Valduriez, "Best Position Algorithms for Topk Queries," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB), pp. 495506, 2007.
[4] S. AlKhalifa, 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. 310321, 2002.
[6] J. Cheng and J. Xu Yu, "OnLine Exact Shortest Distance Query Processing," Proc. 12th Int'l Conf. Extending Database Technology: Advances in Database Technology (EDBT), pp. 481492, 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. 913922, 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. 121134, 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. 247262, 1999.
[10] D. Eppstein, "Finding the k Shortest Paths," SIAM J. Computing, vol. 28, no. 2, pp. 652673, 1998.
[11] E.W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. 1, pp. 269271, 1959.
[12] J. Gao, H. Qiu, X. Jiang, T. Wang, and D. Yang, "Fast Topk Simple Shortest Paths Discovery in Graphs," Proc. 19th ACM Int'l Conf. Information and Knowledge Management (CIKM), pp. 509518, 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. 95106, 2002.
[14] T. Grust, "Accelerating xpath Location Steps," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 109120, 2002.
[15] H. He and A.K. Singh, "GraphsataTime: Query Language and Access Methods for Graph Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 405418, 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:145: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. 252259, 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:15:15, 2007.
[19] R. Jin, H. Hong, H. Wang, N. Ruan, and Y. Xiang, "Computing LabelConstraint Reachability in Graph Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 123134, 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. 595608, 2008.
[21] T. Nicholson, "Finding the Shortest Route between Two Points in a Network," Computer J., vol. 9, pp. 275280, 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. SSC4, no. 2, pp. 100107, 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. 204215, 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. 845856, 2007.
[25] J.Y. YEN, "Finding the k Shortest Loopless Paths in a Network," Management Science, vol. 17, pp. 712716, 1971.
[26] L. Zou, L. Chen, and M. TamerÖzsu, "DistanceJoin: Pattern Match Query in a Large Graph Database," Proc. VLDB Endowment, vol. 2, no. 1, pp. 886897, 2009.