Abstract is missing.
- Tools for Datalog BoundednessGerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi. 1-12 [doi]
- On Datalog vs. Polynomial TimeFoto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis. 13-25 [doi]
- On the Power of Rule-Based Languages with SetsKumar V. Vadaparty. 26-36 [doi]
- The Expressiveness of a Family of Finite Set LanguagesNeil Immerman, Sushant Patnaik, David W. Stemple. 37-52 [doi]
- Non-Deterministic Queue OperationsHector Garcia-Molina, Kenneth Salem. 53-62 [doi]
- Bounded Ignorance in Replicated SystemsNarayanan Krishnakumar, Arthur J. Bernstein. 63-74 [doi]
- A Tight Upper Bound on the Benefits of Replication and Consistency Control ProtocolsDonald B. Johnson, Larry Raab. 75-81 [doi]
- Modeling Hot Spots In Database SystemsWei-hsing Wang, Eugene Pinsky, Meichun Hsu. 82-91 [doi]
- Modular Acyclicity and Tail Recursion in Logic ProgramsKenneth A. Ross. 92-101 [doi]
- Structural Query Optimization - A uniform Framework for Semantic Query Optimization in Deductive DatabasesLaks V. S. Lakshmanan, Héctor J. Hernández. 102-114 [doi]
- Detecting Redundant Tuples During Query EvaluationSurajit Chaudhuri. 115-126 [doi]
- Overbound and Right-Linear QueriesInderpal Singh Mumick, Hamid Pirahesh. 127-141 [doi]
- Deductive Databases in ActionShalom Tsur. 142-153 [doi]
- Minimum and Maximum Predicates in Logic ProgrammingSumit Ganguly, Sergio Greco, Carlo Zaniolo. 154-163 [doi]
- Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial ExpansionsGabriel Matsliach. 164-180 [doi]
- Constraint-Based Query Optimization for Spatial DatabasesRichard Helm, Kim Marriott, Martin Odersky. 181-191 [doi]
- Uncoupling Updating and Rebalancing in Chromatic Binary Search TreesOtto Nurmi, Eljas Soisalon-Soininen. 192-198 [doi]
- Mixed-Approach Algorithms for Transitive ClosureHåkan Jakobsson. 199-205 [doi]
- On Negation in HiLogKenneth A. Ross. 206-215 [doi]
- Termination Detection in Logic Programs using Argument SizesKirack Sohn, Allen Van Gelder. 216-226 [doi]
- Inference of Inequality Constraints in Logic ProgramsAlexander Brodsky, Yehoshua Sagiv. 227-240 [doi]
- Parallelizing Datalog Programs by Generalized PivotingJürgen Seib, Georg Lausen. 241-251 [doi]
- Suppressing Marginal Cells to Protect Sensitive Information in a Two-Dimensional Statistical TableFrancesco M. Malvestuto, Marina Moscarini, Maurizio Rafanelli. 252-258 [doi]
- Semantic Complexity of Classes of Relational Queries and Query Independent Data PartitioningShaibal Roy. 259-267 [doi]
- On the Expected Size of Recursive Datalog QueriesS. Seshadri, Jeffrey F. Naughton. 268-279 [doi]
- On the Representation of Infinite Temporal Data and QueriesMarianne Baudinet, Marc Niézette, Pierre Wolper. 280-290 [doi]
- The Expressive Power of Structured Values in Pure OODB sJan Van den Bussche, Jan Paredaens. 291-299 [doi]
- Subtyping in OODB sCatriel Beeri, Tova Milo. 300-314 [doi]
- Tractable Query Languages for Complex Object DatabasesStéphane Grumbach, Victor Vianu. 315-327 [doi]
- On the Equivalence of Database Restructurings Involving Object IdentifiersRichard Hull, Masatoshi Yoshikawa. 328-340 [doi]