The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
A distributed graph engine for web scale RDF data
Abstract
Much work has been devoted to supporting RDF data. But state-of-the-art systems and methods still cannot handle web scale RDF data effectively. Furthermore, many useful and general purpose graph-based operations (e.g., random walk, reachability, community discovery) on RDF data are not supported, as most existing systems store and index data in particular ways (e.g., as relational tables or as a bitmap matrix) to maximize one particular operation on RDF data: SPARQL query processing. In this paper, we introduce Trinity. RDF, a distributed, memory-based graph engine for web scale RDF data. Instead of managing the RDF data in triple stores or as bitmap matrices, we store RDF data in its native graph form. It achieves much better (sometimes orders of magnitude better) performance for SPARQL queries than the state-of-the-art approaches. Furthermore, since the data is stored in its native graph form, the system can support other operations (e.g., random walks, reachability) on RDF graphs as well. We conduct comprehensive experimental studies on real life, web scale RDF data to demonstrate the effectiveness of our approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931 · cited 1×
“We conduct comprehensive experimental studies on real life, web scale RDF data to demonstrate the effectiveness of our approach.”
MethodPregel: 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
DBpedia: A Nucleus for a Web of Open Data
Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., & Ives, Z. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-76298-0_52 · Cited by 2,454
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,584
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
Probase: a probabilistic taxonomy for text understanding
Wu, W., Li, H., Wang, H., & Zhu, K. Q. (2012) · Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213891 · Cited by 763
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
RDF-3X: a RISC-style engine for RDF
Neumann, T., & Weikum, G. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453927 · Cited by 562
CHALLENGES IN PARALLEL GRAPH PROCESSING
LUMSDAINE, A., GREGOR, D., HENDRICKSON, B., & BERRY, J. (2007) · Parallel Processing Letters · doi:10.1142/s0129626407002843 · Cited by 469
Using Semi-Joins to Solve Relational Queries
Bernstein, P. A., & Chiu, D.-M. W. (1981) · Journal of the ACM · doi:10.1145/322234.322238 · Cited by 464
Scalable SPARQL querying of large RDF graphs
Huang, J., Abadi, D. J., & Ren, K. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/3402707.3402747 · Cited by 461
Graphs-at-a-time: query language and access methods for graph databases
He, H., & Singh, A. K. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376660 · Cited by 450
Trinity: a distributed graph engine on a memory cloud
Shao, B., Wang, H., & Li, Y. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2467799 · Cited by 432
Self-citationAn efficient SQL-based RDF querying scheme
Chong, E. I., Das, S., Eadon, G., & Srinivasan, J. (2005) · Very Large Data Bases · Cited by 286
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Wang, H., He, H., Yang, J., Yu, P. S., & Yu, J. X. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.53 · Cited by 242
Self-citationDistance-join: pattern match query in a large graph database
Zou, L., Chen, L., & Özsu, M. T. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687727 · Cited by 200
Cheng, J., Yu, J. X., Ding, B., Yu, P. S., & Wang, H. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497500 · Cited by 164
Self-citationRohloff, K. R., & Schantz, R. E. (2010) · doi:10.1145/1940747.1940751 · Cited by 157
Virtuoso: RDF Support in a Native RDBMS
Erling, O., & Mikhailov, I. (2009) · Springer eBooks · doi:10.1007/978-3-642-04329-1_21 · Cited by 154
Querying RDF Data from a Graph Database Perspective
Angles, R., & Gutiérrez, C. (2005) · Lecture notes in computer science · doi:10.1007/11431053_24 · Cited by 147
Bonstrom, V., Hinze, A., & Schweppe, H. (2004) · International Conference on Numerical Simulation of Optoelectronic Devices (NUSOD) · doi:10.1109/laweb.2003.1250279 · Cited by 90
Semantic Web Information Management
Virgilio, R. D., Tanca, L., & Giunchiglia, F. (2009) · Springer eBooks · doi:10.1007/978-3-642-04329-1 · Cited by 86
Mining top-K large structural patterns in a massive network
Zhu, F., Qu, Q., Lo, D., Yan, X., Han, J., & Yu, P. S. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/3402707.3402720 · Cited by 80
Shao, B., Wang, H., & Li, Y. (2012) · Cited by 62
Self-citationManaging and mining large graphs
Shao, B., Wang, H., & Xiao, Y. (2012) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213907 · Cited by 57
Self-citation
Cited by
Trinity: a distributed graph engine on a memory cloud
Shao, B., Wang, H., & Li, Y. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2467799 · Cited by 432
Self-citationIn-Memory Big Data Management and Processing: A Survey
Zhang, H., Chen, G., Ooi, B. C., Tan, K.-L., & Zhang, M. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2427795 · Cited by 414
Khan, A., & Elnikety, S. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2733004.2733067 · Cited by 37
“We discuss one domain-specific language (DSL ) for online graph querying:Horton [14], and two systems that support online graph traversal: G-SPARQL [13] andTrinity [17].”
Method
Metadata
- Authors
- Zeng, K., Yang, J., Wang, H., Shao, B., & Wang, Z.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2013-02
- Volume
- 6
- Issue
- 4
- Pages
- 265-276
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2171539317
- Cited by
- 314
- References
- 26
- FWCI
- 44.17
- 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
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.