DBScholar

Back to papers

EmptyHeaded: A Relational Engine for Graph Processing

Summary: EmptyHeaded is a high-level, datalog-like relational graph engine with a novel SIMD-enabled join architecture and data layouts. New optimizer and layouts deliver up to 1,000× speedups vs other high-level systems on graph patterns, PageRank, SSSP, and match Galois on PageRank. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5302
Venue
SIGMOD
Year
2016
Pagerank
0.00024797217
Overall Rank
211 | 98.56%
DOI
10.1145/2882903.2915213

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{aberger_sigmod16,
        title = {{EmptyHeaded: A Relational Engine for Graph Processing}},
        author = {Aberger, Christopher R. and Tu, Susan and Ré, Christopher and Olukotun, Kunle},
        series = {{SIGMOD} '16},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2882903.2915213},
        url = {https://dl.acm.org/doi/10.1145/2882903.2915213},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 42 of 92 citing papers.

Rank Citing Paper Year Venue Pagerank
7,150 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.687428e-05
7,386 Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores 2025 VLDB 5.6273882e-05
7,733 Mind the Gap: Bridging Multi-Domain Query Workloads with EmptyHeaded 2017 VLDB 5.5564458e-05
7,878 Dependency-Driven Analytics: a Compass for Uncharted Data Oceans 2017 CIDR 5.5246167e-05
7,978 ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Join Algorithms via Reinforcement Learning 2023 VLDB 5.514996e-05
8,154 Revisiting the Design of In-Memory Dynamic Graph Storage 2025 SIGMOD 5.4769071e-05
8,251 Fast Local Subgraph Counting 2024 VLDB 5.4574671e-05
8,318 Optimizing Declarative Graph Queries at Large Scale 2019 SIGMOD 5.4548766e-05
8,374 SPRINTER: A Fast n-ary Join Query Processing Method for Complex OLAP Queries 2020 SIGMOD 5.4399097e-05
8,675 Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth 2022 PODS 5.3868551e-05
8,858 Optimizing Parallel Recursive Datalog Evaluation on Multicore Machines 2022 SIGMOD 5.3567857e-05
9,176 HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs 2024 SIGMOD 5.3081996e-05
9,440 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.2680376e-05
9,624 RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries 2025 VLDB 5.2434488e-05
9,693 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.2351259e-05
9,720 Avoiding Materialisation for Guarded Aggregate Queries 2025 VLDB 5.2319816e-05
9,872 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.2043672e-05
9,884 Pensieve: Skewness-Aware Version Switching for Efficient Graph Processing 2020 SIGMOD 5.2028745e-05
9,942 A Modular Graph-Native Query Optimization Framework 2025 SIGMOD 5.1915905e-05
10,135 I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server 2026 CIDR 5.093636e-05
10,182 The Space-Time Complexity of Sum-Product Queries 2026 PODS 5.093636e-05
10,204 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 5.093636e-05
10,237 Factorized and Vectorized Execution: Optimizing Analytical and Semantic Queries over Relations 2026 SIGMOD 5.093636e-05
10,312 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.093636e-05
10,375 GraphMatch: Subgraph Query Processing on Steroids 2026 SIGMOD 5.093636e-05
10,394 Query Optimization for Database-Returning Queries 2026 SIGMOD 5.093636e-05
10,419 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,428 An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,450 Enabling Efficient Direct Update on Rule-Based Compressed Graph 2026 SIGMOD 5.093636e-05
10,526 TurboLynx: Schemaless Graph Engine Strikes Back for General-Purpose Analytics 2026 VLDB 5.093636e-05
10,762 Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized 2025 SIGMOD 5.093636e-05
10,765 HoneyComb: A Parallel Worst-Case Optimal Join on Multicores 2025 SIGMOD 5.093636e-05
10,787 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 5.093636e-05
10,952 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.093636e-05
11,165 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.093636e-05
11,205 Towards a Converged Relational-Graph Optimization Framework 2024 SIGMOD 5.093636e-05
11,338 A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition 2024 VLDB 5.093636e-05
11,421 Lightweight Materialization for Fast Dashboards Over Joins 2023 SIGMOD 5.093636e-05
11,497 Demonstrating ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Joins via Reinforcement Learning 2023 VLDB 5.093636e-05
11,677 Vertex-centric Parallel Computation of SQL Queries 2021 SIGMOD 5.093636e-05
11,819 Towards Multi-way Join Aware Optimizer in SAP HANA 2020 VLDB 5.093636e-05
11,988 Graph Data Mining with Arabesque 2017 SIGMOD 5.093636e-05
Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

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