PODS A*

39 papers

YearTitle / Authors
1989A Decision Procedure for Conjunctive Query Disjointness.
Charles Elkan
1989A Logic for Object-Oriented Logic Programming (Maier's O-Logic Revisited).
Michael Kifer, James Wu
1989A Procedural Semantics for Well Founded Negation in Logic Programs.
Kenneth A. Ross
1989A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information.
Li-Yan Yuan, Ding-An Chiang
1989Attribute Agreement.
Y. C. Tay
1989Automata Theory for Database Theoreticans.
Moshe Y. Vardi
1989Bottom-Up Beats Top-Down for Datalog.
Jeffrey D. Ullman
1989C-Logic of Complex Objects.
Weidong Chen, David Scott Warren
1989Can Constant-time Maintainability Be More Practical?
Ke Wang
1989Clustered Multiattribute Hash Files.
Doron Rotem
1989Complexity of Query Processing in Databases with OR-Objects.
Tomasz Imielinski, Kumar V. Vadaparty
1989Concurrency Control of Nested Transactions Accessing B-Trees.
Ada Wai-Chee Fu, Tiko Kameda
1989Declarative Expression of Deductive Database Updates.
Sanjay Manchanda
1989Declustering Using Error Correcting Codes.
Christos Faloutsos, Dimitris N. Metaxas
1989Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model.
Teodor C. Przymusinski
1989Expressibility of Bounded-Arity Fixed-Point Query Hierarchies.
Pratul Dublish, S. N. Maheshwari
1989Fractals for Secondary Key Retrieval.
Christos Faloutsos, Shari Roseman
1989Horn Tables - An Efficient Tool for Handling Incomplete Information in Databases.
Gösta Grahne
1989Hypothetical Datalog: Negation and Linear Recursion.
Anthony J. Bonner
1989Inductive Pebble Games and the Expressive Power of Datalog.
V. S. Lakshmanan, Alberto O. Mendelzon
1989Inference of Monotonicity Constraints in Datalog Programs.
Alexander Brodsky, Yehoshua Sagiv
1989Linearizing Nonlinear Recursions in Polynomial Time.
Yatin P. Saraiya
1989Logic Programming as Constructivism: A Formalization and its Application to Databases.
François Bry
1989Modeling Complex Structures in Object-Oriented Databases.
Christophe Lécluse, Philippe Richard
1989Modular Architectures for Distributed and Database Systems.
Alfred Z. Spector
1989On the First-Order Expressibility of Recursive Queries.
Stavros S. Cosmadakis
1989On the Power of Alexander Templates.
Hirohisa Seki
1989Practical Algorithms for Finding Prime Attributes and Testing Normal Forms.
Heikki Mannila, Kari-Jouko Räihä
1989Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 29-31, 1989, Philadelphia, Pennsylvania, USA
Avi Silberschatz
1989Proof-Tree Transformation Theorems and Their Applications.
Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi
1989Relational Database Behavior: Utilizing Relational Discrete Event Systems and Models.
Zvi M. Kedem, Alexander Tuzhilin
1989Safety of Datalog Queries over Infinite Databases.
Yehoshua Sagiv, Moshe Y. Vardi
1989The Alternating Fixpoint of Logic Programs with Negation.
Allen Van Gelder
1989The Impact of Recovery on Concurrency Control.
William E. Weihl
1989Type Systems for Querying Class Hierarchies with Non-strict Inheritance.
Alexander Borgida
1989Untyped Sets, Invention, and Computable Queries.
Richard Hull, Jianwen Su
1989Updating Databases in the Weak Instance Model.
Paolo Atzeni, Riccardo Torlone
1989Utilization of B-trees with Inserts, Deletes and Modifies.
Theodore Johnson, Dennis E. Shasha
1989Why a Single Parallelization Strategy in not Enough in Knowledge Bases.
Simona Rabinovici-Cohen, Ouri Wolfson