Abstract is missing.
- Database Theory: Past and FutureJeffrey D. Ullman. 1-10 [doi]
- Logic Programming With SetsGabriel M. Kuper. 11-20 [doi]
- Sets and Negation in a Logic Database Language (LDL1)Catriel Beeri, Shamim A. Naqvi, Raghu Ramakrishnan, Oded Shmueli, Shalom Tsur. 21-37 [doi]
- Logical Design of Relational Database SystemsLi-Yan Yuan, Z. Meral Özsoyoglu. 38-47 [doi]
- On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional DependenciesEdward P. F. Chan, Héctor J. Hernández. 48-57 [doi]
- Computing Covers for Embedded Functional DependenciesGeorg Gottlob. 58-69 [doi]
- Dynamic Query Interpretation in Relational DatabasesAlessandro D Atri, Paolino Di Felice, Marina Moscarini. 70-78 [doi]
- A New Basis for the Weak Instance ModelPaolo Atzeni, Maria Cristina De Bernardis. 79-86 [doi]
- Answering Queries in Categorial Data BasesFrancesco M. Malvestuto. 87-96 [doi]
- Nested Transactions and Read/Write LockingAlan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl. 97-111 [doi]
- Transaction Commitment at Minimal Communication CostAdrian Segall, Ouri Wolfson. 112-118 [doi]
- The Precedence-Assignment Model for Distributed Database Concurrency Control AlgorithmsC. P. Wang, Victor O. K. Li. 119-128 [doi]
- A Knowledge Theoretic Analysis of Atomic Commitment ProtocolsVassos Hadzilacos. 129-134 [doi]
- Perspectives in Deductive Databases (Abstract)Jack Minker. 135 [doi]
- Maintenance of Stratified Databases Viewed as a Belief Revision SystemKrzysztof R. Apt, Jean-Marc Pugin. 136-145 [doi]
- Specification and Implementation of Programs for Updating Incomplete Information DatabasesStephen J. Hegner. 146-158 [doi]
- Operation Specific Locking in B-TreesAlexandros Biliris. 159-169 [doi]
- Concurrency Control in Database Structures with Relaxed BalanceOtto Nurmi, Eljas Soisalon-Soininen, Derick Wood. 170-176 [doi]
- Performance Results in Multiversion Timestamp Concurrency Control with Predeclared WritesetsRong Sun, Gomer Thomas. 177-184 [doi]
- Decomposing an N-ary Relation into a Tree of Binary RelationsRina Dechter. 185-189 [doi]
- Formal Limits on the Automatic Generation and Maintenance of Integrity ConstraintsJames P. Delgrande. 190-196 [doi]
- Relative Knowledge in a Distributed DatabaseTomasz Imielinski. 197-209 [doi]
- The Parallel Complexity of Simple Chain QueriesFoto N. Afrati, Christos H. Papadimitriou. 210-213 [doi]
- Bounds on the Propagation of Selection into Logic ProgramsCatriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan. 214-226 [doi]
- A Decidable Class of Bounded RecursionsJeffrey F. Naughton, Yehoshua Sagiv. 227-236 [doi]
- Decidability and Expressiveness of Logic QueriesOded Shmueli. 237-249 [doi]
- Chickens and Eggs: The Interrelationship of Systems and TheoryPatricia G. Selinger. 250-253 [doi]
- Axiomatization and Simplification Rules for Relational TransactionsAlmira Karabeg, Dino Karabeg, Kostoula Papakonstantinou, Victor Vianu. 254-259 [doi]
- A Transcation Language Complete for Database Update and SpecificationSerge Abiteboul, Victor Vianu. 260-268 [doi]
- On the Power of MagicCatriel Beeri, Raghu Ramakrishnan. 269-284 [doi]
- Efficient Evaluation for a Subset of Recursive QueriesGösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen. 284-293 [doi]
- Worst-case Complexity Analysis of Methods for Logic Query ImplementationAlberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà. 294-301 [doi]
- On the Expressive Power of the Extended Relational Algebra for the Unnormalized Relational ModelDirk Van Gucht. 302-312 [doi]
- Safety and Correct Translation of Relational Calculus FormulasAllen Van Gelder, Rodney W. Topor. 313-327 [doi]
- Safety of Recursive Horn Clauses With Infinite RelationsRaghu Ramakrishnan, François Bancilhon, Abraham Silberschatz. 328-339 [doi]
- One-Sided RecursionsJeffrey F. Naughton. 340-348 [doi]
- Optimizing Datalog ProgramsYehoshua Sagiv. 349-362 [doi]