Identifying Extended Entity-Relationship Object Structures in Relational Schemas
IEEE Transactions on Software Engineering
Containment and minimization of positive conjunctive queries in OODB's
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
On the Complexity of Testing Implications of Functional and Join Dependencies
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Real-world Data is Dirty: Data Cleansing and The Merge/Purge Problem
Data Mining and Knowledge Discovery
On the decidability and complexity of query answering over inconsistent and incomplete databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data integration under integrity constraints
Information Systems - Special issue: The 14th international conference on advanced information systems engineering (CAiSE*02)
Characterizing data complexity for conjunctive query answering in expressive description logics
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
DL-Lite: tractable description logics for ontologies
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Query rewriting and answering under constraints in data integration systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Tractable Query Answering over Conceptual Schemata
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
Logic in databases: report on the LID 2008 workshop
ACM SIGMOD Record
Querying incomplete data over extended er schemata
Theory and Practice of Logic Programming
Guidelines for representing complex cardinality constraints in binary and ternary relationships
Software and Systems Modeling (SoSyM)
| Hi-index | 0.01 |
Since Chen's Entity-Relationship (ER) model, conceptual modelling has been playing a fundamental role in relational data design. In this paper we consider an extended ER model enriched with cardinality constraints, disjunction assertions, and is-a relations among both entities and relationships; we present a framework in which the data underlying an ER schema can be directly queried through the schema by using suitable predicates. In this setting, we consider the case of incomplete data, which is likely to happen, for instance, when data from different sources are integrated. We address the problem of providing correct answers to conjunctive queries by reasoning on the schema. Based on previous results about decidability of the problem, we provide a query answering algorithm based on rewriting the initial query into a recursive Datalog query, in which the information about the schema is encoded.We finally give some complexity results, and we show extensions to more general settings.