| | Symposium on Principles of Database Systems archiveProceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems 1990, Nashville, Tennessee, United States April 02 - 04, 1990 | | | Table of Contents | | | | Research directions in object-oriented database systems Won Kim Pages: 1 - 15 Full text available: Pdf(2.02 MB) | | | | Method schemas Serge Abiteboul, Paris C. Kanellakis, Emmanuel Waller Pages: 16 - 27 Full text available: Pdf(1.19 MB) | | | | Representability of design objects by ancestor-controlled hierarchical specifications Lin Yu, Daniel J. Rosenkrantz Pages: 28 - 39 Full text available: Pdf(1.07 MB) | | | | Query size estimation by adaptive sampling (extended abstract) Richard J. Lipton, Jeffrey F. Naughton Pages: 40 - 46 Full text available: Pdf(773 KB) | | | | Deriving constraints among argument sizes in logic programs (extended abstract) Allen van Gelder Pages: 47 - 60 Full text available: Pdf(1.30 MB) | | | | On the expressive power of datalog: tools and a case study Phokion G. Kolaitis, Moshe Y. Vardi Pages: 61 - 71 Full text available: Pdf(1.13 MB) | | | | Load control for locking: the “half-and-half” approach Michael J. Carey, Sanjay Krishnamurthi, Miron Livny Pages: 72 - 84 Full text available: Pdf(1.50 MB) | | | | Locks with constrained sharing (extended abstract) Divyakant Agrawal, Amr El Abbadi Pages: 85 - 93 Full text available: Pdf(863 KB) | | | | A serialization graph construction for nested transactions Alan Fekete, Nancy Lynch, William E. Weihl Pages: 94 - 108 Full text available: Pdf(2.23 MB) | | | | Multi-level recovery Gerhard Weikum, Christof Hasse, Peter Broessler, Peter Muth Pages: 109 - 123 Full text available: Pdf(1.62 MB) | | | | On the optimality of strategies for multiple joins Y. C. Tay Pages: 124 - 131 Full text available: Pdf(707 KB) | | | | Polynomial-time program transformations in deductive databases Yatin P. Saraiya Pages: 132 - 144 Full text available: Pdf(1.17 MB) | | | | Semigroup techniques in recursive query optimization Thane Plambeck Pages: 145 - 153 Full text available: Pdf(958 KB) | | | | Independence of logic database queries and update Charles Elkan Pages: 154 - 160 Full text available: Pdf(874 KB) | | | | Modular stratification and magic sets for DATALOG programs with negation Kenneth A. Ross Pages: 161 - 171 Full text available: Pdf(1.23 MB) | | | | Three-valued formalization of logic programming: is it needed? Jia-Huai You, Li Yan Yuan Pages: 172 - 182 Full text available: Pdf(1.17 MB) | | | | Backward chaining evaluation in stratified disjunctive theories Véronique Royer Pages: 183 - 195 Full text available: Pdf(1.43 MB) | | | | The expressive powers of the logic programming semantics (extended abstract) John S. Schlipf Pages: 196 - 204 Full text available: Pdf(844 KB) | | | | Stable models and non-determinism in logic programs with negation Domenico Sacca, Carlo Zaniolo Pages: 205 - 217 Full text available: Pdf(1.45 MB) | | | | Non-deterministic languages to express deterministic transformations Serge Abiteboul, Eric Simon, Victor Vianu Pages: 218 - 229 Full text available: Pdf(1.30 MB) | | | | Graph-theoretic methods in database theory Mihalis Yannakakis Pages: 230 - 242 Full text available: Pdf(1.61 MB) | | | | Quasilinear algorithms for processing relational calculus expressions (preliminary report) Dan E. Willard Pages: 243 - 257 Full text available: Pdf(1.86 MB) | | | | On the optimality of disk allocation for Cartesian product files (extended abstract) Khaled A. S. Abdel-Ghaffar, Amr El Abbadi Pages: 258 - 264 Full text available: Pdf(785 KB) | | | | Efficient processing of window queries in the pyramid data structure Walid G. Aref, Hanan Samet Pages: 265 - 272 Full text available: Pdf(883 KB) | | | | A framework for the performance analysis of concurrent B-tree algorithms Theodore Johnson, Dennis Shasha Pages: 273 - 287 Full text available: Pdf(1.46 MB) | | | | Querying constraints Jean-Louis Lassez Pages: 288 - 298 Full text available: Pdf(1.12 MB) | | | | Constraint query languages (preliminary report) Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz Pages: 299 - 313 Full text available: Pdf(1.54 MB) | | | | Magic conditions Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan Pages: 314 - 330 Full text available: Pdf(1.98 MB) | | | | On being optimistic about real-time constraints Jayant R. Haritsa, Michael J. Carey, Miron Livny Pages: 331 - 343 Full text available: Pdf(1.48 MB) | | | | Token transactions: managing fine-grained migration of data Va-On Tam, Meichun Hsu Pages: 344 - 356 Full text available: Pdf(1.26 MB) | | | | Data-valued partitioning and virtual messages (extended abstract) Nandit Soparkar, Abraham Silberschatz Pages: 357 - 367 Full text available: Pdf(1.48 MB) | | | | A novel checkpointing scheme for distributed database systems Slawomir Pilarski, Tiko Kameda Pages: 368 - 378 Full text available: Pdf(1.08 MB) | | | | Polynomial time query processing in temporal deductive databases Jan Chomicki Pages: 379 - 391 Full text available: Pdf(1.30 MB) | | | | Handling infinite temporal data F. Kabanza, J.-M. Stevenne, P. Wolper Pages: 392 - 403 Full text available: Pdf(1.26 MB) | | | | GraphLog: a visual formalism for real life recursion Mariano P. Consens, Alberto O. Mendelzon Pages: 404 - 416 Full text available: Pdf(1.35 MB) | | | | A graph-oriented object database model Marc Gyssens, Jan Paredaens, Dirk van Gucht Pages: 417 - 424 Full text available: Pdf(915 KB) | |
|