skip to main content
10.1145/1807167.1807181acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

TEDI: efficient shortest path query answering on graphs

Published: 06 June 2010 Publication History

Abstract

Efficient shortest path query answering in large graphs is enjoying a growing number of applications, such as ranked keyword search in databases, social networks, ontology reasoning and bioinformatics. A shortest path query on a graph finds the shortest path for the given source and target vertices in the graph.
Current techniques for efficient evaluation of such queries are based on the pre-computation of compressed Breadth First Search trees of the graph. However, they suffer from drawbacks of scalability. To address these problems, we propose TEDI, an indexing and query processing scheme for the shortest path query answering. TEDI is based on the tree decomposition methodology. The graph is first decomposed into a tree in which the node (a.k.a. bag) contains more than one vertex from the graph. The shortest paths are stored in such bags and these local paths together with the tree are the components of the index of the graph. Based on this index, a bottom-up operation can be executed to find the shortest path for any given source and target vertices.
Our experimental results show that TEDI offers orders-of-magnitude performance improvement over existing approaches on the index construction time, the index size and the query answering.

References

[1]
R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationships in large data and knowledge bases. In SIGMOD, 1989.
[2]
S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods, 8(2):277--284, 1987.
[3]
A. L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439), October 1999.
[4]
H. L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1--23, 1993.
[5]
H. L. Bodlaender, A. M. C. A. Koster, and F. van den Eijkhof. Pre-processing rules for triangulation of probabilistic networks. Computational Intelligence, 21(3):286--305, 2005.
[6]
L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on dags. In VLDB, 2005.
[7]
E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. SIAM J. Comput., 32(5):1338--1355, 2003.
[8]
A. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In SODA. SIAM, 2005.
[9]
A. V. Goldberg. Point-to-point shortest path algorithms with preprocessing. In SOFSEM (1), 2007.
[10]
G. Gottlob, R. Pichler, and F. Wei. Tractable database design through bounded treewidth. In PODS, pages 124--133, 2006.
[11]
R. Gutman. Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In ALENEX. SIAM, 2004.
[12]
H. He, H. Wang, J. Yang, and P. S. Yu. Blinks: ranked keyword searches on graphs. In SIGMOD. ACM, 2007.
[13]
R. Jin, Y. Xiang, N. Ruan, and D. Fuhry. 3-hop: a high-compression indexing scheme for reachability query. In SIGMOD. ACM, 2009.
[14]
R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficiently answering reachability queries on very large directed graphs. In SIGMOD, 2008.
[15]
K. Kask, R. Dechter, J. Larrosa, and A. Dechter. Unifying tree decompositions for reasoning in graphical models. Artif. Intell., 166(1-2):165--193, 2005.
[16]
D. E. Knuth. Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd Edition). 1997.
[17]
A. Koster, H. L. Bodlaender, and S. P. M. V. Hoesel. Treewidth: Computational experiments. In Electronic Notes in Discrete Mathematics, pages 54--57. Elsevier Science Publishers, 2001.
[18]
P. D. Robertson, Neil, Seymour. Graph minors iii: Planar tree-width. Journal of Combinatorial Theory, Series B 36:49--64, 1984.
[19]
R. Schenkel, A. Theobald, and G. Weikum. Efficient creation and incremental maintenance of the hopi index for complex xml document collections. In ICDE, pages 360--371, 2005.
[20]
T. Tran, H. Wang, S. Rudolph, and P. Cimiano. Top-k exploration of query candidates for efficient keyword search on graph-shaped (rdf) data. In ICDE. IEEE, 2009.
[21]
S. Trissl and U. Leser. Fast and practical indexing and querying of very large graphs. In SIGMOD, 2007.
[22]
H. Wang, H. He, J. Yang, P. S. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. In ICDE, 2006.
[23]
Y. Xiao, W. Wu, J. Pei, W. Wang, and Z. He. Efficiently indexing shortest paths by exploiting symmetry in graphs. In EDBT, 2009.

Cited By

View all
  • (2024) Efficient k NN Search in Public Transportation Networks Proceedings of the VLDB Endowment10.14778/3681954.368200917:11(3402-3414)Online publication date: 30-Aug-2024
  • (2024)DynaHB: A Communication-Avoiding Asynchronous Distributed Framework with Hybrid Batches for Dynamic GNN TrainingProceedings of the VLDB Endowment10.14778/3681954.368200817:11(3388-3401)Online publication date: 30-Aug-2024
  • (2024)(Vision Paper) A Vision for Spatio-Causal Situation Awareness, Forecasting, and PlanningACM Transactions on Spatial Algorithms and Systems10.1145/367255610:2(1-42)Online publication date: 1-Jul-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMOD '10: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
June 2010
1286 pages
ISBN:9781450300322
DOI:10.1145/1807167
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 June 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. graphs
  2. indexing
  3. shortest path
  4. tree decomposition

Qualifiers

  • Research-article

Conference

SIGMOD/PODS '10
Sponsor:
SIGMOD/PODS '10: International Conference on Management of Data
June 6 - 10, 2010
Indiana, Indianapolis, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)39
  • Downloads (Last 6 weeks)12
Reflects downloads up to 13 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024) Efficient k NN Search in Public Transportation Networks Proceedings of the VLDB Endowment10.14778/3681954.368200917:11(3402-3414)Online publication date: 30-Aug-2024
  • (2024)DynaHB: A Communication-Avoiding Asynchronous Distributed Framework with Hybrid Batches for Dynamic GNN TrainingProceedings of the VLDB Endowment10.14778/3681954.368200817:11(3388-3401)Online publication date: 30-Aug-2024
  • (2024)(Vision Paper) A Vision for Spatio-Causal Situation Awareness, Forecasting, and PlanningACM Transactions on Spatial Algorithms and Systems10.1145/367255610:2(1-42)Online publication date: 1-Jul-2024
  • (2024)Scalable Distance Labeling Maintenance and Construction for Dynamic Small-World Networks2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00348(4573-4585)Online publication date: 13-May-2024
  • (2024)Fast Query Answering by Labeling Index on Uncertain Graphs2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00311(4058-4071)Online publication date: 13-May-2024
  • (2024)Querying Numeric-Constrained Shortest Distances on Road Networks2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00194(2463-2475)Online publication date: 13-May-2024
  • (2024)BatchHL: batch dynamic labelling for distance queries on large-scale networksThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00799-933:1(101-129)Online publication date: 1-Jan-2024
  • (2023)Distributed Subgraph Query Processing Using Filtering Scores on SparkElectronics10.3390/electronics1217364512:17(3645)Online publication date: 29-Aug-2023
  • (2023)T-PORP: A Trusted Parallel Route Planning Model on Dynamic Road NetworksIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2022.321631024:1(1238-1250)Online publication date: Jan-2023
  • (2023)Towards Efficient Shortest Path Counting on Billion-Scale Graphs2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00198(2579-2592)Online publication date: Apr-2023
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media