Volume 4, Number 1, March 1979

• 
  Edward Babb: Implementing a Relational Database by Means of Specialized Hardware. 1-29
• 
  Catriel Beeri, Philip A. Bernstein: Computational Problems Related to the Design of Normal Form Relational Schemas. 30-59
• 
  Peter C. Lockemann, Heinrich C. Mayr, Wolfgang H. Weil, Wolfgang H. Wohlleber: Data Abstractions for Database Systems. 60-75
• 
  Dorothy E. Denning, Peter J. Denning, Mayer D. Schwartz: The Tracker: A Threat to Statistical Database Security. 76-96
• 
  David P. Dobkin, Anita K. Jones, Richard J. Lipton: Secure Databases: Protection Against User Influence. 97-106
• 
  William Kent: Limitations of Record-Based Information Models. 107-131

Volume 4, Number 2, June 1979

• 
  S. Bing Yao: Optimization of Query Evaluation Algorithms. 133-155
• 
  Mayer D. Schwartz, Dorothy E. Denning, Peter J. Denning: Linear Queries in Statistical Databases. 156-167
• 
  Alfred V. Aho, Jeffrey D. Ullman: Optimal Partial-Match Retrieval When Fields Are Independently Specified. 168-179
• 
  Robert H. Thomas: A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. 180-209
• 
  Daniel R. Ries, Michael Stonebraker: Locking Granularity Revisited. 210-227
• 
  Walter A. Burkhard: Partial-Match Hash Coding: Benefits of Redundancy. 228-239
• 
  Vijay V. Raghavan, Clement T. Yu: Experiments on the Determination of the Relationships Between Terms. 240-260

Volume 4, Number 3, September 1979

• 
  David K. Hsiao: Michael E. Senko: 1931-1978. 261
• 
  Witold Lipski Jr.: On Semantic Issues Connected with Incomplete Information Databases. 262-296
• 
  Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman: The Theory of Joins in Relational Databases. 297-314
• 
  Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong: Extendible Hashing - A Fast Access Method for Dynamic Files. 315-344
• 
  Chat-Yu Lam, Stuart E. Madnick: Properties of Storage Hierarchy Systems with Multiple Page Sizes and Redundant Data. 345-367
• 
  Peter Buneman, Eric K. Clemons: Efficient Monitoring Relational Databases. 368-382
• 
  Douglas Comer: Heuristics for Trie Index Minimization. 383-395
• 
  Philip A. Bernstein: Errata: Computational Problems Related to the Design of Normal Form Relational Schemas. 396

Volume 4, Number 4, December 1979

• 
  E. F. Codd: Extending the Database Relational Model to Capture More Meaning. 397-434
• 
  Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Efficient Optimization of a Class of Relational Expressions. 435-454
• 
  David Maier, Alberto O. Mendelzon, Yehoshua Sagiv: Testing Implications of Data Dependencies. 455-469
• 
  Barron C. Housel: Pipelining: A Technique for Implementing Data Restructurers. 470-492
• 
  Jonathan E. Shopiro: Theseus - A Programming Language for Relational Databases. 493-517
• 
  Sumiyasu Yamamoto, Shinsei Tazawa, Kazuhiko Ushio, Hideto Ikeda: Design of a Balanced Multiple Valued File Organization Schema with the Least Redundancy. 518-530
• 
  Don S. Batory: On Searching Transposed Files. 531-544
• 
  Philip A. Bernstein, Marco A. Casanova, Nathan Goodman: Comments on "Process Synchronization in Database Systems". 545-546

last updated on Mon May 20 03:42:11 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page