Results 261 to 270 of about 287,498 (311)
Some of the next articles are maybe not open access.
The Knowledge Engineering Review, 1989
Abstract This paper surveys a variety of deductive database theories. Such theories differ from one another in the set of axioms and metarules that they allow and use. The following theories are discussed: relational, Horn, and stratified in the text; protected, disjunctive, typed, extended Horn, and normal in the appendix ...
John Grant, Jack Minker
openaire +1 more source
Abstract This paper surveys a variety of deductive database theories. Such theories differ from one another in the set of axioms and metarules that they allow and use. The following theories are discussed: relational, Horn, and stratified in the text; protected, disjunctive, typed, extended Horn, and normal in the appendix ...
John Grant, Jack Minker
openaire +1 more source
ACM SIGACT News, 2020
The 39th edition of the ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS) was planned to take place from June 14 to June 19, 2020, in Portland, OR, USA. Due to the coronavirus pandemic, it was organized instead as a virtual (online) conference on the same dates.
openaire +1 more source
The 39th edition of the ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS) was planned to take place from June 14 to June 19, 2020, in Portland, OR, USA. Due to the coronavirus pandemic, it was organized instead as a virtual (online) conference on the same dates.
openaire +1 more source
Assumptions in relational database theory
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems, 1982Many results in relational database theory on the structure of dependencies, query languages, and databases in general have now been established. However, neither (a) the reliance of these results on various assumptions, nor (b) the desirability or reasonableness of these assumptions themselves have been closely examined.
ATZENI, Paolo, PARKER DS
openaire +2 more sources
ACM SIGACT News, 2008
The 26th edition of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Databases (PODS), took place from 11 to 13 June 2007. As usual since 1991, the symposium was organized jointly with the ACM SIGMOD International Conference on Management of Data.
openaire +3 more sources
The 26th edition of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Databases (PODS), took place from 11 to 13 June 2007. As usual since 1991, the symposium was organized jointly with the ACM SIGMOD International Conference on Management of Data.
openaire +3 more sources
Perspectives on database theory
ACM SIGACT News, 1996Database management systems address the need to store, retrieve, and manipulate large amounts of data in an organized fashion. The database held has grown tremendously in the last 25 years. It is reported that the database industry generated $7 billion in revenue in 1994 and is growing at a rate of 35% per year.
openaire +1 more source
ACM SIGMOD Record, 2001
Over the years, the connection between database theory and database practice has weakened. We argue here that the new challenges posed by XML and its applications are strengthening this connection today. We illustrate three examples of theoretical problems arising from XML applications, based on our own research.
openaire +1 more source
Over the years, the connection between database theory and database practice has weakened. We argue here that the new challenges posed by XML and its applications are strengthening this connection today. We illustrate three examples of theoretical problems arising from XML applications, based on our own research.
openaire +1 more source
1992
In this paper, we prove that the larger the databases are, the lower the com-plexity of the evaluation of queries is. This work is based upon the asymptotic probabilities of the truth of properties and we focus on almost sure properties. We prove that for several undecidable properties of Datalog programs (which are important for the optimization), we ...
openaire +1 more source
In this paper, we prove that the larger the databases are, the lower the com-plexity of the evaluation of queries is. This work is based upon the asymptotic probabilities of the truth of properties and we focus on almost sure properties. We prove that for several undecidable properties of Datalog programs (which are important for the optimization), we ...
openaire +1 more source
An Algebraic Theory of Relational Databases
Bell System Technical Journal, 1983In this paper we present a theory of relational database systems based on the partition lattice, which represents a new mathematical approach to the structure of relational database systems. A partition lattice can be defined for any given relation.
openaire +2 more sources
A theory of reliability in database systems
Journal of the ACM, 1988Reliable concurrent processing of transactions in a database system is examined. Since serializability, the conventional concurrency control correctness criterion, is not adequate in the presence of common failures, another theory of correctness is proposed, involving the concepts ofcommit serializability, recoverability,andresiliency.
openaire +1 more source
Contribution to a theory of database reverse engineering
[1993] Proceedings Working Conference on Reverse Engineering, 2002The paper proposes both a general framework and specific techniques for file and database reverse engineering, i.e. recovering its conceptual schema. The framework relies on a process/product model that matches formal as well as empirical design procedures.
Hainaut, Jean-Luc +3 more
openaire +2 more sources