AbstractIn 1978 Bancilhon and Paredaens introduced a notion of completeness for relational database languages on instance-level. Their criterion was subsequently calledBP-completeness. Since then, it was used frequently in the context of other database models. However, its application in the context of languages involving object creation appears to raise some serious problems. In this paper, we use the graph-oriented object database model GOOD as a framework to propose an alternative formulation of the BP-completeness criterion, adapted to the context of languages involving object creation
Although there has been a vast amount of research in the area of relational database design, to our ...
Queries on Databases with User-Defined Functions The notion of a database query is generalized for d...
Abstract. Annotated relational databases can be queried either by simply making the annotations expl...
AbstractIn 1978 Bancilhon and Paredaens introduced a notion of completeness for relational database ...
In 1978 Bancilhon and Paredaens introduced a notion of completeness for relational database language...
Abstract: Completeness is a well known data quality dimension in the area of databases. Intuitively,...
AbstractThe concept of “reasonable” queries on relational data bases is investigated. We provide an ...
In object-oriented database systems, messages can be used to manipulate the database; however, a que...
Data completeness is commonly regarded as one of the key aspects of data quality. With this paper we...
A query language should be a part of any database system. While the relational model has a well defi...
The concept of “reasonable ” queries on relational data bases is investigated. We provide an abstrac...
AbstractRelational database transformations, encompassing database queries and updates, are studied....
AbstractIn databases, queries are usually defined on complete databases. In this paper we introduce ...
The notion of a database query is generalized for databases with user-defined functions. Then, we ca...
AbstractWe consider infinite recursive (i.e., computable) relational data bases. Since the set of co...
Although there has been a vast amount of research in the area of relational database design, to our ...
Queries on Databases with User-Defined Functions The notion of a database query is generalized for d...
Abstract. Annotated relational databases can be queried either by simply making the annotations expl...
AbstractIn 1978 Bancilhon and Paredaens introduced a notion of completeness for relational database ...
In 1978 Bancilhon and Paredaens introduced a notion of completeness for relational database language...
Abstract: Completeness is a well known data quality dimension in the area of databases. Intuitively,...
AbstractThe concept of “reasonable” queries on relational data bases is investigated. We provide an ...
In object-oriented database systems, messages can be used to manipulate the database; however, a que...
Data completeness is commonly regarded as one of the key aspects of data quality. With this paper we...
A query language should be a part of any database system. While the relational model has a well defi...
The concept of “reasonable ” queries on relational data bases is investigated. We provide an abstrac...
AbstractRelational database transformations, encompassing database queries and updates, are studied....
AbstractIn databases, queries are usually defined on complete databases. In this paper we introduce ...
The notion of a database query is generalized for databases with user-defined functions. Then, we ca...
AbstractWe consider infinite recursive (i.e., computable) relational data bases. Since the set of co...
Although there has been a vast amount of research in the area of relational database design, to our ...
Queries on Databases with User-Defined Functions The notion of a database query is generalized for d...
Abstract. Annotated relational databases can be queried either by simply making the annotations expl...