Sciweavers

179 search results - page 10 / 36
» Fixed-Point Query Languages for Linear Constraint Databases
Sort
View
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 8 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
PODS
1997
ACM
124views Database» more  PODS 1997»
13 years 11 months ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
ICDT
2009
ACM
198views Database» more  ICDT 2009»
14 years 8 months ago
Consistent query answering under primary keys: a characterization of tractable queries
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a max...
Jef Wijsen
CL
2000
Springer
13 years 12 months ago
Querying Inconsistent Databases: Algorithms and Implementation
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
Alexander Celle, Leopoldo E. Bertossi
SIGMOD
1989
ACM
103views Database» more  SIGMOD 1989»
13 years 11 months ago
ODE (Object Database and Environment): The Language and the Data Model
ODE is a database system and environment based on the object paradigm. It offers one integrated data model for both database and general purpose manipulation. The database is defi...
Rakesh Agrawal, Narain H. Gehani