13. PODS 1994: Minneapolis, Minnesota

@proceedings{DBLP:conf/pods/94,
  title     = {Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium
               on Principles of Database Systems, May 24-26, 1994, Minneapolis,
               Minnesota},
  publisher = {ACM Press},
  year      = {1994},
  isbn      = {0-89791-642-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Talk

• David Harel:
  Will I be Pretty, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering (Summary). 1-3
  

Access Methods & Sampling

• Christos Faloutsos, Ibrahim Kamel:
  Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension. 4-13
  
• Peter J. Haas, Jeffrey F. Naughton, Arun N. Swami:
  On the Relative Cost of Sampling for Join Selectivity Estimation. 14-24
  
• Sridhar Ramaswamy, Sairam Subramanian:
  Path Caching: A Technique for Optimal External Searching. 25-35
  
• Ling Tony Chen, Doron Rotem:
  Optimal Response Time Retrieval of Replicated Data. 36-44
  

Constraints

• Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom:
  Constraint Checking with Partial Information. 45-55
  
• Peter J. Stuckey, S. Sudarshan:
  Compiling Query Constraints. 56-67
  
• Kirack Sohn:
  Constraints among Argument Sizes in Logic Programs. 68-74
  

Data Mining

• Rakesh Agrawal:
  Tutorial Database Mining. 75-76
  
• Jyrki Kivinen, Heikki Mannila:
  The Power of Sampling in Knowledge Discovery. 77-85
  

Datalog

• Surajit Chaudhuri, Phokion G. Kolaitis:
  Can Datalog be Approximated? 86-96
  
• Foto N. Afrati:
  Bounded Arity Datalog (!=) Queries on Graphs. 97-106
  
• Surajit Chaudhuri, Moshe Y. Vardi:
  On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs. 107-116
  

File Structures & Concurrency

• Kien A. Hua, Sheau-Dong Lang, Wen K. Lee:
  A Decomposition-Based Simulated Annealing Technique for Data Clustering. 117-128
  
• Gustavo Alonso, Divyakant Agrawal, Amr El Abbadi:
  Reducing Recovery Constraints on Locking based Protocols. 129-138
  
• Divyakant Agrawal, John L. Bruno, Amr El Abbadi, Vashudha Krishnaswamy:
  Relative Serializbility: An Approach for Relaxing the Atomicity of Transactions. 139-149
  

Collection Types I

• Val Tannen:
  Tutorial: Languages for Collection Types. 150-154
  
• Leonid Libkin, Limsoon Wong:
  New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions. 155-166
  

Collection Types II

• Dan Suciu, Val Tannen:
  A Query Language for NC. 167-178
  
• Latha S. Colby, Edward L. Robertson, Lawrence V. Saxton, Dirk Van Gucht:
  A Query Language for List-Based Complex Objects. 179-189
  
• Inderpal Singh Mumick, Oded Shmueli:
  Universal Finiteness and Satisfiability. 190-200
  

Query Languages and Complexity

• Dan Suciu, Jan Paredaens:
  Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure. 201-209
  
• Sushant Patnaik, Neil Immerman:
  Dyn-FO: A Parallel, Dynamic Complexity Class. 210-221
  
• Gerd G. Hillebrand, Paris C. Kanellakis:
  Functional Database Query Languages as Typed Lambda Calculi of Fixed Order. 222-231
  

Object-Oriented Databases

• Alberto O. Mendelzon, Tova Milo, Emmanuel Waller:
  Object Migration. 232-242
  
• Diego Calvanese, Maurizio Lenzerini:
  Making Object-Oriented Schemas More Expressive. 243-254
  
• Atsushi Ohori, Keishi Tajima:
  A Polymorphic Calculus for Views and Object Sharing. 255-266
  

Incomplete and Spatial Databases

• Thomas Eiter, Georg Gottlob, Heikki Mannila:
  Adding Disjunction to Datalog. 267-278
  
• Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht:
  Towards a Theory of Spatial Database Queries. 279-288
  
• Stéphane Grumbach, Jianwen Su:
  Finitely Representable Databases. 289-300
  

Text Databases

• Gaston H. Gonnet:
  Tutorial: Text Dominated Databases, Theory Practice and Experience. 301-302
  
• Gösta Grahne, Matti Nykänen, Esko Ukkonen:
  Reasoning about Strings in Databases. 303-312