Abstract is missing.
- Research Directions in Object-Oriented Database SystemsWon Kim. 1-15 [doi]
- Method SchemasSerge Abiteboul, Paris C. Kanellakis, Emmanuel Waller. 16-27 [doi]
- Representability of Design Objects by Ancestor-Controlled Hierarchical SpecificationsLin Yu, Daniel J. Rosenkrantz. 28-39 [doi]
- Query Size Estimation by Adaptive SamplingRichard J. Lipton, Jeffrey F. Naughton. 40-46 [doi]
- Deriving Constraints Among Argument Sizes in Logic ProgramsAllen Van Gelder. 47-60 [doi]
- On the Expressive Power of Datalog: Tools and a Case StudyPhokion G. Kolaitis, Moshe Y. Vardi. 61-71 [doi]
- Load Control for Locking: The Half-and-Half ApproachMichael J. Carey, Sanjay Krishnamurthi, Miron Livny. 72-84 [doi]
- Locks with Constrained SharingDivyakant Agrawal, Amr El Abbadi. 85-93 [doi]
- A Serialization Graph Construction for Nested TransactionsAlan Fekete, Nancy A. Lynch, William E. Weihl. 94-108 [doi]
- Multi-Level RecoveryGerhard Weikum, Christof Hasse, Peter Brössler, Peter Muth. 109-123 [doi]
- On the Optimality of Strategies for Multiple JoinsY. C. Tay. 124-131 [doi]
- Polynomial-Time Program Transformations in Deductive DatabasesYatin P. Saraiya. 132-144 [doi]
- Semigroup Techniques in Recursive Query OptimizationThane E. Plambeck. 145-153 [doi]
- Independence of Logic Database Queries and UpdatesCharles Elkan. 154-160 [doi]
- Modular Stratification and Magic Sets for DATALOG Programs with NegationKenneth A. Ross. 161-171 [doi]
- Three-Valued Formalization of Logic Programming: Is It Needed?Jia-Huai You, Li-Yan Yuan. 172-182 [doi]
- Backward Chaining Evaluation in Stratified Disjunctive TheoriesVéronique Royer. 183-195 [doi]
- The Expressive Powers of the Logic Programming SemanticsJohn S. Schlipf. 196-204 [doi]
- Stable Models and Non-Determinism in Logic Programs with NegationDomenico Saccà, Carlo Zaniolo. 205-217 [doi]
- Non-Deterministic Languages to Express Deterministic TransformationsSerge Abiteboul, Eric Simon, Victor Vianu. 218-229 [doi]
- Graph-Theoretic Methods in Database TheoryMihalis Yannakakis. 230-242 [doi]
- Quasilinear Algorithms for Processing Relational Calculus ExpressionsDan E. Willard. 243-257 [doi]
- On the Optimality of Disk Allocation for Cartesian Product FilesKhaled A. S. Abdel-Ghaffar, Amr El Abbadi. 258-264 [doi]
- Efficient Processing of Window Queries in The Pyramid Data StructureWalid G. Aref, Hanan Samet. 265-272 [doi]
- A Framework for the Performance Analysis of Concurrent B-tree AlgorithmsTheodore Johnson, Dennis Shasha. 273-287 [doi]
- Querying ConstraintsJean-Louis Lassez. 288-298 [doi]
- Constraint Query LanguagesParis C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz. 299-313 [doi]
- Magic ConditionsInderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan. 314-330 [doi]
- On Being Optimistic about Real-Time ConstraintsJayant R. Haritsa, Michael J. Carey, Miron Livny. 331-343 [doi]
- Token Transactions: Managing Fine-Grained Migration of DataVa-On Tam, Meichun Hsu. 344-356 [doi]
- Data-value Partitioning and Virtual MessagesNandit Soparkar, Abraham Silberschatz. 357-367 [doi]
- A Novel Checkpointing Scheme for Distributed Database SystemsSlawomir Pilarski, Tiko Kameda. 368-378 [doi]
- Polynomial Time Query Processing in Temporal Deductive DatabasesJan Chomicki. 379-391 [doi]
- Handling Infinite Temporal DataFroduald Kabanza, Jean-Marc Stévenne, Pierre Wolper. 392-403 [doi]
- GraphLog: a Visual Formalism for Real Life RecursionMariano P. Consens, Alberto O. Mendelzon. 404-416 [doi]
- A Graph-Oriented Object Database ModelMarc Gyssens, Jan Paredaens, Dirk Van Gucht. 417-424 [doi]