Foundations of semantic web databases
The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Abstract
The Semantic Web is based on the idea of adding more machine-readable semantics to web information via annotations written in a language called the Resource Description Framework (RDF). RDF resembles a subset of binary first-order logic including the ability to refer to anonymous objects. Its extended version, RDFS, supports reification, typing and inheritance. These features introduce new challenges into the formal study of sets of RDF/RDFS statements and languages for querying them. Although several such query languages have been proposed, there has been little work on foundational aspects. We investigate these, including computational aspects of testing entailment and redundancy. We propose a query language with well-defined semantics and study the complexity of query processing, query containment, and simplification of answers.
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
Abiteboul, S., Hull, R. B., & Vianu, V. (1994) · Cited by 3,461
Baader, F., & Nipkow, T. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172752 · Cited by 2,466
OWL Web Ontology Language Reference
Dean, M., Guus Schreiber, A., Bechhofer, S., van Harmelen, F., Hendler, J., Horrocks, I. R., MacGuinness, D., Patel‐Schneider, P. F., & Stein, L. A. (2004) · Data Archiving and Networked Services (DANS) · Cited by 2,394
Rdf vocabulary description language 1.0 : Rdf schema
Brickley, D. (2004) · Medical Entomology and Zoology · Cited by 1,428
The complexity of relational query languages (Extended Abstract)
Vardi, M. Y. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802186 · Cited by 1,184
Algorithms for acyclic database schemes
Yannakakis, M. (1981) · Very Large Data Bases · Cited by 786
The Transitive Reduction of a Directed Graph
Aho, A. V., Garey, M. R., & Ullman, J. D. (1972) · SIAM Journal on Computing · doi:10.1137/0201008 · Cited by 718
RQL: a declarative query language for RDF
Karvounarakis, G., Alexaki, S., Christophides, V., Plexousakis, D., & Scholl, M. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511524 · Cited by 438
Data exchange: getting to the core
Fagin, R., Kolaitis, P. G., & Popa, L. (2005) · ACM Transactions on Database Systems · doi:10.1145/1061318.1061323 · Cited by 377
Conjunctive query containment revisited
Chekuri, C., & Rajaraman, A. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00220-0 · Cited by 316
Cited by
Semantics and complexity of SPARQL
Pérez, J., Arenas, M., & Gutierrez, C. (2009) · ACM Transactions on Database Systems · doi:10.1145/1567274.1567278 · Cited by 1,134
Self-citationSemantics and Complexity of SPARQL
Pérez, J., Arenas, M., & Gutierrez, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11926078_3 · Cited by 379
Self-citationBinary 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
Gutierrez, C., Hurtado, C., & Vaisman, A. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.34 · Cited by 279
Self-citationC-SPARQL: A CONTINUOUS QUERY LANGUAGE FOR RDF DATA STREAMS
BARBIERI, D. F., BRAGA, D., CERI, S., VALLE, E. D., & GROSSNIKLAUS, M. (2010) · International Journal of Semantic Computing · doi:10.1142/s1793351x10000936 · Cited by 273
Metadata
- Authors
- Gutierrez, C., Hurtado, C., & Mendelzon, A. O.
- Venue
- Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
- Publisher
- ACM
- Published
- 2004-06-14
- Pages
- 95-106
- OpenAlex
- W2113214500
- Cited by
- 281
- References
- 16
- FWCI
- 9.76
- Type
- conference paper
- 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.