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] Finite-Model Theory - a Personal Perspective.
Ronald Fagin   pp. 3-24
[DOI] Playing Games with Objects.
Stéphane Grumbach, Victor Vianu   pp. 25-38
Object-Oriented Databases
[DOI] Representing Object Identity in a Pure Functional Language.
Atsushi Ohori   pp. 41-55
[DOI] A Class Abstraction for a Hierarchical Type System.
Giorgio Ghelli   pp. 56-71
[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
Data Structures
[DOI] Maintaining Bounded Disorder Files in Multiprocessor Multi-Disk Environments.
Gabriel Matsliach, Oded Shmueli   pp. 109-125
[DOI] An Evaluation Model for Clustering Strategies in the O2 Object-Oriented Database System.
Véronique Benzaken   pp. 126-140
[DOI] Efficient Algorithms for Managing the History of Evolving Databases.
Vassilis J. Tsotras, B. Gopinath   pp. 141-174
Constraint Logic Programming
[DOI] Logic and Databases: An Assessment.
Hervé Gallaire, Jean-Marie Nicolas   pp. 177-186
[DOI] A Closed Form for Datalog Queries with Integer Order.
Peter Z. Revesz   pp. 187-201
[DOI] On The Expressive Power of the Relational Calculus with Arithmetic Constraints.
Gabriel M. Kuper   pp. 202-211
Dependencies
[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
Concurrency Control
[DOI] Improving the Concurrency of Integrity Checks and Write Operations.
Stefan Böttcher   pp. 259-273
[DOI] A Flexible and Adaptable Tool Kit Approach for Concurrency Control in Non Standard Database Systems.
Rainer Unland   pp. 274-288
Fault Tolerance
[DOI] A Comparative Analysis of Two-Phase-Commit Protocols.
Ouri Wolfson   pp. 291-304
[DOI] Efficient Voting Protocols with Witnesses.
Jehan-François Pâris   pp. 305-317
[DOI] Voting and Relocation Strategies Preserving Consistency among Replicated Files.
Uwe M. Borghoff   pp. 318-332
Logic and Databases
[DOI] WELL!: An Evaluation Procedure for All Logic Programs.
Nicole Bidoit, P. Legay   pp. 335-348
[DOI] Beginnings of a Theory of General Database Completions.
Stefan Brass   pp. 349-363
[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] Deciding Boundedness for Uniformly Connected Datalog Programs.
Irène Guessarian   pp. 395-405
Updates
[DOI] The Revised Gärdenfors Postulates and Update Semantics.
Leigh Willard, Li-Yan Yuan   pp. 409-421
[DOI] Foundations of Canonical Update Support for Closed Database Views.
Stephen J. Hegner   pp. 422-436
[DOI] Drawing Updates From Derivations.
Hendrik Decker   pp. 437-451
Optimization
[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
The full-text material linked from here is (c) Springer Verlag. The 'get via DOI' ([DOI]) link loads the full-text from Springer Link. Notice that a subscription (or pay-per-view) is necessary to actually load the PDFs.
Menu
Related links