Soft Stratification for Magic Set Based Query Evaluation in Deductive Databases

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn 22, Issue , 2003, Pages 102-110

  Behrend, Andreas ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION; QUERY LANGUAGES; SET THEORY;

DEDUCTIVE DATABASES; RELATIONAL OPTIMIZERS;

DATABASE SYSTEMS;

EID: 1142263343     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773153.773164     Document Type: Conference Paper

References (19)

1. BALBIN, I., MEENAKSHI, K., RAMAMOHANARAO, K.: A Query Independent Method for Magic Set Computation on Stratified Databases. Fifth Generation Computer Systems 1988: 711-718.
2. BALBIN, I., PORT, G. S., RAMAMOHANARAO, K., MEENAKSHI, K.: Efficient Bottom-UP Computation of Queries on Stratified Databases. JLP 11(3&4): 295-344 (1991).
3. BANCILHON, F., MAIER, D., SAGIV, Y., ULLMAN,J. D.: Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986: 1-16.
4. BANCILHON, F., RAMAKRISHNAN, R.: An Amateur's Introduction to Recursive Query Processing Strategies. SIGMOD Conference 1986: 16-52.
5. BEERI, C., RAMAKRISHNAN, R.: On the Power of Magic. JLP 10(1/2/3&4): 255-299 (1991).
6. BEHREND, A.: Efficient Computation of the Well-Founded Model Using Update Propagation. LPAR 2001: 422-437.
7. BRY, F.: Logic Programming as Constructivism: A Formalization and its Application to Databases. PODS 1989: 34-50.
8. GUPTA, A., MUMICK, I. S.: Magic-sets Transformation in Nonrecursive Systems. PODS 1992: 354-367.
9. GRIEFAHN, U.: Reactive Model Computation - A Uniform Approach to the Implementation of Deductive Databases. Dissertation, University of Bonn, 1997.
10. KEMP, D., SRIVASTAVA, D., STUCKEY, P.: Bottom-Up Evaluation and Query Optimization of Well-Founded Models. TCS 146(1 & 2): 145-184 (1995).
11. KERISIT, J.-M., PUGIN, J.-M.: Efficient Query Answering on Stratified Databases. Fifth Generation Computer Systems 1988: 719-726.
12. MUMICK, I. S., FINKELSTEIN, S. J., PIRAHESH, H., RAMAKRISHNAN, R.: Magic is Relevant. SIGMOD Conference 1990: 247-258.
13. NAUGHTON, J. F., RAMAKRISHNAN, R., SAGIV, Y., ULLMAN, J. D.: Efficient Evaluation of Right-, Left-, and Multi-Linear Rules. SIGMOD Conf. 1989: 235-242.
14. NAUGHTON, J. F., RAMAKRISHNAN, R., SAGIV, Y., ULLMAN, J. D.: Argument Reduction by Factoring. TCS 146(1&2): 269-310, 1995.
15. RAMAKRISHNAN, R.: Magic Templates: A Spellbinding Approach to Logic Programs. JLP 11(3&4): 189-216 (1991).
16. ROHMER, J., LESCOEUR, R., KERISIT, J.-M.: The Alexander Method - A Technique for the Processing of Recursive Axioms in Deductive Databases. New Generation Computing 4(3): 273-285 (1986).
17. VAN GELDER, A.: The Alternating Fixpoint of Logic Programs with Negation. PODS 1989: 1-10.
18. VAN GELDER, A.: The Alternating Fixpoint of Logic Programs with Negation. JCSS 47(1): 185-221 (1993).
19. VAN GELDER, A., ROSS, K., SCHLIPF, J.: The Well-Founded Semantics for General Logic Programs. JACM 38(3): 620-650 (1991).