Finding regular simple paths in graph databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Information Systems - Special issue on semistructured data
Queries and computation on the Web
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimization Properties for Classes of Conjunctive Regular Path Queries
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
A Web odyssey: from codd to XML
ACM SIGMOD Record
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
From SPARQL to rules (and back)
Proceedings of the 16th international conference on World Wide Web
Survey of graph database models
ACM Computing Surveys (CSUR)
Minimal Deductive Systems for RDF
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
The Expressive Power of SPARQL
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
How to consume linked data on the web: tutorial description
Proceedings of the 19th international conference on World wide web
Foundations of SPARQL query optimization
Proceedings of the 13th International Conference on Database Theory
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
nSPARQL: A navigational language for RDF
Web Semantics: Science, Services and Agents on the World Wide Web
SPARQL1.1: new features and friends (OWL2, RIF)
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
SPARQL beyond subgraph matching
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Foundations of Semantic Web databases
Journal of Computer and System Sciences
Principles of Distributed Database Systems
Principles of Distributed Database Systems
Linked Data
SPARQL query answering over OWL ontologies
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Semantics and optimization of the SPARQL 1.1 federation extension
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
Semantics and complexity of SPARQL
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Static analysis and optimization of semantic web queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
The complexity of evaluating path expressions in SPARQL
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Foundational aspects of semantic web optimization
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Towards effective partition management for large graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Proceedings of the 2nd International Conference on Web Intelligence, Mining and Semantics
SPARQL for a web of linked data: semantics and computability
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
SPAM: a SPARQL analysis and manipulation tool
Proceedings of the VLDB Endowment
Algebraic structures for capturing the provenance of SPARQL queries
Proceedings of the 16th International Conference on Database Theory
Proceedings of the 32nd symposium on Principles of database systems
Trial for RDF: adapting graph query languages for RDF data
Proceedings of the 32nd symposium on Principles of database systems
The complexity of regular expressions and property paths in SPARQL
ACM Transactions on Database Systems (TODS) - Invited papers issue
Static analysis and optimization of semantic web queries
ACM Transactions on Database Systems (TODS) - Invited papers issue
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Hi-index | 0.00 |
The Semantic Web is the initiative of the W3C to make information on the Web readable not only by humans but also by machines. RDF is the data model for Semantic Web data, and SPARQL is the standard query language for this data model. In the last ten years, we have witnessed a constant growth in the amount of RDF data available on the Web, which have motivated the theoretical study of some fundamental aspects of SPARQL and the development of efficient mechanisms for implementing this query language. Some of the distinctive features of RDF have made the study and implementation of SPARQL challenging. First, as opposed to usual database applications, the semantics of RDF is open world, making RDF databases inherently incomplete. Thus, one usually obtains partial answers when querying RDF with SPARQL, and the possibility of adding optional information if present is a crucial feature of SPARQL. Second, RDF databases have a graph structure and are interlinked, thus making graph navigational capabilities a necessary component of SPARQL. Last, but not least, SPARQL has to work at Web scale! RDF and SPARQL have attracted interest from the database community. However, we think that this community has much more to say about these technologies, and, in particular, about the fundamental database problems that need to be solved in order to provide solid foundations for the development of these technologies. In this paper, we survey some of the main results about the theory of RDF and SPARQL putting emphasis on some research opportunities for the database community.