DBScholar

Back to papers

Graphs-at-a-time: Query Language and Access Methods for Graph Databases

Summary: Graphs-at-a-time: graph query language with graphs as first-class units and arbitrary attributes on nodes, edges, and graphs. Extends relational algebra with graph pattern matching and a rewrite operator; uses subgraphs and optimized search to cope with NP-complete subgraph isomorphism, graph methods beat SQL. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4066
Venue
SIGMOD
Year
2008
Pagerank
0.00022253507
Overall Rank
294 | 97.99%
DOI
10.1145/1376616.1376660

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{he_sigmod08,
        title = {{Graphs-at-a-time: Query Language and Access Methods for Graph Databases}},
        author = {He, Huahai and Singh, Ambuj K.},
        series = {{SIGMOD} '08},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1376616.1376660},
        url = {https://dl.acm.org/doi/10.1145/1376616.1376660},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 18 of 68 citing papers.

Rank Citing Paper Year Venue Pagerank
8,884 GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases 2010 SIGMOD 5.3514928e-05
9,617 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.2434488e-05
9,693 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.2351259e-05
9,872 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.2043672e-05
10,050 Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query 2020 SIGMOD 5.1685424e-05
10,204 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 5.093636e-05
10,294 Sublime: Selecting Subgraph Matching Algorithms via Machine Learning 2026 SIGMOD 5.093636e-05
10,312 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.093636e-05
10,354 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 5.093636e-05
10,419 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,524 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 5.093636e-05
10,552 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 5.093636e-05
10,558 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 5.093636e-05
10,564 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 5.093636e-05
10,606 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 5.093636e-05
10,885 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 5.093636e-05
10,952 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.093636e-05
11,075 Mix & Match: Subgraph Matching for Absolute Coverage 2025 VLDB 5.093636e-05
Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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