The RDF-3X engine for scalable management of RDF data
Open accessThe DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
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
Yago: a core of semantic knowledge
Suchanek, F. M., Kasneci, G., & Weikum, G. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242667 · Cited by 2,512
Self-citationDBpedia: 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
Access path selection in a relational database management system
Selinger, P. G., Astrahan, M. M., Chamberlin, D. D., Lorie, R. A., & Price, T. G. (1979) · Proceedings of the 1979 ACM SIGMOD international conference on Management of data - SIGMOD '79 · doi:10.1145/582095.582099 · Cited by 2,188
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
The log-structured merge-tree (LSM-tree)
O’Neil, P., Cheng, E., Gawlick, D., & O’Neil, E. (1996) · Acta Informatica · doi:10.1007/s002360050048 · Cited by 1,317
Efficiently mining long patterns from databases
Bayardo, R. J. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276313 · Cited by 1,302
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
Inverted files for text search engines
Zobel, J., & Moffat, A. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132959 · Cited by 1,081
Getoor, L., & Diehl, C. P. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117456 · Cited by 973
Resource Description Framework (RDF)
(2017) · Encyclopedia of Library and Information Science, Fourth Edition · doi:10.1081/e-elis4-120043688 · Cited by 917
YAGO: A Large Ontology from Wikipedia and WordNet
Suchanek, F. M., Kasneci, G., & Weikum, G. (2008) · Journal of Web Semantics · doi:10.1016/j.websem.2008.06.001 · Cited by 904
Self-citationScalable Semantic Web Data Management Using Vertical Partitioning
Abadi, D. J., Marcus, A., Madden, S. R., & Hollenbach, K. (2007) · Cited by 776
Weiß, C., Karras, P., & Bernstein, A. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453965 · Cited by 637
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
Self-citationEfficiently mining long patterns from databases
Bayardo, R. J. (1998) · ACM SIGMOD Record · doi:10.1145/276305.276313 · Cited by 398
Principles of dataspace systems
Halevy, A., Franklin, M., & Maier, D. (2006) · Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1142351.1142352 · Cited by 346
An efficient SQL-based RDF querying scheme
Chong, E. I., Das, S., Eadon, G., & Srinivasan, J. (2005) · Very Large Data Bases · Cited by 286
Optimization of queries with user-defined predicates
Chaudhuri, S., & Shim, K. (1999) · ACM Transactions on Database Systems · doi:10.1145/320248.320249 · Cited by 186
gPrune: A Constraint Pushing Framework for Graph Pattern Mining
Zhu, F., Yan, X., Han, J., & Yu, P. S. (2007) · Springer eBooks · doi:10.1007/978-3-540-71701-0_38 · Cited by 79
An Experimental Comparison of RDF Data Management Approaches in a SPARQL Benchmark Scenario
Schmidt, M. F., Hornung, T., Küchlin, N., Lausen, G., & Pinkel, C. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88564-1_6 · Cited by 77
Cited by
YAGO2: A spatially and temporally enhanced knowledge base from Wikipedia
Hoffart, J., Suchanek, F. M., Berberich, K., & Weikum, G. (2013) · Artificial Intelligence · doi:10.1016/j.artint.2012.06.001 · Cited by 1,232
Self-citationHyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots
Kemper, A., & Neumann, T. (2011) · 2011 IEEE 27th International Conference on Data Engineering · doi:10.1109/icde.2011.5767867 · Cited by 589
Self-citationScalable 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
A Native and Adaptive Approach for Unified Processing of Linked Streams and Linked Data
Le-Phuoc, D., Dao-Tran, M., Xavier Parreira, J., & Hauswirth, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25073-6_24 · Cited by 373
Binary RDF representation for publication and exchange (HDT)
Fernández, J. D., Martínez-Prieto, M. A., Gutiérrez, C., Polleres, A., & Arias, M. (2013) · Journal of Web Semantics · doi:10.1016/j.websem.2013.01.002 · Cited by 316
Metadata
- Authors
- Neumann, T., & Weikum, G.
- Venue
- The VLDB Journal
- Published
- 2009-09-01
- Volume
- 19
- Issue
- 1
- Pages
- 91-113
- ISSN
- 0949-877X (ISSN-L)
- 1066-8888
- OpenAlex
- W2000656232
- Cited by
- 635
- References
- 20
- FWCI
- 33.97
- Type
- journal article
- Language
- en
- Open access
- green
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.