default search action
8th PODS 1989: Philadelphia, Pennsylvania
- Avi Silberschatz:
Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 29-31, 1989, Philadelphia, Pennsylvania, USA. ACM Press 1989, ISBN 0-89791-308-6
Session 1
- Allen Van Gelder:
The Alternating Fixpoint of Logic Programs with Negation. 1-10 - Teodor C. Przymusinski:
Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model. 11-21 - Kenneth A. Ross:
A Procedural Semantics for Well Founded Negation in Logic Programs. 22-33
Session 2
- François Bry:
Logic Programming as Constructivism: A Formalization and its Application to Databases. 34-50 - Tomasz Imielinski, Kumar V. Vadaparty:
Complexity of Query Processing in Databases with OR-Objects. 51-65 - Li-Yan Yuan, Ding-An Chiang:
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information. 66-74 - Gösta Grahne:
Horn Tables - An Efficient Tool for Handling Incomplete Information in Databases. 75-82
Session 3
- Moshe Y. Vardi:
Automata Theory for Database Theoreticans. 83-92 - Sanjay Manchanda:
Declarative Expression of Deductive Database Updates. 93-100 - Paolo Atzeni, Riccardo Torlone:
Updating Databases in the Weak Instance Model. 101-109
Session 4
- Y. C. Tay:
Attribute Agreement. 110-119 - Ke Wang:
Can Constant-time Maintainability Be More Practical? 120-127 - Heikki Mannila, Kari-Jouko Räihä:
Practical Algorithms for Finding Prime Attributes and Testing Normal Forms. 128-133 - Charles Elkan:
A Decision Procedure for Conjunctive Query Disjointness. 134-139
Session 5
- Jeffrey D. Ullman:
Bottom-Up Beats Top-Down for Datalog. 140-149 - Hirohisa Seki:
On the Power of Alexander Templates. 150-159 - Yehoshua Sagiv, Moshe Y. Vardi:
Safety of Datalog Queries over Infinite Databases. 160-171
Session 6
- Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi:
Proof-Tree Transformation Theorems and Their Applications. 172-181 - Yatin P. Saraiya:
Linearizing Nonlinear Recursions in Polynomial Time. 182-189 - Alexander Brodsky, Yehoshua Sagiv:
Inference of Monotonicity Constraints in Datalog Programs. 190-199 - Simona Rabinovici-Cohen, Ouri Wolfson:
Why a Single Parallelization Strategy in not Enough in Knowledge Bases. 200-216
Session 7
- Alfred Z. Spector:
Modular Architectures for Distributed and Database Systems. 217-224 - Doron Rotem:
Clustered Multiattribute Hash Files. 225-234 - Theodore Johnson, Dennis E. Shasha:
Utilization of B-trees with Inserts, Deletes and Modifies. 235-246
Session 8
- Christos Faloutsos, Shari Roseman:
Fractals for Secondary Key Retrieval. 247-252 - Christos Faloutsos, Dimitris N. Metaxas:
Declustering Using Error Correcting Codes. 253-258 - William E. Weihl:
The Impact of Recovery on Concurrency Control. 259-269 - Ada Wai-Chee Fu, Tiko Kameda:
Concurrency Control of Nested Transactions Accessing B-Trees. 270-285
Session 9
- Anthony J. Bonner:
Hypothetical Datalog: Negation and Linear Recursion. 286-300 - V. S. Lakshmanan, Alberto O. Mendelzon:
Inductive Pebble Games and the Expressive Power of Datalog. 301-310 - Stavros S. Cosmadakis:
On the First-Order Expressibility of Recursive Queries. 311-323
Session 10
- Pratul Dublish, S. N. Maheshwari:
Expressibility of Bounded-Arity Fixed-Point Query Hierarchies. 324-335 - Zvi M. Kedem, Alexander Tuzhilin:
Relational Database Behavior: Utilizing Relational Discrete Event Systems and Models. 336-346 - Richard Hull, Jianwen Su:
Untyped Sets, Invention, and Computable Queries. 347-359
Session 11
- Christophe Lécluse, Philippe Richard:
Modeling Complex Structures in Object-Oriented Databases. 360-368 - Weidong Chen, David Scott Warren:
C-Logic of Complex Objects. 369-378 - Michael Kifer, James Wu:
A Logic for Object-Oriented Logic Programming (Maier's O-Logic Revisited). 379-393 - Alexander Borgida:
Type Systems for Querying Class Hierarchies with Non-strict Inheritance. 394-400
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.