Results 291 to 300 of about 1,622,308 (337)
Some of the next articles are maybe not open access.
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 +2 more sources
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 +2 more sources
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 +2 more sources
Constructions in Database Theory [PDF]
, 1994 The subject of this chapter is various connections of databases. In terms of these also decomposition of a database into simpler components can be discussed. One may think of the decomposition of both the whole set of rellation symbols Φ, or of every ϕ∈Φ. One also may deal with decompositions which change Φ, or the algebra D, or both.
openaire +1 more source
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 +1 more source
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 +1 more source
2017
This book presents an introduction to morphogenetic computing [27–35]. The idea of morphogenetic computing came from conflicts and uncertainty situations that grow up when we compare two incompatible universes as local universe and global universe, neural universe and Boolean function universe, database sink and source incompatibility fuzzy logic in ...
Guanglin Xu, Germano Resconi, Xiaolin Xu
openaire +2 more sources
This book presents an introduction to morphogenetic computing [27–35]. The idea of morphogenetic computing came from conflicts and uncertainty situations that grow up when we compare two incompatible universes as local universe and global universe, neural universe and Boolean function universe, database sink and source incompatibility fuzzy logic in ...
Guanglin Xu, Germano Resconi, Xiaolin Xu
openaire +2 more sources
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 +2 more sources
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 +2 more sources
2009
This chapter gives an introduction to the theoretical foundations of query languages for relational databases. It thus addresses a significant part of database theory. Special emphasis is put on the expressive power of query languages and the computational complexity of their associated evaluation and static analysis problems.
Thomas Schwentick +2 more
openaire +2 more sources
This chapter gives an introduction to the theoretical foundations of query languages for relational databases. It thus addresses a significant part of database theory. Special emphasis is put on the expressive power of query languages and the computational complexity of their associated evaluation and static analysis problems.
Thomas Schwentick +2 more
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 +2 more sources
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 +3 more sources
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 +2 more sources
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 +2 more sources