Magic-Sets Transformation in Non-Recursive Systems (1992) [6 citations — 2 self]
Download:
|
|
by Ashish Gupta, Inderpal Singh Mumick
In Proceedings of the Eleventh Symposium on Principles of Database Systems (PODS
http://portal.research.bell-labs.com/home/mumick@research/papers/pspapers/pods92EnhancedNrm.ps.Z
Add To MetaCart
Abstract:
The Problem: Most existing database systems (IBM's DB2, for example) do not support recursive queries. SQL is the universal query language amongst relational databases, and the currently implemented SQL standard (SQL2, [ISO90]) does not provide for recursion.
Citations
| 936 | Principles of Database and Knowledge-Base Systems, Volume 1 – Ullman - 1988 |
| 212 | Sato T.: Unfold/Fold Transformations of Logic Programs – Tamaki - 1984 |
| 89 | Modular Stratification and Magic Sets for Datalog Programs with Negation – Ross - 1990 |
| 38 | Rule Ordering in Bottom-up Fixpoint Evaluation of Logic Programs – Ramakrishnan, Srivastava, et al. - 1994 |
| 31 | Magic Sets and Bottom-Up Evaluation of Well-Founded Models – Kemp, Stuckey, et al. - 1991 |
| 30 | Query Optimization in Deductive and Relational Databases – Mumick - 1991 |
| 23 | Data Independent Recursion in Deductive Databases – Naughton - 1986 |
| 19 | K.: Efficient BottomUp Computation of Queries of Stratified Databases – Balbin, Port, et al. - 1991 |
| 19 | Raghu Ramakrishnan. Magic is relevant – Mumick, Finkelstein, et al. - 1990 |
| 17 | Raghu Ramakrishnan. The magic of duplicates and aggregates – Mumick, Pirahesh - 1990 |
| 6 | Iso-ansi working draft: Database language sql2 and sql3; x3h2; iso/iec jtc1/sc21/wg3 – ANSI - 1990 |
