5. PODS 1986: Cambridge, Massachusetts

@proceedings{DBLP:conf/pods/86,
  title     = {Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles
               of Database Systems, March 24-26, 1986, Cambridge, Massachusetts},
  publisher = {ACM},
  year      = {1986},
  isbn      = {0-89791-179-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Session 1

• François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman:
  Magic Sets and Other Strange Ways to Implement Logic Programs. 1-15
  
• Domenico Saccà, Carlo Zaniolo:
  On the Implementation of a Simple Class of Logic Queries for Databases. 16-23
  
• Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman:
  Convergence of Sideways Query Evaluation. 24-30
  

Session 2

• Gerhard Weikum:
  A Theoretical Foundation of Multi-Level Concurrency Control. 31-43
  
• Thanasis Hadzilacos, Mihalis Yannakakis:
  Deleting Completed Transactions. 43-46
  
• Jianwen Su:
  Safety of Non-Well-Locked Trasnaction Systems. 47-52
  

Session 3

• François Bancilhon, Setrag Khoshafian:
  A Calculus for Complex Objects. 53-60
  
• Dirk Van Gucht, Patrick C. Fischer:
  Some Classes of Multilevel Relational Structures. 60-69
  
• Shashi K. Gadia:
  Weak Temporal Relations. 70-77
  

Session 4

• Frank Olken, Doron Rotem:
  Rearranging Data to Maximize the Efficiency of Compression. 78-90
  
• John T. Robinson:
  Order Preserving Linear Hashing Using Dynamic Key Statistics. 91-99
  
• Ekow J. Otoo:
  Balanced Multidimensional Extendible Hash Tree. 100-113
  

Session 5

• Shamim A. Naqvi:
  Negation as Failure for First-Order Queries. 114-122
  
• Nicole Bidoit, Richard Hull:
  Positivism vs. Minimalism in Deductive Databases. 123-132
  
• Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski:
  The Extended Closed World Assumpution and its Relationship to Parallel Circumscription. 133-139
  

Session 6

• Edward P. F. Chan, Paolo Atzeni:
  On the Properties and Characterization of Connection-tap-free Schemes. 140-147
  
• Joachim Biskup, Hans Hermann Brüggemann, L. Schnetgöke, M. Kramer:
  One Flavor Assumption and Gamma-Acyclicity for Universal Relation Views. 148-159
  
• Yehoshua Sagiv, Oded Shmueli:
  The Equivalence of Solving Queries and Production Tree Projections. 160-172
  

Session 7

• Yehoshua Sagiv, Oded Shmueli:
  On Finite FD-Acyclicity. 173-182
  
• Li-Yan Yuan, Z. Meral Özsoyoglu:
  Unifying Functional and Multivalued Dependencies for Relational Database Design. 183-190
  
• Detlev Ruland, Dietmar Seipel:
  Alpha-Acyclic Decompositions of Relational Database Schemes. 191-201
  

Session 8

• Marc H. Graham, Ke Wang:
  Constant Time Maintenance or The Triumph of the fd. 202-216
  
• Heikki Mannila, Kari-Jouko Räihä:
  Test Data for Relational Queries. 217-223
  
• Marianne Winslett:
  A Model-Theoretic Approach to Updating Logical Databases. 224-234
  

Session 9

• Serge Abiteboul, Victor Vianu:
  Deciding Properties of Transactional Schemas. 235-239
  
• Amr El Abbadi, Sam Toueg:
  Availability in Partitioned Replicated Databases. 240-251
  

Session 10

• Moshe Y. Vardi:
  On the Integrity of Databases with Incomplete Information. 252-266
  
• Jeffrey F. Naughton:
  Data Independent Recursion in Deductive Databases. 267-279
  
• Stavros S. Cosmadakis, Paris C. Kanellakis:
  Parallel Evaluation of Recursive Rule Queries. 280-293