Results 1 - 10 of 1,931

Chasing Relational Database Constraints Backwards

by Stéphane Coulondre , 2000
"... Data dependencies are well known in the context of relational database. They aim to specify constraints that the data must satisfy to model correctly the part of the world under consideration. The implication problem for dependencies is to decide whether a given dependency is logically implied b ..."
Abstract - Add to MetaCart
Data dependencies are well known in the context of relational database. They aim to specify constraints that the data must satisfy to model correctly the part of the world under consideration. The implication problem for dependencies is to decide whether a given dependency is logically implied

The design of Postgres

by Michael Stonebraker, Lawrence A. Rowe - In Proceedings of the SIGMOD Conference , 1986
"... This paper presents the preliminary design of a new database management system, called POSTGRES, that is the successor to the INGRES relational database system. The main design goals of the new system are to: 1) provide better support for complex objects, 2) provide user extendibility for data types ..."
Abstract - Cited by 431 (23 self) - Add to MetaCart
This paper presents the preliminary design of a new database management system, called POSTGRES, that is the successor to the INGRES relational database system. The main design goals of the new system are to: 1) provide better support for complex objects, 2) provide user extendibility for data

Data Exchange: Semantics and Query Answering

by Ronald Fagin, Phokion G. Kolaitis, Renee J. Miller, Lucian Popa - In ICDT , 2003
"... Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. In this paper, we address foundational and algorithmic issues related to the semantics of data exchange and to query answe ..."
Abstract - Cited by 427 (41 self) - Add to MetaCart
Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. In this paper, we address foundational and algorithmic issues related to the semantics of data exchange and to query

On the Decidability of Query Containment under Constraints

by Diego Calvanese, Giuseppe De Giacomo, et al.
"... Query containment under constraints is the problem of checking whether for every database satisfying a given set of constraints, the result of one query is a subset of the result of another query. Recent research points out that this is a central problem in several database applications, and we addr ..."
Abstract - Cited by 256 (56 self) - Add to MetaCart
Query containment under constraints is the problem of checking whether for every database satisfying a given set of constraints, the result of one query is a subset of the result of another query. Recent research points out that this is a central problem in several database applications, and we

Update semantics of relational views

by F. Bancilhon, N. Spyratos - ACM Transactions on Database Systems , 1981
"... A database view is a portion of the data structured in a way suitable to a specific application. Updates on views must be translated into updates on the underlying database. This paper studies the translation process in the relational model. The procedure is as follows: first, a “complete ” set of u ..."
Abstract - Cited by 247 (4 self) - Add to MetaCart
A database view is a portion of the data structured in a way suitable to a specific application. Updates on views must be translated into updates on the underlying database. This paper studies the translation process in the relational model. The procedure is as follows: first, a “complete ” set

Semistructured data

by Peter Buneman , 1997
"... In semistructured data, the information that is normally as-sociated with a schema is contained within the data, which is sometimes called “self-describing”. In some forms of semi-structured data there is no separate schema, in others it exists but only places loose constraints on the data. Semi-str ..."
Abstract - Cited by 281 (0 self) - Add to MetaCart
In semistructured data, the information that is normally as-sociated with a schema is contained within the data, which is sometimes called “self-describing”. In some forms of semi-structured data there is no separate schema, in others it exists but only places loose constraints on the data. Semi

Real-Time Databases

by Krithi Ramamritham - International Journal of Distributed and Parallel Databases , 1993
"... Data in real-time databases has to be logically consistent as well as temporally consistent. The latter arises from the need to preserve the temporal validity of data items that reflect the state of the environment that is being controlled by the system. Some of the timing constraints on the transac ..."
Abstract - Cited by 216 (16 self) - Add to MetaCart
Data in real-time databases has to be logically consistent as well as temporally consistent. The latter arises from the need to preserve the temporal validity of data items that reflect the state of the environment that is being controlled by the system. Some of the timing constraints

Constraint-based rule mining in large, dense databases

by Roberto J. Bayardo, Jr. , Rakesh Agrawal , Dimitrios Gunopulos , 1999
"... Constraint-based rule miners find all rules in a given dataset meeting user-specified constraints such as minimum support and confidence. We describe a new algorithm that directly exploits all user-specified constraints including minimum support, minimum confidence, and a new constraint that ensures ..."
Abstract - Cited by 177 (3 self) - Add to MetaCart
that ensures every mined rule offers a predictive advantage over any of its simplifications. Our algorithm maintains efficiency even at low supports on data that is dense (e.g. relational data). Previous approaches such as Apriori and its variants exploit only the minimum support constraint, and as a result

Object/relational query optimization with chase

by Lucian Popa
"... and backchase ..."
Abstract - Add to MetaCart
and backchase

Taming the infinite chase: Query answering under expressive relational constraints

by Andrea Calì, Georg Gottlob, Michael Kifer - In Proc. of KR 2008 , 2008
"... The chase algorithm is a fundamental tool for query evaluation and for testing query containment under tuple-generating dependencies (TGDs) and equality-generating dependencies (EGDs). So far, most of the research on this topic has focused on cases where the chase procedure terminates. This paper in ..."
Abstract - Cited by 104 (16 self) - Add to MetaCart
The chase algorithm is a fundamental tool for query evaluation and for testing query containment under tuple-generating dependencies (TGDs) and equality-generating dependencies (EGDs). So far, most of the research on this topic has focused on cases where the chase procedure terminates. This paper
Results 1 - 10 of 1,931