Logic and databases: A deductive approach
H Gallaire, J Minker, JM Nicolas - ACM Computing Surveys (CSUR), 1984 - dl.acm.org
The purpose of this paper is to show that logic provides a convenient formalism for studying
classical database problems. There are two main parts to the paper, devoted respectively to …
classical database problems. There are two main parts to the paper, devoted respectively to …
Semantics of time-varying information
CS Jensen, RT Snodgrass - Information Systems, 1996 - Elsevier
This paper provides a systematic and comprehensive study of the underlying semantics of
temporal databases, summarizing the results of an intensive collaboration between the two …
temporal databases, summarizing the results of an intensive collaboration between the two …
[图书][B] Foundations of databases
S Abiteboul, R Hull, V Vianu - 1995 - sigmod.org
This database theory book provides a focused presentation of the core material on relational
databases, and presents a number of advanced topics in a unified framework. Some of the …
databases, and presents a number of advanced topics in a unified framework. Some of the …
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
RE Tarjan, M Yannakakis - SIAM Journal on computing, 1984 - SIAM
Chordal graphs arise naturally in the study of Gaussian elimination on sparse symmetric
matrices; acyclic hypergraphs arise in the study of relational data bases. Rose, Tarjan and …
matrices; acyclic hypergraphs arise in the study of relational data bases. Rose, Tarjan and …
[图书][B] Fundamentos de bases de datos
• Bases de datos relacionales (Capítulos 4 al 7). El Capítulo 4 se centra en el lenguaje
relacional orientado al usuario de mayor influencia: SQL. El Capítulo 5 cubre otros dos …
relacional orientado al usuario de mayor influencia: SQL. El Capítulo 5 cubre otros dos …
Extending the database relational model to capture more meaning
EF Codd - ACM Transactions on Database Systems (TODS), 1979 - dl.acm.org
During the last three or four years several investigators have been exploring “semantic
models” for formatted databases. The intent is to capture (in a more or less formal way) more …
models” for formatted databases. The intent is to capture (in a more or less formal way) more …
Testing implications of data dependencies
D Maier, AO Mendelzon, Y Sagiv - ACM Transactions on Database …, 1979 - dl.acm.org
Presented is a computation method—the chase—for testing implication of data
dependencies by a set of data dependencies. The chase operates on tableaux similar to …
dependencies by a set of data dependencies. The chase operates on tableaux similar to …
Degrees of acyclicity for hypergraphs and relational database schemes
R Fagin - Journal of the ACM (JACM), 1983 - dl.acm.org
Database schemes (winch, intuitively, are collecuons of table skeletons) can be wewed as
hypergraphs (A hypergraph Is a generalization of an ordinary undirected graph, such that an …
hypergraphs (A hypergraph Is a generalization of an ordinary undirected graph, such that an …
Multivalued dependencies and a new normal form for relational databases
R Fagin - ACM Transactions on Database Systems (TODS), 1977 - dl.acm.org
A new type of dependency, which includes the well-known functional dependencies as a
special case, is defined for relational databases. By using this concept, a new (“fourth”) …
special case, is defined for relational databases. By using this concept, a new (“fourth”) …
The theory of joins in relational databases
Answering queries in a relational database often requires that the natural join of two or more
relations be computed. However, the result of a join may not be what one expects. In this …
relations be computed. However, the result of a join may not be what one expects. In this …