Avi Silberschatz
Proceedings of the Eighth Symposium on Principles of Database Systems
PODS-1989, 1989.

@proceedings{PODS-1989,
	acmid         = "73721",
	address       = "Philadelphia, Pennsylvania, USA",
	editor        = "Avi Silberschatz",
	isbn          = "0-89791-308-6",
	publisher     = "{ACM Press}",
	title         = "{Proceedings of the Eighth Symposium on Principles of Database Systems}",
	year          = 1989,
}

Contents (38 items)

11 ×#database
8 ×#query
5 ×#datalog
5 ×#logic programming
3 ×#fixpoint
3 ×#recursion
3 ×#source code
2 ×#algorithm
2 ×#clustering
2 ×#concurrent

PODS-1989-Gelder #fixpoint #logic programming #source code

The Alternating Fixpoint of Logic Programs with Negation (AVG), pp. 1–10.

PODS-1989-Przymusinski #fixpoint #logic programming

Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model (TCP), pp. 11–21.

PODS-1989-Ross #logic programming #semantics #source code

A Procedural Semantics for Well Founded Negation in Logic Programs (KAR), pp. 22–33.

PODS-1989-Bry #database #formal method #logic programming

Logic Programming as Constructivism: A Formalization and its Application to Databases (FB), pp. 34–50.

PODS-1989-ImielinskiV #complexity #database #query

Complexity of Query Processing in Databases with OR-Objects (TI, KVV), pp. 51–65.

PODS-1989-YuanC #algorithm #database #evaluation #query #relational

A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information (LYY, DAC), pp. 66–74.

PODS-1989-Grahne #database #performance

Horn Tables — An Efficient Tool for Handling Incomplete Information in Databases (GG), pp. 75–82.

PODS-1989-Vardi #automaton #database

Automata Theory for Database Theoreticans (MYV), pp. 83–92.

PODS-1989-Manchanda #database #declarative #deduction

Declarative Expression of Deductive Database Updates (SM), pp. 93–100.

PODS-1989-AtzeniT #database

Updating Databases in the Weak Instance Model (PA, RT), pp. 101–109.

PODS-1989-Tay

Attribute Agreement (YCT), pp. 110–119.

PODS-1989-Wang #maintenance #question

Can Constant-time Maintainability Be More Practical? (KW), pp. 120–127.

PODS-1989-MannilaR #algorithm #normalisation #testing

Practical Algorithms for Finding Prime Attributes and Testing Normal Forms (HM, KJR), pp. 128–133.

PODS-1989-Elkan #query

A Decision Procedure for Conjunctive Query Disjointness (CE), pp. 134–139.

PODS-1989-Ullman #bottom-up #datalog #top-down

Bottom-Up Beats Top-Down for Datalog (JDU), pp. 140–149.

PODS-1989-Seki #on the #power of

On the Power of Alexander Templates (HS), pp. 150–159.

PODS-1989-SagivV #database #datalog #infinity #query #safety

Safety of Datalog Queries over Infinite Databases (YS, MYV), pp. 160–171.

PODS-1989-RamakrishnanSUV #program transformation #theorem

Proof-Tree Transformation Theorems and Their Applications (RR, YS, JDU, MYV), pp. 172–181.

PODS-1989-Saraiya #polynomial #recursion

Linearizing Nonlinear Recursions in Polynomial Time (YPS), pp. 182–189.

PODS-1989-BrodskyS #constraints #datalog #source code

Inference of Monotonicity Constraints in Datalog Programs (AB, YS), pp. 190–199.

PODS-1989-CohenW #knowledge base #parallel #why

Why a Single Parallelization Strategy in not Enough in Knowledge Bases (SRC, OW), pp. 200–216.

PODS-1989-Spector #architecture #composition #database #distributed

Modular Architectures for Distributed and Database Systems (AZS), pp. 217–224.

PODS-1989-Rotem #clustering #multi

Clustered Multiattribute Hash Files (DR), pp. 225–234.

PODS-1989-JohnsonS

Utilization of B-trees with Inserts, Deletes and Modifies (TJ, DS), pp. 235–246.

PODS-1989-FaloutsosR #retrieval

Fractals for Secondary Key Retrieval (CF, SR), pp. 247–252.

PODS-1989-FaloutsosM #clustering #fault #using

Declustering Using Error Correcting Codes (CF, DNM), pp. 253–258.

PODS-1989-Weihl #concurrent

The Impact of Recovery on Concurrency Control (WEW), pp. 259–269.

PODS-1989-FuK #concurrent #transaction

Concurrency Control of Nested Transactions Accessing B-Trees (AWCF, TK), pp. 270–285.

PODS-1989-Bonner #datalog #linear #recursion

Hypothetical Datalog: Negation and Linear Recursion (AJB), pp. 286–300.

PODS-1989-LakshmananM #datalog #game studies #induction #power of

Inductive Pebble Games and the Expressive Power of Datalog (VSL, AOM), pp. 301–310.

PODS-1989-Cosmadakis #first-order #on the #query #recursion

On the First-Order Expressibility of Recursive Queries (SSC), pp. 311–323.

PODS-1989-DublishM #bound #fixpoint #query

Expressibility of Bounded-Arity Fixed-Point Query Hierarchies (PD, SNM), pp. 324–335.

PODS-1989-KedemT #behaviour #database #modelling #relational

Relational Database Behavior: Utilizing Relational Discrete Event Systems and Models (ZMK, AT), pp. 336–346.

PODS-1989-HullS #query #set

Untyped Sets, Invention, and Computable Queries (RH, JS), pp. 347–359.

PODS-1989-LecluseR #database #modelling #object-oriented

Modeling Complex Structures in Object-Oriented Databases (CL, PR), pp. 360–368.

PODS-1989-ChenW

C-Logic of Complex Objects (WC, DSW), pp. 369–378.

PODS-1989-KiferW #logic programming #object-oriented

A Logic for Object-Oriented Logic Programming (Maier’s O-Logic Revisited) (MK, JW), pp. 379–393.

PODS-1989-Borgida #inheritance #query #strict #type system

Type Systems for Querying Class Hierarchies with Non-strict Inheritance (AB), pp. 394–400.