8. PODS 1989: Philadelphia, Pennsylvania

@proceedings{DBLP:conf/pods/89,
  title     = {Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium
               on Principles of Database Systems, March 29-31, 1989, Philadelphia,
               Pennsylvania},
  publisher = {ACM Press},
  year      = {1989},
  isbn      = {0-89791-308-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Session 1

• Allen Van Gelder:
  The Alternating Fixpoint of Logic Programs with Negation. 1-10
  Electronic Edition (ACM DL) BibTeX
• Teodor C. Przymusinski:
  Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model. 11-21
  Electronic Edition (ACM DL) BibTeX
• Kenneth A. Ross:
  A Procedural Semantics for Well Founded Negation in Logic Programs. 22-33
  Electronic Edition (ACM DL) BibTeX

Session 2

• François Bry:
  Logic Programming as Constructivism: A Formalization and its Application to Databases. 34-50
  Electronic Edition (ACM DL) BibTeX
• Tomasz Imielinski, Kumar V. Vadaparty:
  Complexity of Query Processing in Databases with OR-Objects. 51-65
  Electronic Edition (ACM DL) BibTeX
• Li-Yan Yuan, Ding-An Chiang:
  A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information. 66-74
  Electronic Edition (ACM DL) BibTeX
• Gösta Grahne:
  Horn Tables - An Efficient Tool for Handling Incomplete Information in Databases. 75-82
  Electronic Edition (ACM DL) BibTeX

Session 3

• Moshe Y. Vardi:
  Automata Theory for Database Theoreticans. 83-92
  Electronic Edition (ACM DL) BibTeX
• Sanjay Manchanda:
  Declarative Expression of Deductive Database Updates. 93-100
  Electronic Edition (ACM DL) BibTeX
• Paolo Atzeni, Riccardo Torlone:
  Updating Databases in the Weak Instance Model. 101-109
  Electronic Edition (ACM DL) BibTeX

Session 4

• Y. C. Tay:
  Attribute Agreement. 110-119
  Electronic Edition (ACM DL) BibTeX
• Ke Wang:
  Can Constant-time Maintainability Be More Practical? 120-127
  Electronic Edition (ACM DL) BibTeX
• Heikki Mannila, Kari-Jouko Räihä:
  Practical Algorithms for Finding Prime Attributes and Testing Normal Forms. 128-133
  Electronic Edition (ACM DL) BibTeX
• Charles Elkan:
  A Decision Procedure for Conjunctive Query Disjointness. 134-139
  Electronic Edition (ACM DL) BibTeX

Session 5

• Jeffrey D. Ullman:
  Bottom-Up Beats Top-Down for Datalog. 140-149
  Electronic Edition (ACM DL) BibTeX
• Hirohisa Seki:
  On the Power of Alexander Templates. 150-159
  Electronic Edition (ACM DL) BibTeX
• Yehoshua Sagiv, Moshe Y. Vardi:
  Safety of Datalog Queries over Infinite Databases. 160-171
  Electronic Edition (ACM DL) BibTeX

Session 6

• Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi:
  Proof-Tree Transformation Theorems and Their Applications. 172-181
  Electronic Edition (ACM DL) BibTeX
• Yatin P. Saraiya:
  Linearizing Nonlinear Recursions in Polynomial Time. 182-189
  Electronic Edition (ACM DL) BibTeX
• Alexander Brodsky, Yehoshua Sagiv:
  Inference of Monotonicity Constraints in Datalog Programs. 190-199
  Electronic Edition (ACM DL) BibTeX
• Simona Rabinovici-Cohen, Ouri Wolfson:
  Why a Single Parallelization Strategy in not Enough in Knowledge Bases. 200-216
  Electronic Edition (ACM DL) BibTeX

Session 7

• Alfred Z. Spector:
  Modular Architectures for Distributed and Database Systems. 217-224
  Electronic Edition (ACM DL) BibTeX
• Doron Rotem:
  Clustered Multiattribute Hash Files. 225-234
  Electronic Edition (ACM DL) BibTeX
• Theodore Johnson, Dennis Shasha:
  Utilization of B-trees with Inserts, Deletes and Modifies. 235-246
  Electronic Edition (ACM DL) BibTeX

Session 8

• Christos Faloutsos, Shari Roseman:
  Fractals for Secondary Key Retrieval. 247-252
  Electronic Edition (ACM DL) BibTeX
• Christos Faloutsos, Dimitris N. Metaxas:
  Declustering Using Error Correcting Codes. 253-258
  Electronic Edition (ACM DL) BibTeX
• William E. Weihl:
  The Impact of Recovery on Concurrency Control. 259-269
  Electronic Edition (ACM DL) BibTeX
• Ada Wai-Chee Fu, Tiko Kameda:
  Concurrency Control of Nested Transactions Accessing B-Trees. 270-285
  Electronic Edition (ACM DL) BibTeX

Session 9

• Anthony J. Bonner:
  Hypothetical Datalog: Negation and Linear Recursion. 286-300
  Electronic Edition (ACM DL) BibTeX
• V. S. Lakshmanan, Alberto O. Mendelzon:
  Inductive Pebble Games and the Expressive Power of Datalog. 301-310
  Electronic Edition (ACM DL) BibTeX
• Stavros S. Cosmadakis:
  On the First-Order Expressibility of Recursive Queries. 311-323
  Electronic Edition (ACM DL) BibTeX

Session 10

• Pratul Dublish, S. N. Maheshwari:
  Expressibility of Bounded-Arity Fixed-Point Query Hierarchies. 324-335
  Electronic Edition (ACM DL) BibTeX
• Zvi M. Kedem, Alexander Tuzhilin:
  Relational Database Behavior: Utilizing Relational Discrete Event Systems and Models. 336-346
  Electronic Edition (ACM DL) BibTeX
• Richard Hull, Jianwen Su:
  Untyped Sets, Invention, and Computable Queries. 347-359
  Electronic Edition (ACM DL) BibTeX

Session 11

• Christophe Lécluse, Philippe Richard:
  Modeling Complex Structures in Object-Oriented Databases. 360-368
  Electronic Edition (ACM DL) BibTeX
• Weidong Chen, David Scott Warren:
  C-Logic of Complex Objects. 369-378
  Electronic Edition (ACM DL) BibTeX
• Michael Kifer, James Wu:
  A Logic for Object-Oriented Logic Programming (Maier's O-Logic Revisited). 379-393
  Electronic Edition (ACM DL) BibTeX
• Alexander Borgida:
  Type Systems for Querying Class Hierarchies with Non-strict Inheritance. 394-400
  Electronic Edition (ACM DL) BibTeX