Abstract is missing.
- Optimal Allocation of Resources in Distributed Information NetworksSamy A. Mahmoud, J. Spruce Riordon. [doi]
- Query-by-Example: the Invocation and Definition of Tables and FormsMoshé M. Zloof. 1-24 [doi]
- Semantic Integrity in a Relational Data Base SystemMichael Hammer, Dennis McLeod. 25-47 [doi]
- Functional Specifications of Subsystem for Database IntegrityKapali P. Eswaran, Donald D. Chamberlin. 48-68 [doi]
- The Use of Cluster Analysis in Physical Data Base DesignJeffrey A. Hoffer, Dennis G. Severance. 69-86 [doi]
- Data Models for Secondary Storage RepresentationsAllen Reiter. 87-119 [doi]
- Stanford s Generalized Database SystemJ. R. Schroeder, W. C. Kiefer, Richard L. Guertin, W. J. Berman. 120-143 [doi]
- Using Semantic Networks for Database ManagementNick Roussopoulos, John Mylopoulos. 144-172 [doi]
- The Enity-Relationship Model: Toward a Unified View of DataPeter P. Chen. 173 [doi]
- Restructuring for Large Data Bases: Three Levels of AbstractionShamkant B. Navathe, James P. Fry. 174 [doi]
- On the Feasibility of Implementing a Large Relational Data Base with Optimal Performance on a Mini-ComputerGlenn K. Manacher. 175-201 [doi]
- A Multi-Level Architecture for Relational Data Base SystemsHans Albrecht Schmid, Philip A. Bernstein. 202-226 [doi]
- Automating Logical File DesignGeorge U. Hubbard, Norman Raver. 227-253 [doi]
- A Data Base Management Facility for Automatic Generation of Data Base ManagersDavid W. Stemple. 254 [doi]
- Selection of File Organization Using an Analytic ModelS. Bing Yao, Alan G. Merten. 255-267 [doi]
- Definition and Evaluation of Access Rules in Data Management SystemsEduardo B. Fernández, Rita C. Summers, Tomás Lang. 268-285 [doi]
- Automatic Data Base Schema Design and OptimizationMichael F. Mitoma, Keki B. Irani. 286-321 [doi]
- Hierarchical Performance Analysis Models for Data Base SystemsIsao Miyamoto. 322-352 [doi]
- Optimal Choice of Data Restructuring PointsLeon E. Winslow, J.-C. Lee. 353-363 [doi]
- Needed: Distributed ControlPaul G. Comba. 364-375 [doi]
- Database Experience in the Netherlands PTT (ITCIS)G. R. Karsner. 376-404 [doi]
- A Computer Architecture for Large (Distributed) Data BasesRichard Peebles, Eric G. Manning. 405-427 [doi]
- Granularity of Locks in a Large Shared Data BaseJim Gray, Raymond A. Lorie, Gianfranco R. Putzolu, Irving L. Traiger. 428-451 [doi]
- On the Encipherment of Search Trees and Random Access FilesRudolf Bayer, J. K. Metzger. 452 [doi]
- The Design of a Rotating Associative Array Memory for a Relational Database Management ApplicationChyuan Shiun Lin, Diane C. P. Smith, John Miles Smith. 453-455 [doi]
- CASSM: A Cellular System for Very Large Data BasesStanley Y. W. Su, G. Jack Lipovski. 456-472 [doi]
- Estimating Response Time for Auxiliary Memory Configuartions with Multiple Movable-Head Disk ModulesKenneth Omahen. 473-495 [doi]
- A DBMS for the U.S. Bureo of the CensusWalter E. Simonson, William T. Alsbrooks. 496-498 [doi]
- Using Large Data Bases for Interactive Problem SolvingEric D. Carlson. 499-501 [doi]
- Analyzing Transaction Activity to a Large Data Base: An Empirical StudyRichard D. Hackathorn. 502-504 [doi]
- Multiple Concurrent UpdatesLucia C. Sekino. 505-507 [doi]
- An Optimizable Model for Application of Rollback/Restart/Recovery Procedures for Large Data BasesJames C. Browne, G. L. Lasseter. 508-510 [doi]
- An Experiment in Dedicated Data ManagementH. C. Heacox, E. S. Cosloy, J. B. Cohen. 511-513 [doi]
- Analysis of VSAM s Free-Space BehaviorY. H. Chin. 514-515 [doi]
- Reorganization Points for File Designs with Nonlinear Processing CostsK. Sundar Das, Toby J. Teorey, S. Bing Yao. 516-518 [doi]
- Query Execution and Index Selection for Relational Data BasesGilles Farley, Stewart A. Schuster. 519 [doi]
- Hardware and System Architecture for a Very Large DatabaseRobert Healey, Bradford Heckman. 520-522 [doi]
- Partial-Match Queries and File DesignsWalter A. Burkhard. 523-525 [doi]
- Recent Results on the Attribute Based Data Model - A TutorialDouglas S. Kerr. 526-528 [doi]
- On the Implementation of a Logical Data Base ConverterArie Shoshani, K. Brandon. 529-531 [doi]
- Features of a Conceptual SchemaDennis Tsichritzis. 532-534 [doi]
- Different Views of a Data Base: Coexistence between Network Model and Relational ModelKlaus Zimmerman. 535-537 [doi]
- Multi-Level Data Model in DPLS - Database, Dynamic Program Control & Open-Ended Pol SupportMasaaki Tsubaki. 538-539 [doi]
- Binary Search Tree Complex - Towards the Implementation of RelationsY. Edmund Lien, Carl E. Taylor, James R. Driscoll, Mark L. Reynolds. 540-542 [doi]
- File Directory Design Considerations for Distributed Data BasesWesley W. Chu, E. Nahouraii. 543-545 [doi]
- Design Principles of a Data Base System for Unlimited Quantities of Data with Highly Complex StructuresG. Dathe, K.-H. Dreckmann, G. Henselmann. 546-548 [doi]
- An Experimental VM/370 Based Information SystemJohn J. Donovan, Rafael Fessel, Stuart G. Greenberg, Louis M. Gutentag. 549-553 [doi]
- PRTV: An Efficient Implementation for Large Relational Data BasesStephen Todd. 554-556 [doi]
- Specification of Stored Data Structures and Desired Output Results in DIAM II with FORALMichael E. Senko. 557-571 [doi]
- Keyword Access to a Mass Storage Device at the Record LevelFredric C. Gey, Marilyn M. Mantei. 572-588 [doi]
- Implementation Strategies for the Census Data BaseJay-Louise Weldon. 589-590 [doi]
- Datalanguage: The Access Language on the DatacomputerJeffrey M. Hill. 591-592 [doi]