The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Scalable SPARQL querying of large RDF graphs
Abstract
The generation of RDF data has accelerated to the point where many data sets need to be partitioned across multiple machines in order to achieve reasonable performance when querying the data. Although tremendous progress has been made in the Semantic Web community for achieving high performance data management on a single node, current solutions that allow the data to be partitioned across multiple machines are highly inefficient. In this paper, we introduce a scalable RDF data management system that is up to three orders of magnitude more efficient than popular multi-node RDF data management systems. In so doing, we introduce techniques for (1) leveraging state-of-the-art single node RDF-store technology (2) partitioning the data across nodes in a manner that helps accelerate query processing through locality optimizations and (3) decomposing SPARQL queries into high performance fragments that take advantage of how data is partitioned in a cluster.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
LUBM: A benchmark for OWL knowledge base systems
Guo, Y., Pan, Z., & Heflin, J. (2005) · Journal of Web Semantics · doi:10.1016/j.websem.2005.06.005 · Cited by 1,354
Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
Broekstra, J., Kampman, A., & van Harmelen, F. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-48005-6_7 · Cited by 1,338
HadoopDB: an architectural hybrid of MapReduce and DBMS technologies for analytical workloads
Abouzeid, A., Bajda-Pawlikowski, K., Abadi, D., Silberschatz, A., & Rasin, A. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687731 · Cited by 857
Self-citationScalable Semantic Web Data Management Using Vertical Partitioning
Abadi, D. J., Marcus, A., Madden, S. R., et al. (2007) · Cited by 653
Self-citationWeiß, C., Karras, P., & Bernstein, A. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453965 · Cited by 637
The RDF-3X engine for scalable management of RDF data
Neumann, T., & Weikum, G. (2010) · The VLDB Journal · doi:10.1007/s00778-009-0165-y · Cited by 635
CHALLENGES IN PARALLEL GRAPH PROCESSING
LUMSDAINE, A., GREGOR, D., HENDRICKSON, B., & BERRY, J. (2007) · Parallel Processing Letters · doi:10.1142/s0129626407002843 · Cited by 469
Algorithmics and applications of tree and graph searching
Shasha, D., Wang, J. T. L., & Giugno, R. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543620 · Cited by 387
An efficient SQL-based RDF querying scheme
Chong, E. I., Das, S., Eadon, G., & Srinivasan, J. (2005) · Very Large Data Bases · Cited by 286
Cited by
WTF: the who to follow service at Twitter
Gupta, P., Goel, A., Lin, J., Sharma, A., Wang, D., & Zadeh, R. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488433 · Cited by 461
From "think like a vertex" to "think like a graph"
Tian, Y., Balmin, A., Corsten, S. A., Tatikonda, S., & McPherson, J. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2732232.2732238 · Cited by 352
Understandable Big Data: A survey
Kacfah Emani, C., Cullot, N., & Nicolle, C. (2015) · Computer Science Review · doi:10.1016/j.cosrev.2015.05.002 · Cited by 299
The Graph of Things: A step towards the Live Knowledge Graph of connected things
Le-Phuoc, D., Nguyen Mau Quoc, H., Ngo Quoc, H., Tran Nhat, T., & Hauswirth, M. (2016) · Journal of Web Semantics · doi:10.1016/j.websem.2016.02.003 · Cited by 81
LEGO-GraphRAG: Modularizing Graph-Based Retrieval-Augmented Generation for Design Space Exploration
Cao, Y., Gao, Z., Li, Z., Xie, X., Zhou, S. K., & Xu, J. (2025) · Proceedings of the VLDB Endowment · doi:10.14778/3748191.3748194 · Cited by 11
Metadata
- Authors
- Huang, J., Abadi, D. J., & Ren, K.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2011-08
- Volume
- 4
- Issue
- 11
- Pages
- 1123-1134
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2293919922
- Cited by
- 461
- References
- 14
- FWCI
- 41.99
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Scalable SPARQL querying of large RDF graphs. https://app.cochat.ai/papers/10.14778/3402707.3402747
- The paper
- Huang, J., Abadi, D. J., & Ren, K. (2011). Scalable SPARQL querying of large RDF graphs. Proceedings of the VLDB Endowment. https://doi.org/10.14778/3402707.3402747
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.