Abstract is missing.
- Concurrency and Linear HashingCarla Schlatter Ellis. 1-7 [doi]
- Semantically-based Concurrency Control for Search StructuresNathan Goodman, Dennis Shasha. 8-19 [doi]
- The Interpolation-Based Grid FileAris M. Ouksel. 20-27 [doi]
- Concurrent Operations on B-Trees with OvertakingYehoshua Sagiv. 28-37 [doi]
- On Optimizing Summary-Table-by-Example QueriesGultekin Özsoyoglu, Victor Matos. 38-50 [doi]
- A Query Language for a Homogeneous Temporal DatabaseShashi K. Gadia, Jay H. Vaishnav. 51-56 [doi]
- Querying Logical DatabasesMoshe Y. Vardi. 57-65 [doi]
- Updating a Relational Database through a Universal Schema InterfaceVolkert Brosda, Gottfried Vossen. 66-75 [doi]
- Relaxing the Universal Relation Scheme AssumptionJacob Stein, David Maier. 76-84 [doi]
- A Semantic Approach to Correctness of Concurrent Transaction ExecutionsAlexander Tuzhilin, Paul G. Spirakis. 85-95 [doi]
- Algorithmic Aspects of Multiversion Concurrency ControlThanasis Hadzilacos, Christos H. Papadimitriou. 96-104 [doi]
- Deadlock-Freedom (and Safety) of Transactions in a Distributed DatabaseOuri Wolfson, Mihalis Yannakakis. 105-112 [doi]
- An Experimental Evaluation of Crash Recovery MechanismsJack Kent, Hector Garcia-Molina, Jae Chung. 113-122 [doi]
- On the Correctness of a Local Storage SubsystemMarco A. Casanova, Arnaldo V. Moura, Luiz Tucherman. 123-134 [doi]
- Distributed Management in Local Area NetworksThomas W. Page Jr., Gerald J. Popek. 135-142 [doi]
- Equivalence of Views by Query CapacityTim Connors. 143-148 [doi]
- Algebraic Versus Probabilistic Independence in Data BasesFrançois Bancilhon, Nicolas Spyratos. 149-153 [doi]
- Algorithms for Translating View Updates to Database Updates for Views Involving Selections, Projections, and JoinsArthur M. Keller. 154-163 [doi]
- Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data ModelsGiorgio Ausiello, Alessandro D Atri, Marina Moscarini. 164-170 [doi]
- On Computing Restricted Projections of Representative InstancesYehoshua Sagiv. 171-180 [doi]
- On Finite FD-AcyclicityYehoshua Sagiv, Oded Shmueli. 173-182 [doi]
- Efficient Query Answering in the Representative Instance ApproachPaolo Atzeni, Edward P. F. Chan. 181-188 [doi]
- An Improved Algorithm for Finding a Key of a RelationSukhamay Kundu. 189-192 [doi]
- Transactions and Integrity ConstraintsSerge Abiteboul, Victor Vianu. 193-204 [doi]
- Embedded Join Dependencies as a Tool for Decomposing Full Join DependenciesMarc Gyssens. 205-214 [doi]
- An Efficient, Fault-Tolerant Protocol for Replicated Data ManagementAmr El Abbadi, Dale Skeen, Flaviu Cristian. 215-229 [doi]
- The Complexity of Reliable Concurrency ControlChristos H. Papadimitriou, Mihalis Yannakakis. 230-234 [doi]
- On the Complexity of Commit ProtocolsK. V. S. Ramarao. 235-244 [doi]
- Small Armstrong Relations for Database DesignHeikki Mannila, Kari-Jouko Räihä. 245-250 [doi]
- A Normal Form for Nested RelationsZ. Meral Özsoyoglu, Li-Yan Yuan. 251-260 [doi]
- Partition Semantics for RelationsStavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos. 261-275 [doi]