4. PODS 1985: Portland, Oregon

Session 1

• Carla Schlatter Ellis:
  Concurrency and Linear Hashing. 1-7
  
• Nathan Goodman, Dennis Shasha:
  Semantically-based Concurrency Control for Search Structures. 8-19
  
• Aris M. Ouksel:
  The Interpolation-Based Grid File. 20-27
  
• Yehoshua Sagiv:
  Concurrent Operations on B-Trees with Overtaking. 28-37
  
• Gultekin Özsoyoglu, Victor Matos:
  On Optimizing Summary-Table-by-Example Queries. 38-50
  
• Shashi K. Gadia, Jay H. Vaishnav:
  A Query Language for a Homogeneous Temporal Database. 51-56
  

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
  
• Jacob Stein, David Maier:
  Relaxing the Universal Relation Scheme Assumption. 76-84
  

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
  
• Thomas W. Page Jr., Gerald J. Popek:
  Distributed Management in Local Area Networks. 135-142
  

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
  
• Serge Abiteboul, Victor Vianu:
  Transactions and Integrity Constraints. 193-204
  
• 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

• Heikki Mannila, Kari-Jouko Räihä:
  Small Armstrong Relations for Database Design. 245-250
  
• Z. Meral Özsoyoglu, Li-Yan Yuan:
  A Normal Form for Nested Relations. 251-260
  
• Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos:
  Partition Semantics for Relations. 261-275
  

Last update Thu May 24 04:40:23 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page