Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs
Summary: Horton+ is a distributed in-memory system for declarative reachability on partitioned attributed multi-graphs, compiling queries into select-traverse-join plans. Evaluated on 16 servers; scalable performance on synthetic and real graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mohamed Sarwat (University of Minnesota)
- 2. Sameh Elnikety (Microsoft)
- 3. Yuxiong He (Microsoft)
- 4. Mohamed F. Mokbel (University of Minnesota)
BibTeX Citation
@article{sarwat_vldb13,
title = {{Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs}},
author = {Sarwat, Mohamed and Elnikety, Sameh and He, Yuxiong and Mokbel, Mohamed F.},
journal = {PVLDB},
series = {{VLDB} '13},
volume = {6},
number = {14},
doi = {10.14778/2556549.2556573},
url = {https://doi.org/10.14778/2556549.2556573},
year = {2013}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,787 | Systems for Big-Graphs | 2014 | VLDB | 6.5079377e-05 |
| 7,281 | A General-Purpose Query-Centric Framework for Querying Big Graphs | 2016 | VLDB | 5.6567845e-05 |
| 7,578 | Minimum Strongly Connected Subgraph Collection in Dynamic Graphs | 2024 | VLDB | 5.5927377e-05 |
| 8,651 | Distributed Set Reachability | 2016 | SIGMOD | 5.3916003e-05 |
| 9,704 | Quegel: A General-Purpose System for Querying Big Graphs | 2016 | SIGMOD | 5.2351259e-05 |
| 9,729 | Scalable Graph Convolutional Network Training on Distributed-Memory Systems | 2023 | VLDB | 5.2289669e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,318 | Optimizing Declarative Graph Queries at Large Scale | 2019 | SIGMOD |
| 2 | 7,798 | A Survey and Experimental Comparison of Distributed SPARQL Engines for Very Large RDF Data | 2017 | VLDB |
| 3 | 1,803 | Towards Effective Partition Management for Large Graphs | 2012 | SIGMOD |
| 4 | 500 | Scalable SPARQL Querying of Large RDF Graphs | 2011 | VLDB |
| 5 | 6,111 | Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning | 2013 | VLDB |
| 6 | 10,361 | DRPQ: Distributed Evaluation of Regular Path Queries On Streaming Graphs | 2026 | SIGMOD |
| 7 | 11,197 | Connectivity-Oriented Property Graph Partitioning for Distributed Graph Pattern Query Processing | 2024 | SIGMOD |
| 8 | 12,130 | Evaluating SPARQL Queries on Massive RDF Datasets | 2015 | VLDB |
| 9 | 5,029 | Performance Guarantees for Distributed Reachability Queries | 2012 | VLDB |
| 10 | 8,651 | Distributed Set Reachability | 2016 | SIGMOD |