DBScholar

Back to papers

Efficiently Answering Regular Simple Path Queries on Large Labeled Networks

Summary: Introduces ARRIVAL, a random-walk sampling method for RSP queries on large labeled graphs. Delivers theoretical guarantees of quality; ~100x faster than baselines on billion-scale graphs with ~95% accuracy for SPARQL/Cypher-like queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5756
Venue
SIGMOD
Year
2019
Pagerank
7.3864987e-05
Overall Rank
3,473 | 76.18%
DOI
10.1145/3299869.3319882

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{wadhwa_sigmod19,
        title = {{Efficiently Answering Regular Simple Path Queries on Large Labeled Networks}},
        author = {Wadhwa, Sarisht and Prasad, Anagh and Ranu, Sayan and Bagchi, Amitabha and Bedathur, Srikanta},
        series = {{SIGMOD} '19},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3299869.3319882},
        url = {https://dl.acm.org/doi/10.1145/3299869.3319882},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers