Foundations of RDF Databases

DOI10.1007/978-3-642-03754-2_4MaRDI QIDQ3638999zbMATH OpenOpenAlexFDO

Authors

Publication date 28 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03754-2_4

Mathematics Subject Classification ID

Database theory (68P15) Internet topics (68M11)

Recommendations

• Foundations of semantic web databases
• TriAL: a navigational algebra for RDF triplestores
• Querying incomplete information in RDF with SPARQL
• Beyond well-designed SPARQL
• Federation and navigation in SPARQL 1.1

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1294230 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 1556014 (Why is no real title available?)
• scientific article; zbMATH DE number 2088341 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Database relations with null values
• Finding Regular Simple Paths in Graph Databases
• Foundations of semantic web databases
• Incomplete Information in Relational Databases
• Introduction to algorithms.
• Reachability logic: an efficient fragment of transitive closure logic
• Rewriting of regular expressions and regular path queries

Cited in

(40)

• pSPARQL: a querying language for probabilistic RDF data
• Querying the semantic Web with RQL.
• scientific article; zbMATH DE number 1755542 (Why is no real title available?)
• scientific article; zbMATH DE number 7159544 (Why is no real title available?)
• Answer Set Programming: A Primer
• Database Technologies for RDF
• scientific article; zbMATH DE number 2088341 (Why is no real title available?)
• Foundations of semantic web databases
• Query Relaxation in RDF
• The challenge of optional matching in SPARQL
• HPRD: a high performance RDF database
• Navigational and rule-based languages for graph databases
• A distributional structured semantic space for querying RDF graph data
• Cooperative Query Answering for RDF
• An efficient SQL-based querying method to RDF schemata
• Complexity and expressive power of weakly well-designed SPARQL
• SPARQL query containment under RDFS entailment regime
• Column-oriented distributed storage for RDF database
• Beyond well-designed SPARQL
• CONSTRUCT queries in SPARQL
• Logical Foundations of RDF(S) with Datatypes
• RDF keyword search using multiple indexes
• Annotated RDF
• Semantic extension of query for RDF data
• Fuzzy data modeling and algebraic operations in RDF
• Conceptual navigation in RDF graphs with SPARQL-like queries
• Evaluation of RDF queries via equivalence
• scientific article; zbMATH DE number 605773 (Why is no real title available?)
• Efficient SPARQL Evaluation on Stratified RDF Data with Meta-data
• TriAL: a navigational algebra for RDF triplestores
• Extended RDF: computability and complexity issues
• C-SPARQL: a continuous query language for RDF data streams
• Constraints in RDF
• Federation and navigation in SPARQL 1.1
• Foundations of Rule-Based Query Answering
• R2D: a framework for the relational transformation of RDF data
• What about Constraints in RDF?
• scientific article; zbMATH DE number 2088358 (Why is no real title available?)
• scientific article; zbMATH DE number 2088365 (Why is no real title available?)
• scientific article; zbMATH DE number 2088370 (Why is no real title available?)

Describes a project that uses

Uses Software

• SPARQ2L
• XPath
• nSPARQL
• SPARQL
• foaf

This page was built for publication: Foundations of RDF Databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638999)