default search action
ACM Transactions on Database Systems (TODS) , Volume 21
Volume 21, Number 1, March 1996
- Elena Baralis, Stefano Ceri, Stefano Paraboschi:
Modularization Techniques for Active Rules Design. 1-29 - Peter Buneman, Atsushi Ohori:
Polymorphism and Type Inference in Database Programming. 30-76 - Wai Yin Mok, Yiu-Kai Ng, David W. Embley:
A Normal Form for Precisely Characterizing Redundancy in Nested Relations. 77-106 - Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan:
Magic Conditions. 107-155
Volume 21, Number 2, June 1996
- Ling Liu, Robert Meersman:
The Building Blocks for Specifying Communication Behavior of Complex Objects: An Activity-Driven Approach. 157-207 - Kenneth A. Ross:
Tail Recursion Elimination in Deductive Databases. 208-237 - Colin Bell, Anil Nerode, Raymond T. Ng, V. S. Subrahmanian:
Implementing Deductive Databases by Mixed Integer Programming. 238-269 - Sha Guo, Wei Sun, Mark Allen Weiss:
Solving Satisfiability and Implication Problems in Database Systems. 270-293
Volume 21, Number 3, September 1996
- Paolo Ciaccia, Paolo Tiberio, Pavel Zezula:
Declustering of Key-Based Partitioned Signature Files. 295-338 - Debabrata Dey, Sumit Sarkar:
A Probabilistic Relational Model and Algebra. 339-369 - Shahram Ghandeharizadeh, Richard Hull, Dean Jacobs:
Heraclitus: Elevating Deltas to be First-Class Citizens in a Database Programming Language. 370-426
Volume 21, Number 4, December 1996
- Dean Kuo:
Model and Verification of a Data Manager Based on ARIES. 427-479 - Witold Litwin, Marie-Anne Neimat, Donovan A. Schneider:
LH* - A Scalable, Distributed Data Structure. 480-525 - Louiqa Raschid, Jorge Lobo:
Semantics for Update Rule Programs and Implementations in a Relational Database Management System. 526-571
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.