DBScholar

Back to papers

Querying Graph Patterns

Summary: Classifies graph patterns by features (node/label variables, regex edges) and gives tight data/combined complexity for standard graph queries, pinpointing features driving intractability and syntactic restrictions for tractability. Introduces a novel two-mode automata model (node-accepting vs path-accepting) for answering pattern queries, analyzes its algorithmic properties, and shows many hard cases can be cast as CSPs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1547
Venue
PODS
Year
2011
Pagerank
6.4120976e-05
Overall Rank
4,986 | 65.80%
DOI
10.1145/1989284.1989307

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{barcelo_pods11,
        address = {New York, NY, USA},
        series = {{PODS} '11},
        title = {{Querying Graph Patterns}},
        url = {https://dl.acm.org/doi/10.1145/1989284.1989307},
        doi = {10.1145/1989284.1989307},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Barcelo, Pablo and Libkin, Leonid and Reutter, Juan},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
747 Querying Graph Databases 2013 PODS 0.00014400452
2,285 NeMa: Fast Graph Search with Label Similarity 2013 VLDB 8.8052998e-05
4,372 Schemaless and Structureless Graph Querying 2014 VLDB 6.7384384e-05
4,981 A Trichotomy for Regular Simple Path Queries on Graphs 2013 PODS 6.4127882e-05
9,665 ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs 2020 VLDB 5.2406724e-05
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