ACM Transactions on Database Systems (TODS) , Volume 9

Volume 9, Number 1, March 1984

• S. Jerrold Kaplan:
  Designing a Portable Natural Language Database Query System. 1-19
  
• Steven P. Reiss:
  Practical Data-Swapping: The First Steps. 20-37
  
• Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik:
  The Grid File: An Adaptable, Symmetric Multikey File Structure. 38-71
  
• Jack R. Buchanan, Richard D. Fennell, Hanan Samet:
  A Database Management System for the Federal Courts. 72-88
  
• Christos H. Papadimitriou, Paris C. Kanellakis:
  On Concurrency Control by Multiple Versions. 89-99
  
• Roger K. Shultz, Roy J. Zingg:
  Response Time Analysis of Multiprocessor Computers for Database Support. 100-132
  
• Patrick Valduriez, Georges Gardarin:
  Join and Semijoin Algorithms for a Multiprocessor Database Machine. 133-161
  

Volume 9, Number 2, June 1984

• Stavros Christodoulakis:
  Implications of Certain Assumptions in Database Performance Evaluation. 163-186
  
• Wolfgang Effelsberg, Mary E. S. Loomis:
  Logical, Internal, and Physical Reference Behavior in CODASYL Database Systems. 187-213
  
• Won Kim, Daniel Gajski, David J. Kuck:
  A Parallel Pipelined Relational Query Processor. 214-242
  
• M. Al-Suwaiyel, Ellis Horowitz:
  Algorithms for Trie Compaction. 243-263
  
• Alberto O. Mendelzon:
  Database States and Their Tableaux. 264-282
  
• David Maier, Jeffrey D. Ullman, Moshe Y. Vardi:
  On the Foundations of the Universal Relation Model. 283-308
  
• Hirofumi Katsuno:
  An Extension of Conflict-Free Multivalued Dependency Sets. 309-326
  

Volume 9, Number 3, September 1984

• Henry F. Korth, Gabriel M. Kuper, Joan Feigenbaum, Allen Van Gelder, Jeffrey D. Ullman:
  System/U: A Database System Based on the Universal Relation Assumption. 331-347
  
• Joseph A. Wald, Paul G. Sorenson:
  Resolving the Query Inference Problem Using Steiner Trees. 348-368
  
• Kotagiri Ramamohanarao, Ron Sacks-Davis:
  Recursive Linear Hashing. 369-391
  
• Robert B. Cooper, Martin K. Solomon:
  The Average Time Until Bucket Overflow. 392-408
  
• Salvatore T. March, Gary D. Scudder:
  On the Selection of Efficient Record Segmentations and Backup Strategies for Large Shared Databases. 409-438
  
• Udi Manber, Richard E. Ladner:
  Concurrency Control In a Dynamic Search Structure. 439-455
  
• Susan B. Davidson:
  Optimism and Consistency In Partitioned Distributed Database Systems. 456-481
  
• Toshihide Ibaraki, Tiko Kameda:
  On the Optimal Nesting Order for Computing N-Relational Joins. 482-502
  

Volume 9, Number 4, December 1984

• Klaus Elhardt, Rudolf Bayer:
  A Database Cache for High Performance and Fast Restart in Database Systems. 503-525
  
• Andreas Reuter:
  Performance Analysis of Recovery Techniques. 526-559
  
• Wolfgang Effelsberg, Theo Härder:
  Principles of Database Buffer Management. 560-595
  
• Philip A. Bernstein, Nathan Goodman:
  An Algorithm for Concurrency Control and Recovery in Replicated Distributed Databases. 596-615
  
• Wen-Chin Chen, Jeffrey Scott Vitter:
  Analysis of New Variants of Coalesced Hashing. 616-645
  
• Jitender S. Deogun, Vijay V. Raghavan, Thomas K. W. Tsou:
  Organization of Clustered Files for Consecutive Retrieval. 646-671
  
• Joseph F. Traub, Yechiam Yemini, Henryk Wozniakowski:
  The Statistical Security of a Statistical Database. 672-679
  
• Shamkant B. Navathe, Stefano Ceri, Gio Wiederhold, Jinglie Dou:
  Vertical Partitioning Algorithms for Database Design. 680-710