10. PODS 1991: Denver, Colorado

Query Language Power and Complexity

• Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi:
  Tools for Datalog Boundedness. 1-12
  
• Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis:
  On Datalog vs. Polynomial Time. 13-25
  
• Kumar V. Vadaparty:
  On the Power of Rule-Based Languages with Sets. 26-36
  
• Neil Immerman, Sushant Patnaik, David W. Stemple:
  The Expressiveness of a Family of Finite Set Languages. 37-52
  

Transaction Processing

• Hector Garcia-Molina, Kenneth Salem:
  Non-Deterministic Queue Operations. 53-62
  
• Narayanan Krishnakumar, Arthur J. Bernstein:
  Bounded Ignorance in Replicated Systems. 63-74
  
• Donald B. Johnson, Larry Raab:
  A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols. 75-81
  
• Wei-hsing Wang, Eugene Pinsky, Meichun Hsu:
  Modeling Hot Spots In Database Systems. 82-91
  

Recursive Query Processing

• Kenneth A. Ross:
  Modular Acyclicity and Tail Recursion in Logic Programs. 92-101
  
• Laks V. S. Lakshmanan, Héctor J. Hernández:
  Structural Query Optimization - A uniform Framework for Semantic Query Optimization in Deductive Databases. 102-114
  
• Surajit Chaudhuri:
  Detecting Redundant Tuples During Query Evaluation. 115-126
  
• Inderpal Singh Mumick, Hamid Pirahesh:
  Overbound and Right-Linear Queries. 127-141
  

Deductive Databases

• Shalom Tsur:
  Deductive Databases in Action. 142-153
  
• Sumit Ganguly, Sergio Greco, Carlo Zaniolo:
  Minimum and Maximum Predicates in Logic Programming. 154-163
  

Data Structures and Algorithms

• Gabriel Matsliach:
  Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions. 164-180
  
• Richard Helm, Kim Marriott, Martin Odersky:
  Constraint-Based Query Optimization for Spatial Databases. 181-191
  
• Otto Nurmi, Eljas Soisalon-Soininen:
  Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. 192-198
  
• Håkan Jakobsson:
  Mixed-Approach Algorithms for Transitive Closure. 199-205
  

Logic Programming and Databases

• Kenneth A. Ross:
  On Negation in HiLog. 206-215
  
• Kirack Sohn, Allen Van Gelder:
  Termination Detection in Logic Programs using Argument Sizes. 216-226
  
• Alexander Brodsky, Yehoshua Sagiv:
  Inference of Inequality Constraints in Logic Programs. 227-240
  
• Jürgen Seib, Georg Lausen:
  Parallelizing Datalog Programs by Generalized Pivoting. 241-251
  

Statistics, Queries, and Time

• Francesco M. Malvestuto, Marina Moscarini, Maurizio Rafanelli:
  Suppressing Marginal Cells to Protect Sensitive Information in a Two-Dimensional Statistical Table. 252-258
  
• Shaibal Roy:
  Semantic Complexity of Classes of Relational Queries and Query Independent Data Partitioning. 259-267
  
• S. Seshadri, Jeffrey F. Naughton:
  On the Expected Size of Recursive Datalog Queries. 268-279
  
• Marianne Baudinet, Marc Niézette, Pierre Wolper:
  On the Representation of Infinite Temporal Data and Queries. 280-290
  

Object-Oriented Databases I

• Jan Van den Bussche, Jan Paredaens:
  The Expressive Power of Structured Values in Pure OODB's. 291-299
  
• Catriel Beeri, Tova Milo:
  Subtyping in OODB's. 300-314
  

Object-Oriented Databases II

• Stéphane Grumbach, Victor Vianu:
  Tractable Query Languages for Complex Object Databases. 315-327
  
• Richard Hull, Masatoshi Yoshikawa:
  On the Equivalence of Database Restructurings Involving Object Identifiers. 328-340
  

Last update Fri May 25 08:32:45 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page