The papers in this volume were presented at theInternational Conference on Database Theory, held in Berlin,Germany, October 14-16, 1992. This conference initiated themerger of two series of conferences on theoretical aspectsof databases that were formed in parallel by differentscientific communities in Europe. The first series was knownas the International Conference on Database Theory and thesecond as the Symposium on Mathematical Fundamentals ofDatabase Systems. In the future, ICDT will be organizedevery two years, alternating with the more practicallyoriented series of conferences on Extending DatabaseTechnology (EDBT).The volume contains 3 invited lectures and 26 contributedpapers selected from a total of 107 submissions. The papersare organized into sections on constraints anddecomposition, query languages, updates and activedatabases, concurrency control and recovery, knowledgebases, datalog complexity and optimization, objectorientation, information capacity and security, and datastructures and algorithms. Two of the invited papers surveyresearch into theoretical database issues done in EasternEurope during the past decade.
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.
Series: Lecture Notes in Computer Science
Number Of Pages: 454
Published: 5th October 1992
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6
Weight (kg): 0.64