Editor′s Foreword
On the Expected Size of Recursive Datalog Queries
Tractable Query Languages for Complex Object Databases
A Tight Upper Bound on the Benefits of Replica Control Protocols
On Datalog vs Polynomial Time
Spatial Query Optimization: From Boolean Constraints to Range Queries
Non-deterministic Queue Operations
Subtyping in OODBs
Extrema Predicates in Deductive Databases
Clique Partitions, Graph Compression and Speeding-Up Algorithms
Language Learning with Some Negative Information
The Expected Advantage of Asynchrony
An Optimal Algorithm for Scheduling Interval Ordered Tasks with Communication on N Processors
Separating the Communication Complexities of MOD m and MOD p Circuits
Shortest Paths in Reachability Graphs
Some Logical Characterizations of the Dot-Depth Hierarchy and Applications