The papers in this volume were presented at the International Conference on Database Theory, held in Berlin, Germany, October 14-16, 1992. This conference initiated the merger of two series of conferences on theoretical aspects of databases that were formed in parallel by different scientific communities in Europe. The first series was known as the International Conference on Database Theory and the second as the Symposium on Mathematical Fundamentals of Database Systems. In the future, ICDT will be organized every two years, alternating with the more practically oriented series of conferences on Extending Database Technology (EDBT). The volume contains 3 invited lectures and 26 contributed papers selected from a total of 107 submissions. The papers are organized into sections on constraints and decomposition, query languages, updates and active databases, concurrency control and recovery, knowledge bases, datalog complexity and optimization, object orientation, information capacity and security, and data structures and algorithms. Two of the invited papers survey research into theoretical database issues done in Eastern Europe during the past decade.
Author(s): G. O. H. Katona (auth.), Joachim Biskup, Richard Hull (eds.)
Series: Lecture Notes in Computer Science 646
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1992
Language: English
Pages: 454
Tags: Database Management; Mathematical Logic and Formal Languages; Computation by Abstract Devices; Artificial Intelligence (incl. Robotics)
Combinatorial and algebraic results for database relations....Pages 1-20
Semantics of disjunctive deductive databases....Pages 21-50
Database theory in Russia (1979–1991) (an overview)....Pages 51-70
On the composition and decomposition of attributes and tuples....Pages 71-85
Approximate dependency inference from relations....Pages 86-98
Views and decompositions of databases from a categorical perspective....Pages 99-112
Computing with infinitary logic....Pages 113-123
Query languages with counters....Pages 124-139
Naturally embedded query languages....Pages 140-154
Optimizing incremental computation of datalog programs with non-deterministic semantics....Pages 155-170
Optimizing active databases using the split technique (Preliminary Report)....Pages 171-187
Updating atomic information in labelled database systems (extended abstract)....Pages 188-200
Context-specific synchronization for atomic data types....Pages 201-215
Hybrid atomicity for nested transactions....Pages 216-230
Model and verification of a data manager based on ARIES....Pages 231-245
Minimizing indefinite information in disjunctive deductive databases....Pages 246-260
Well founded semantics and stable semantics of semi-strict programs....Pages 261-275
On finding extensions of default theories....Pages 276-281
Incremental evaluation of Datalog queries....Pages 282-296
Decidability and undecidability of equivalence for linear Datalog, with applications to normal-form optimizations....Pages 297-311
A paradox in database theory....Pages 312-325
A hierarchy of faithful set creation in pure OODB's....Pages 326-340
Identification, genericity and consistency in object-oriented databases....Pages 341-356
Subsumption for complex object data models....Pages 357-375
Semantic information connected with data....Pages 376-390
Declarative foundations of secure deductive databases....Pages 391-406
On materializing views and on-line queries....Pages 407-420
Maintaining dictionaries: Space-saving modifications of B-trees....Pages 421-435
Set-term matching in logic programming....Pages 436-449
