Abstract is missing.
- On the Recognition and Design of Acyclic DatabasesAlessandro D Atri, Marina Moscarini. 1-8 [doi]
- Dependency Characterizations for Acyclic Database SchemesGösta Grahne, Kari-Jouko Räihä. 9-18 [doi]
- Properties of Database Schemata with Functional DependenciesDomenico Saccà, F. Manfredi, A. Mecchia. 19-28 [doi]
- Functional and Inclusion Dependencies: A Graph Theoretic ApproachStavros S. Cosmadakis, Paris C. Kanellakis. 29-37 [doi]
- Maximal Concurrency by LockingGeorg Lausen, Eljas Soisalon-Soininen, Peter Widmayer. 38-44 [doi]
- Concurrency Control in Graph Protocols by Using Edge LocksGael N. Buckley, Abraham Silberschatz. 45-50 [doi]
- Concurrency Control Mechanisms and the Serializability of Concurrent Tree AlgorithmsRay Ford, Jim Calhoun. 51-60 [doi]
- Is Byzantine Agreement Useful in a Distributed Database?Hector Garcia-Molina, Frank M. Pittelli, Susan B. Davidson. 61-69 [doi]
- Conceptual-To-Internal Mappings in Commercial Database SystemsDon S. Batory. 70-78 [doi]
- Synapse Approach to Database RecoveryKee S. Ong. 79-85 [doi]
- A New Approach to Database LogicGabriel M. Kuper, Moshe Y. Vardi. 86-96 [doi]
- Relative Information Capacity of Simple Relational Database SchemataRichard Hull. 97-109 [doi]
- Formal Data Base Specification - An Eclectic PerspectiveMarco A. Casanova, Paulo A. S. Veloso, Antonio L. Furtado. 110-118 [doi]
- IFO: A Formal Semantic Database ModelSerge Abiteboul, Richard Hull. 119-132 [doi]
- On the Cyclic to Acyclic Scheme Transformation and Solving Cyclic QueriesZ. Meral Özsoyoglu, Elarbi Choukhmane. 133-142 [doi]
- On the Decomposition of Join DependenciesMarc Gyssens, Jan Paredaens. 143-152 [doi]
- Using Semiouterjoins to Process Queries in Multidatabase SystemsHai-Yann Hwang, Umeshwar Dayal, Mohamed G. Gouda. 153-162 [doi]
- Canonical View Update Support through Boolean Algebras of ComponentsStephen J. Hegner. 163-173 [doi]
- Index Maintenance for Non-Uniform Record DistributionsWalter A. Burkhard. 173-179 [doi]
- A Class of Data Structures for Associative SearchingJack A. Orenstein, T. H. Merrett. 181-190 [doi]
- Non First Normal Form Relations to Represent Hierarchical Organized DataSerge Abiteboul, Nicole Bidoit. 191-200 [doi]
- On Relational Algebra with Marked NullsWitold Lipski Jr.. 201-203 [doi]
- The Temporal Query Language TQuelRichard T. Snodgrass. 204-213 [doi]
- Object Projection Views in the Dynamic Relational ModelVictor Vianu. 214-220 [doi]
- On the Equivalence of Logical DatabasesGabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi. 221-228 [doi]
- An Enhanced Inference Mechanism for Generating Relational Algebra QueriesHaruo Yokota, Susumu Kunifuji, Takeo Kakuta, Nobuyoshi Miyazaki, Shigeki Shibayama, Kunio Murakami. 229-238 [doi]
- A Transportable Natural Language Database Update SystemSharon C. Salveter. 239-247 [doi]
- Specification and Verification of Abstract Database TypesDavid W. Stemple, Tim Sheard. 248-257 [doi]
- On Lossless Transformation of Database Schemes not Necessarily Satisfying Universal Instance AssumptionTomasz Imielinski, Nicolas Spyratos. 258-265 [doi]
- Weak Multivalued DependenciesPatrick C. Fischer, Dirk Van Gucht. 266-274 [doi]
- Querying Weak InstancesMihalis Yannakakis. 275-280 [doi]
- On the Complexity and Axiomatizability of Consistent Database StatesMarc H. Graham, Moshe Y. Vardi. 281-289 [doi]
- Increasing Availability in Partitioned Database SystemsDale Skeen, David D. Wright. 290-299 [doi]
- Reliable Scheduling of Database Transactions for Unreliable SystemsMarc H. Graham, Nancy D. Griffeth, Barbara Smith-Thomas. 300-310 [doi]
- A Mean Value Performance Model for Locking in Databases: The Waiting CaseY. C. Tay, Rajan Suri, Nathan Goodman. 311-322 [doi]
- Towards a Theory of Online SchedulersKari-Jouko Räihä, Henry Tirri. 323-332 [doi]