4. PODS 1985: Portland, Oregon
Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 25-27, 1985, Portland, Oregon, USA. ACM 1985 ISBN 0-89791-153-9
Session 1
- Carla Schlatter Ellis: Concurrency and Linear Hashing. 1-7
- Aris M. Ouksel: The Interpolation-Based Grid File. 20-27
- Yehoshua Sagiv: Concurrent Operations on B-Trees with Overtaking. 28-37
Session 2
- Moshe Y. Vardi: Querying Logical Databases. 57-65
- Volkert Brosda, Gottfried Vossen: Updating a Relational Database through a Universal Schema Interface. 66-75
Session 3
- Alexander Tuzhilin, Paul G. Spirakis: A Semantic Approach to Correctness of Concurrent Transaction Executions. 85-95
- Thanasis Hadzilacos, Christos H. Papadimitriou: Algorithmic Aspects of Multiversion Concurrency Control. 96-104
- Ouri Wolfson, Mihalis Yannakakis: Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. 105-112
Session 4
- Jack Kent, Hector Garcia-Molina, Jae Chung: An Experimental Evaluation of Crash Recovery Mechanisms. 113-122
- Marco A. Casanova, Arnaldo V. Moura, Luiz Tucherman: On the Correctness of a Local Storage Subsystem. 123-134
Session 5
- Tim Connors: Equivalence of Views by Query Capacity. 143-148
- François Bancilhon, Nicolas Spyratos: Algebraic Versus Probabilistic Independence in Data Bases. 149-153
- Arthur M. Keller: Algorithms for Translating View Updates to Database Updates for Views Involving Selections, Projections, and Joins. 154-163
Session 6
- Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini: Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. 164-170
- Yehoshua Sagiv: On Computing Restricted Projections of Representative Instances. 171-180
- Paolo Atzeni, Edward P. F. Chan: Efficient Query Answering in the Representative Instance Approach. 181-188
- Sukhamay Kundu: An Improved Algorithm for Finding a Key of a Relation. 189-192
- Marc Gyssens: Embedded Join Dependencies as a Tool for Decomposing Full Join Dependencies. 205-214
Session 7
- Amr El Abbadi, Dale Skeen, Flaviu Cristian: An Efficient, Fault-Tolerant Protocol for Replicated Data Management. 215-229
- Christos H. Papadimitriou, Mihalis Yannakakis: The Complexity of Reliable Concurrency Control. 230-234
- K. V. S. Ramarao: On the Complexity of Commit Protocols. 235-244
Session 8
- Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos: Partition Semantics for Relations. 261-275
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team