Database Theory - Icdt '92: 4th International Conference, Berlin, Germany, October 14-16, 1992. Proceedings

ISBN-13: 9783540560395 / Angielski / Miękka / 1992 / 454 str.

Joachim Biskup; Richard Hull; J. Biskup

Opis

Containing the papers selected for a conference on database theory, this book is organized into sections on constraints and decomposition, query languages, updates and active databases, concurrency control and recovery, knowledge bases, datalog complexity and optimization, among other topics.

Spis treści

Combinatorial and algebraic results for database relations.- Semantics of disjunctive deductive databases.- Database theory in Russia (1979–1991) (an overview).- On the composition and decomposition of attributes and tuples.- Approximate dependency inference from relations.- Views and decompositions of databases from a categorical perspective.- Computing with infinitary logic.- Query languages with counters.- Naturally embedded query languages.- Optimizing incremental computation of datalog programs with non-deterministic semantics.- Optimizing active databases using the split technique (Preliminary Report).- Updating atomic information in labelled database systems (extended abstract).- Context-specific synchronization for atomic data types.- Hybrid atomicity for nested transactions.- Model and verification of a data manager based on ARIES.- Minimizing indefinite information in disjunctive deductive databases.- Well founded semantics and stable semantics of semi-strict programs.- On finding extensions of default theories.- Incremental evaluation of Datalog queries.- Decidability and undecidability of equivalence for linear Datalog, with applications to normal-form optimizations.- A paradox in database theory.- A hierarchy of faithful set creation in pure OODB's.- Identification, genericity and consistency in object-oriented databases.- Subsumption for complex object data models.- Semantic information connected with data.- Declarative foundations of secure deductive databases.- On materializing views and on-line queries.- Maintaining dictionaries: Space-saving modifications of B-trees.- Set-term matching in logic programming.

O autorze

Joachim Biskup has been Professor of Computer Science since 1981 at the University of Dortmund, University of Hildesheim and University of Dortmund again. He has done research in recursion and complexity theory, information systems with an emphasis on database schema design, query optimization and mediation, and various aspects of security. He served on the program committees of many international conferences, including ICDT, FoIKS, ESORICS and IFIP WG 11.3 Conference on Database and Applications Security.