default search action
9th PODS 1990: Nashville, Tennessee
- Daniel J. Rosenkrantz, Yehoshua Sagiv:
Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee, USA. ACM Press 1990, ISBN 0-89791-352-3
Session 1
- Won Kim:
Research Directions in Object-Oriented Database Systems. 1-15 - Serge Abiteboul, Paris C. Kanellakis, Emmanuel Waller:
Method Schemas. 16-27 - Lin Yu, Daniel J. Rosenkrantz:
Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications. 28-39
Session 2
- Richard J. Lipton, Jeffrey F. Naughton:
Query Size Estimation by Adaptive Sampling. 40-46 - Allen Van Gelder:
Deriving Constraints Among Argument Sizes in Logic Programs. 47-60 - Phokion G. Kolaitis, Moshe Y. Vardi:
On the Expressive Power of Datalog: Tools and a Case Study. 61-71
Session 3
- Michael J. Carey, Sanjay Krishnamurthi, Miron Livny:
Load Control for Locking: The 'Half-and-Half' Approach. 72-84 - Divyakant Agrawal, Amr El Abbadi:
Locks with Constrained Sharing. 85-93 - Alan D. Fekete, Nancy A. Lynch, William E. Weihl:
A Serialization Graph Construction for Nested Transactions. 94-108 - Gerhard Weikum, Christof Hasse, Peter Brössler, Peter Muth:
Multi-Level Recovery. 109-123
Session 4
- Y. C. Tay:
On the Optimality of Strategies for Multiple Joins. 124-131 - Yatin P. Saraiya:
Polynomial-Time Program Transformations in Deductive Databases. 132-144 - Thane E. Plambeck:
Semigroup Techniques in Recursive Query Optimization. 145-153 - Charles Elkan:
Independence of Logic Database Queries and Updates. 154-160
Session 5
- Kenneth A. Ross:
Modular Stratification and Magic Sets for DATALOG Programs with Negation. 161-171 - Jia-Huai You, Li-Yan Yuan:
Three-Valued Formalization of Logic Programming: Is It Needed? 172-182 - Véronique Royer:
Backward Chaining Evaluation in Stratified Disjunctive Theories. 183-195
Session 6
- John S. Schlipf:
The Expressive Powers of the Logic Programming Semantics. 196-204 - Domenico Saccà, Carlo Zaniolo:
Stable Models and Non-Determinism in Logic Programs with Negation. 205-217 - Serge Abiteboul, Eric Simon, Victor Vianu:
Non-Deterministic Languages to Express Deterministic Transformations. 218-229
Session 7
- Mihalis Yannakakis:
Graph-Theoretic Methods in Database Theory. 230-242 - Dan E. Willard:
Quasilinear Algorithms for Processing Relational Calculus Expressions. 243-257
Session 8
- Khaled A. S. Abdel-Ghaffar, Amr El Abbadi:
On the Optimality of Disk Allocation for Cartesian Product Files. 258-264 - Walid G. Aref, Hanan Samet:
Efficient Processing of Window Queries in The Pyramid Data Structure. 265-272 - Theodore Johnson, Dennis E. Shasha:
A Framework for the Performance Analysis of Concurrent B-tree Algorithms. 273-287
Session 9
- Jean-Louis Lassez:
Querying Constraints. 288-298 - Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz:
Constraint Query Languages. 299-313 - Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan:
Magic Conditions. 314-330
Session 10
- Jayant R. Haritsa, Michael J. Carey, Miron Livny:
On Being Optimistic about Real-Time Constraints. 331-343 - Va-On Tam, Meichun Hsu:
Token Transactions: Managing Fine-Grained Migration of Data. 344-356 - Nandit Soparkar, Abraham Silberschatz:
Data-value Partitioning and Virtual Messages. 357-367 - Slawomir Pilarski, Tiko Kameda:
A Novel Checkpointing Scheme for Distributed Database Systems. 368-378
Session 11
- Jan Chomicki:
Polynomial Time Query Processing in Temporal Deductive Databases. 379-391 - Froduald Kabanza, Jean-Marc Stévenne, Pierre Wolper:
Handling Infinite Temporal Data. 392-403 - Mariano P. Consens, Alberto O. Mendelzon:
GraphLog: a Visual Formalism for Real Life Recursion. 404-416 - Marc Gyssens, Jan Paredaens, Dirk Van Gucht:
A Graph-Oriented Object Database Model. 417-424
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.