Abstract is missing.
- Title, Foreword, Table of Contents [doi]
- Finite-Model Theory - a Personal PerspectiveRonald Fagin. 3-24 [doi]
- Playing Games with ObjectsStéphane Grumbach, Victor Vianu. 25-38 [doi]
- Representing Object Identity in a Pure Functional LanguageAtsushi Ohori. 41-55 [doi]
- A Class Abstraction for a Hierarchical Type SystemGiorgio Ghelli. 56-71 [doi]
- Algebraic Optimization of Object-Oriented Query LanguagesCatriel Beeri, Yoram Kornatzky. 72-88 [doi]
- A Relational Object ModelMarc H. Scholl, Hans-Jörg Schek. 89-105 [doi]
- Maintaining Bounded Disorder Files in Multiprocessor Multi-Disk EnvironmentsGabriel Matsliach, Oded Shmueli. 109-125 [doi]
- An Evaluation Model for Clustering Strategies in the O2 Object-Oriented Database SystemVéronique Benzaken. 126-140 [doi]
- Efficient Algorithms for Managing the History of Evolving DatabasesVassilis J. Tsotras, B. Gopinath. 141-174 [doi]
- Logic and Databases: An AssessmentHervé Gallaire, Jean-Marie Nicolas. 177-186 [doi]
- A Closed Form for Datalog Queries with Integer OrderPeter Z. Revesz. 187-201 [doi]
- On The Expressive Power of the Relational Calculus with Arithmetic ConstraintsGabriel M. Kuper. 202-211 [doi]
- Conjectures and Refutations in Database Design and Dependency TheoryJyrki Nummenmaa, Peter Thanisch. 215-228 [doi]
- A Theory of Specialization Constraints for Complex ObjectsGrant E. Weddell, Neil Coburn. 229-244 [doi]
- Removing Redundancy and Updating DatabasesPaul De Bra, Jan Paredaens. 245-256 [doi]
- Improving the Concurrency of Integrity Checks and Write OperationsStefan Böttcher. 259-273 [doi]
- A Flexible and Adaptable Tool Kit Approach for Concurrency Control in Non Standard Database SystemsRainer Unland. 274-288 [doi]
- A Comparative Analysis of Two-Phase-Commit ProtocolsOuri Wolfson. 291-304 [doi]
- Efficient Voting Protocols with WitnessesJehan-François Pâris. 305-317 [doi]
- Voting and Relocation Strategies Preserving Consistency among Replicated FilesUwe M. Borghoff. 318-332 [doi]
- WELL!: An Evaluation Procedure for All Logic ProgramsNicole Bidoit, P. Legay. 335-348 [doi]
- Beginnings of a Theory of General Database CompletionsStefan Brass. 349-363 [doi]
- Recursively Indefinite DatabasesRon van der Meyden. 364-378 [doi]
- Low Complexity Aggregation in GraphLog and DatalogMariano P. Consens, Alberto O. Mendelzon. 379-394 [doi]
- Deciding Boundedness for Uniformly Connected Datalog ProgramsIrène Guessarian. 395-405 [doi]
- The Revised Gärdenfors Postulates and Update SemanticsLeigh Willard, Li-Yan Yuan. 409-421 [doi]
- Foundations of Canonical Update Support for Closed Database ViewsStephen J. Hegner. 422-436 [doi]
- Drawing Updates From DerivationsHendrik Decker. 437-451 [doi]
- Optimizatioin of a Subclass of Conjunctive QueriesPratul Dublish, Joachim Biskup, Yehoshua Sagiv. 455-469 [doi]
- Complex Transitive Closure Queries on a Fragmented GraphMaurice A. W. Houtsma, Peter M. G. Apers, Stefano Ceri. 470-484 [doi]
- Multiple SIP Strategies and Bottom-Up Adorning in Logic Query OptimizationSeppo Sippu, Eljas Soisalon-Soininen. 485-498 [doi]
- On Estimating the Size of ProjectionsJeffrey F. Naughton, S. Seshadri. 499-513 [doi]
- Static Estimation of Query Sizes in Horn ProgramsSaumya K. Debray, Nai-Wei Lin. 514-528 [doi]