QUIST: a system for semantic query optimization in relational databases
Distributed systems, Vol. II: distributed data base systems
A system for semantic query optimization
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Logic-based approach to semantic query optimization
ACM Transactions on Database Systems (TODS)
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
Adding Uniqueness Constraints to Description Logics (Preliminary Report)
DOOD '97 Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases
A Reverse Engineering Approach for Migrating Data-intensive Web Sites to the Semantic Web
Proceedings of the IFIP 17th World Computer Congress - TC12 Stream on Intelligent Information Processing
Bridging the gap between OWL and relational databases
Proceedings of the 16th international conference on World Wide Web
Minimal Deductive Systems for RDF
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
Keys, nominate, and concrete domains
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Identification constraints and functional dependencies in description logics
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
On the interaction between inverse features and path-functional dependencies in description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Relational Databases in RDF: Keys and Foreign Keys
Semantic Web, Ontologies and Databases
Towards Rule-Based Minimization of RDF Graphs under Constraints
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Mapping Relational Databases to the Semantic Web with Original Meaning
KSEM '09 Proceedings of the 3rd International Conference on Knowledge Science, Engineering and Management
Foundations of SPARQL query optimization
Proceedings of the 13th International Conference on Database Theory
Redundancy elimination on RDF graphs in the presence of rules, constraints, and queries
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases
What about constraints in RDF?
Conceptual Modelling and Its Theoretical Foundations
Some remarks on relational database schemes having few minimal keys
Conceptual Modelling and Its Theoretical Foundations
High-level change detection in RDF(S) KBs
ACM Transactions on Database Systems (TODS)
APCCM '12 Proceedings of the Eighth Asia-Pacific Conference on Conceptual Modelling - Volume 130
Test-driven evaluation of linked data quality
Proceedings of the 23rd international conference on World wide web
Bringing relational databases into the Semantic Web: A survey
Semantic Web - On real-time and ubiquitous social semantics
| Hi-index | 0.00 |
The goal of the Semantic Web is to support semantic interoperability between applications exchanging data on the web. The idea heavily relies on data being made available in machine readable format, using semantic markup languages. In this regard, the W3C has standardized RDF as the basic markup language for the Semantic Web. In contrast to relational databases, where data relationships are implicitly given by schema information as well as primary and foreign key constraints, relationships in semantic markup languages are made explicit. When mapping relational data into RDF, it is desirable to maintain the information implied by the origin constraints. As an improvement over existing approaches, our scheme allows for translating conventional databases into RDF without losing general constraints and vital key information. As much as in the relational model, those information are indispensable for data consistency and, as shown by example, can serve as a basis for semantic query optimization. We underline the practicability of our approach by showing that SPARQL, the most popular query language for RDF, can be used as a constraint language, akin to SQL in the relational context. As a theoretical contribution, we also discuss satisfiability for interesting classes of constraints and combinations thereof.