Icdt86 International Conference On Database Theory. Rome Italy September 8

Logic Programming And Parallel Complexity.- The Generalized Counting Method For Recursive Logic Queries.- Restructuring Of Complex Objects And Office Forms.- Set Containment Inference.- A Domain Theoretic Approach To Higher-order Relations.- On The Desirability Of?-acyclic Bcnf Database Schemes.- Update Semantics Under The Domain Closure Assumption.- Unsolvable Problems Related To The View Integration Approach.- Horizontal Decompositions Based On Functional-dependency-setimplications.- Update Serializability In Locking.- Filtering Data Flow In Deductive Databases.- Multidimensional Order Preserving Linear Hashing With Partial Expansions.- Split-freedom And Mvd-intersection: A Characterization Of Multivalued Dependencies Having Conflict- Covers.- Towards Online Schedulers Based On Pre-analysis Locking.- Query Processing In Incomplete Logical Databases.- To The Theory Of Nested Transactions.- Entity-relationship Consistency For Relational Schemas.- Modelling Large Bases Of Categorical Data With Acyclic Schemes.- Some Extensions To The Closed World Assumption In Databases.- Expedient Stochastic Move-to-front And Optimal Stochastic Move-to-rear List Organizing Strategies.- The Cost Of Locking.- Theoretical Foundation Of Algebraic Optimization Utilizing Unnormalized Relations.- A Polynomial-time Join Dependency Implication Algorithm For Unary Multi-valued Dependencies.- Interaction- Multivalued Dependency Sets.- Updating Logical Databases Containing Null Values.- A Characterization Of Distributed Deadlock In Databases.