skip to main content
10.1145/2505515.2505724acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths

Published: 27 October 2013 Publication History

Abstract

Answering reachability queries on directed graphs is ubiquitous in many applications involved with graph-shaped data as one of the most fundamental and important operations. However, it is still highly challenging to efficiently process them on large-scale graphs. Transitive-closure-based methods consume prohibitively large index space, and online-search-based methods answer queries too slowly. Labeling-based methods attain both small index size and query time, but previous indexing algorithms are not scalable at all for processing large graphs of the day. In this paper, we propose new labeling-based methods for reachability queries, referred to as pruned landmark labeling and pruned path labeling. They follow the frameworks of 2-hop cover and 3-hop cover, but their indexing algorithms are based on the recent notion of pruned labeling and improve the indexing time by several orders of magnitude, resulting in applicability to large graphs with tens of millions of vertices and edges. Our experimental results show that they attain remarkable trade-offs between fast query time, small index size and scalability, which previous methods have never been able to achieve. Furthermore, we also discuss the ingredients of the efficiency of our methods by a novel theoretical analysis based on the graph minor theory.

References

[1]
T. Akiba, Y. Iwata, and Y. Yoshida. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In SIGMOD, 2013. to appear.
[2]
D. Chamberlin. XQuery: a query language for XML. In SIGMOD, pages 682--682, 2003.
[3]
L. Chen, A. Gupta, and M. Kurul. Stack-based algorithms for pattern matching on dags. In VLDB, pages 493--504, 2005.
[4]
J. Cheng, J. X. Yu, X. Lin, H. Wang, and P. S. Yu. Fast computation of reachability labeling for large graphs. In EDBT, pages 961--979, 2006.
[5]
E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. SIAM Journal on Computing, 32(5):1338--1355, 2003.
[6]
R. Jin and G. Wang. Simple, fast, and scalable reachability oracle. arXiv:1305.0502, May 2013.
[7]
R. Jin, Y. Xiang, N. Ruan, and D. Fuhry. 3-hop: a high-compression indexing scheme for reachability query. In SIGMOD, pages 813--826, 2009.
[8]
R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficiently answering reachability queries on very large directed graphs. In SIGMOD, pages 595--608, 2008.
[9]
M. E. J. Newman, S. H. Strogatz, and D. J. Watts. Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64(2):026118, 2001.
[10]
E. Nuutila. Effcient transitive closure computation in large digraphs. PhD thesis, Finnish Academy of Technology, 1995.
[11]
J. Pérez, M. Arenas, and C. Gutierrez. Semantics and complexity of SPARQL. Transactions on Database Systems, 34(3):16:1--16:45, Sept. 2009.
[12]
T. Reps. Program analysis via graph reachability. In ILPS, pages 5--19, 1997.
[13]
T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataow analysis via graph reachability. In POPL, pages 49--61, 1995.
[14]
N. Robertson and P. D. Seymour. Graph minors. III. planar tree-width. Journal of Combinatorial Theory, Series B, 36(1):49--64, 1984.
[15]
R. Schenkel, A. Theobald, and G. Weikum. HOPI: An efficient connection index for complex XML document collections. In EDBT, pages 237--255, 2004.
[16]
K. Simon. An improved algorithm for transitive closure on acyclic digraphs. Theoretical Computer Science, 58(1):325--346, 1988.
[17]
J. van Helden, A. Naim, R. Mancuso, M. Eldridge, L. Wernisch, D. Gilbert, and S. J. Wodak. Representing and analysing molecular and cellular function using the computer. Biological Chemistry, 381(9-10):921--935, 2000.
[18]
S. van Schaik and O. de Moor. A memory efficient reachability data structure through bit vector compression. In SIGMOD, pages 913--924, 2011.
[19]
H. Yildirim, V. Chaoji, and M. Zaki. GRAIL: a scalable index for reachability queries in very large graphs. The VLDB Journal, 21(4):509--534, 2012.
[20]
Z. Zhang, J. Yu, L. Qin, Q. Zhu, and X. Zhou. I/O cost minimization: reachability queries processing over massive graphs. In EDBT, pages 468--479, 2012.

Cited By

View all
  • (2024)I/O Efficient Label-Constrained Reachability Queries in Large GraphsProceedings of the VLDB Endowment10.14778/3675034.367504917:10(2590-2602)Online publication date: 6-Aug-2024
  • (2024)Minimum Strongly Connected Subgraph Collection in Dynamic GraphsProceedings of the VLDB Endowment10.14778/3648160.364817317:6(1324-1336)Online publication date: 3-May-2024
  • (2024)BL: An Efficient Index for Reachability Queries on Large GraphsIEEE Transactions on Big Data10.1109/TBDATA.2023.332721510:2(108-121)Online publication date: Apr-2024
  • Show More Cited By

Index Terms

  1. Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CIKM '13: Proceedings of the 22nd ACM international conference on Information & Knowledge Management
    October 2013
    2612 pages
    ISBN:9781450322638
    DOI:10.1145/2505515
    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 the author(s) 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: 27 October 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. graphs
    2. query processing
    3. reachability

    Qualifiers

    • Research-article

    Conference

    CIKM'13
    Sponsor:
    CIKM'13: 22nd ACM International Conference on Information and Knowledge Management
    October 27 - November 1, 2013
    California, San Francisco, USA

    Acceptance Rates

    CIKM '13 Paper Acceptance Rate 143 of 848 submissions, 17%;
    Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

    Upcoming Conference

    CIKM '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)45
    • Downloads (Last 6 weeks)3
    Reflects downloads up to 17 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)I/O Efficient Label-Constrained Reachability Queries in Large GraphsProceedings of the VLDB Endowment10.14778/3675034.367504917:10(2590-2602)Online publication date: 6-Aug-2024
    • (2024)Minimum Strongly Connected Subgraph Collection in Dynamic GraphsProceedings of the VLDB Endowment10.14778/3648160.364817317:6(1324-1336)Online publication date: 3-May-2024
    • (2024)BL: An Efficient Index for Reachability Queries on Large GraphsIEEE Transactions on Big Data10.1109/TBDATA.2023.332721510:2(108-121)Online publication date: Apr-2024
    • (2024)Verifiable Strong Privacy-Preserving Any-Hop Reachability Query on Blockchain-Assisted CloudIEEE Internet of Things Journal10.1109/JIOT.2024.344543111:24(39637-39650)Online publication date: 15-Dec-2024
    • (2023)Towards Generating Hop-constrained s-t Simple Path GraphsProceedings of the ACM on Management of Data10.1145/35889151:1(1-26)Online publication date: 30-May-2023
    • (2023)Weight Matters: An Empirical Investigation of Distance Oracles on Knowledge GraphsProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3615246(4440-4444)Online publication date: 21-Oct-2023
    • (2023)An Overview of Reachability Indexes on GraphsCompanion of the 2023 International Conference on Management of Data10.1145/3555041.3589408(61-68)Online publication date: 4-Jun-2023
    • (2023)IFCA: Index-Free Community-Aware Reachability Processing Over Large Dynamic Graphs2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00172(2220-2234)Online publication date: Apr-2023
    • (2023)A Reachability Index for Recursive Label-Concatenated Graph Queries2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00013(67-81)Online publication date: Apr-2023
    • (2023)Top-k Distance Queries on Large Time-Evolving GraphsIEEE Access10.1109/ACCESS.2023.331660211(102228-102242)Online publication date: 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