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 new characterization of multivalued dependencies having conflict-free 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-free multivalued dependency sets -- Updating logical databases containing null values -- A new characterization of distributed deadlock in databases.