


default search action
3rd ICDT 1990: Paris, France
- Serge Abiteboul, Paris C. Kanellakis:

ICDT'90, Third International Conference on Database Theory, Paris, France, December 12-14, 1990, Proceedings. Lecture Notes in Computer Science 470, Springer 1990, ISBN 3-540-53507-1
Finite Model Theory
- Ronald Fagin:

Finite-Model Theory - a Personal Perspective. 3-24 - Stéphane Grumbach, Victor Vianu:

Playing Games with Objects. 25-38
Object-Oriented Databases
- Atsushi Ohori:

Representing Object Identity in a Pure Functional Language. 41-55 - Giorgio Ghelli:

A Class Abstraction for a Hierarchical Type System. 56-71 - Catriel Beeri, Yoram Kornatzky:

Algebraic Optimization of Object-Oriented Query Languages. 72-88 - Marc H. Scholl

, Hans-Jörg Schek:
A Relational Object Model. 89-105
Data Structures
- Gabriel Matsliach, Oded Shmueli:

Maintaining Bounded Disorder Files in Multiprocessor Multi-Disk Environments. 109-125 - Véronique Benzaken:

An Evaluation Model for Clustering Strategies in the O2 Object-Oriented Database System. 126-140 - Vassilis J. Tsotras

, B. Gopinath:
Efficient Algorithms for Managing the History of Evolving Databases. 141-174
Constraint Logic Programming
- Hervé Gallaire, Jean-Marie Nicolas:

Logic and Databases: An Assessment. 177-186 - Peter Z. Revesz

:
A Closed Form for Datalog Queries with Integer Order. 187-201 - Gabriel M. Kuper:

On The Expressive Power of the Relational Calculus with Arithmetic Constraints. 202-211
Dependencies
- Jyrki Nummenmaa

, Peter Thanisch:
Conjectures and Refutations in Database Design and Dependency Theory. 215-228 - Grant E. Weddell, Neil Coburn:

A Theory of Specialization Constraints for Complex Objects. 229-244 - Paul De Bra, Jan Paredaens:

Removing Redundancy and Updating Databases. 245-256
Concurrency Control
- Stefan Böttcher:

Improving the Concurrency of Integrity Checks and Write Operations. 259-273 - Rainer Unland:

A Flexible and Adaptable Tool Kit Approach for Concurrency Control in Non Standard Database Systems. 274-288
Fault Tolerance
- Ouri Wolfson

:
A Comparative Analysis of Two-Phase-Commit Protocols. 291-304 - Jehan-François Pâris:

Efficient Voting Protocols with Witnesses. 305-317 - Uwe M. Borghoff

:
Voting and Relocation Strategies Preserving Consistency among Replicated Files. 318-332
Logic and Databases
- Nicole Bidoit, P. Legay:

WELL!: An Evaluation Procedure for All Logic Programs. 335-348 - Stefan Brass:

Beginnings of a Theory of General Database Completions. 349-363 - Ron van der Meyden:

Recursively Indefinite Databases. 364-378 - Mariano P. Consens

, Alberto O. Mendelzon:
Low Complexity Aggregation in GraphLog and Datalog. 379-394 - Irène Guessarian:

Deciding Boundedness for Uniformly Connected Datalog Programs. 395-405
Updates
- Leigh Willard, Li-Yan Yuan:

The Revised Gärdenfors Postulates and Update Semantics. 409-421 - Stephen J. Hegner:

Foundations of Canonical Update Support for Closed Database Views. 422-436 - Hendrik Decker:

Drawing Updates From Derivations. 437-451
Optimization
- Pratul Dublish, Joachim Biskup, Yehoshua Sagiv:

Optimizatioin of a Subclass of Conjunctive Queries. 455-469 - Maurice A. W. Houtsma, Peter M. G. Apers, Stefano Ceri:

Complex Transitive Closure Queries on a Fragmented Graph. 470-484 - Seppo Sippu, Eljas Soisalon-Soininen:

Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization. 485-498 - Jeffrey F. Naughton, S. Seshadri:

On Estimating the Size of Projections. 499-513 - Saumya K. Debray, Nai-Wei Lin:

Static Estimation of Query Sizes in Horn Programs. 514-528

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














