Proceedings of the 3rd International Conference on Database Theory (ICDT), Paris, France, 1990

Original publisher: Springer Verlag, LNCS - Lecture Notes in Computer Science, Volume: 470, ISBN: 3-540-53507-1, Electronic Edition

Research Sessions

Finite Model Theory
[DOI] Playing Games with Objects.
Stéphane Grumbach, Victor Vianu   pp. 25-38
Object-Oriented Databases
[DOI] Algebraic Optimization of Object-Oriented Query Languages.
Catriel Beeri, Yoram Kornatzky   pp. 72-88
[DOI] A Relational Object Model.
Marc H. Scholl, Hans-Jörg Schek   pp. 89-105
Constraint Logic Programming
[DOI] Logic and Databases: An Assessment.
Hervé Gallaire, Jean-Marie Nicolas   pp. 177-186
[DOI] Conjectures and Refutations in Database Design and Dependency Theory.
Jyrki Nummenmaa, Peter Thanisch   pp. 215-228
[DOI] A Theory of Specialization Constraints for Complex Objects.
Grant E. Weddell, Neil Coburn   pp. 229-244
[DOI] Removing Redundancy and Updating Databases.
Paul De Bra, Jan Paredaens   pp. 245-256
Logic and Databases
[DOI] WELL!: An Evaluation Procedure for All Logic Programs.
Nicole Bidoit, P. Legay   pp. 335-348
[DOI] Recursively Indefinite Databases.
Ron van der Meyden   pp. 364-378
[DOI] Low Complexity Aggregation in GraphLog and Datalog.
Mariano P. Consens, Alberto O. Mendelzon   pp. 379-394
[DOI] The Revised Gärdenfors Postulates and Update Semantics.
Leigh Willard, Li-Yan Yuan   pp. 409-421
[DOI] Drawing Updates From Derivations.
Hendrik Decker   pp. 437-451
[DOI] Optimizatioin of a Subclass of Conjunctive Queries.
Pratul Dublish, Joachim Biskup, Yehoshua Sagiv   pp. 455-469
[DOI] Complex Transitive Closure Queries on a Fragmented Graph.
Maurice A. W. Houtsma, Peter M. G. Apers, Stefano Ceri   pp. 470-484
[DOI] Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization.
Seppo Sippu, Eljas Soisalon-Soininen   pp. 485-498
[DOI] On Estimating the Size of Projections.
Jeffrey F. Naughton, S. Seshadri   pp. 499-513
[DOI] Static Estimation of Query Sizes in Horn Programs.
Saumya K. Debray, Nai-Wei Lin   pp. 514-528