The emergence of new paradigms for data management raises a variety of exciting challenges. An important goal of database theory is to answer these challenges by providing sound foundations for the development of the field. This volume contains the papers selected for the third International Conference on Database Theory, ICDT'90. The conferences in this series are held biannually in beautiful European cities, Rome in 1986 and Bruges in 1988 with proceedings published as volumes 234 and 326 in the same series. ICDT'90 was organized in Paris by the Institut National de Recherche en Informatique et Automatique. The conference features 2 invited presentations and 31 papers selected from 129 submissions. The papers describe original ideas and new results on the foundations of databases, knowledge bases, object-oriented databases, relational theory, transaction management, data structures and deductive databases. The volume offers a good overview of the state of the art and the current trends in database theory. It should be a valuable source of information for researchers interested in the field.
Author(s): Ronald Fagin (auth.), Serge Abiteboul, Paris C. Kanellakis (eds.)
Series: Lecture Notes in Computer Science 470
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1990
Language: English
Pages: 530
Tags: Database Management; Data Storage Representation; Artificial Intelligence (incl. Robotics); Programming Languages, Compilers, Interpreters; Computation by Abstract Devices; Mathematical Logic and Formal Languages
Finite-model theory—a personal perspective....Pages 1-24
Playing games with objects....Pages 25-38
Representing object identity in a pure functional language....Pages 39-55
A class abstraction for a hierarchical type system....Pages 56-71
Algebraic optimization of object-oriented query languages....Pages 72-88
A relational object model....Pages 89-105
Maintaining bounded disorder files in multiprocessor multi-disk environments....Pages 107-125
An evaluation model for clustering strategies in the O 2 object-oriented database system....Pages 126-140
Efficient algorithms for managing the history of evolving databases....Pages 141-174
Logic and Databases: An assessment....Pages 175-186
A closed form for datalog queries with integer order....Pages 187-201
On the expressive power of the relational calculus with arithmetic constraints....Pages 202-211
Conjectures and refutations in database design and dependency theory....Pages 213-228
A theory of specialization constraints for complex objects....Pages 229-244
Removing redundancy and updating databases....Pages 245-256
Improving the concurrency of integrity checks and write operations....Pages 257-273
A flexible and adaptable tool kit approach for concurrency control in non standard database systems....Pages 274-288
A comparative analysis of two-phase-commit protocols....Pages 289-304
Efficient voting protocols with witnesses....Pages 305-317
Voting and relocation strategies preserving consistency among replicated files....Pages 318-332
Well!: An evaluation procedure for all logic programs....Pages 333-348
Beginnings of a theory of general database completions....Pages 349-363
Recursively indefinite databases....Pages 364-378
Low complexity aggregation in graphlog and Datalog....Pages 379-394
Deciding boundedness for uniformly connected Datalog programs....Pages 395-405
The Revised Gärdenfors postulates and update semantics....Pages 407-421
Foundations of canonical update support for closed database views....Pages 422-436
Drawing updates from derivations....Pages 437-451
Optimization of a subclass of conjunctive queries....Pages 453-469
Complex transitive closure queries on a fragmented graph....Pages 470-484
Multiple SIP strategies and bottom-up adorning in logic query optimization....Pages 485-498
On estimating the size of projections....Pages 499-513
Static estimation of query sizes in horn programs....Pages 514-528
