ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Magic Sets and Other Strange Ways to Implement Logic Programs.

François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman: Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986: 1-15
@inproceedings{DBLP:conf/pods/BancilhonMSU86,
  author    = {Fran\c{c}ois Bancilhon and
               David Maier and
               Yehoshua Sagiv and
               Jeffrey D. Ullman},
  title     = {Magic Sets and Other Strange Ways to Implement Logic Programs},
  booktitle = {Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles
               of Database Systems, March 24-26, 1986, Cambridge, Massachusetts},
  publisher = {ACM},
  year      = {1986},
  isbn      = {0-89791-179-2},
  pages     = {1-15},
  ee        = {http://doi.acm.org/10.1145/6012.15399, db/conf/pods/BancilhonMSU86.html},
  crossref  = {DBLP:conf/pods/86},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

Several methods for implementing database queries expressed as logical rules are given and they are compared for efficiency. One method, called "magic sets," is a general algorithm for rewriting logical rules so that they may be implemented bottom-up (= forward chaining) in a way that cuts down on the irrelevant facts that are generated. The advantage of this scheme is that by working bottom-up, we can take advantage of efficient methods for doing massive joins. Two other methods are ad hoc ways of implementing "linear" rules, i.e., rules where at most one predicate in any body is recursive. These methods are introduced not only because they could be the right way to implement certain queries, but because they illustrate the difficulty of proving anything concrete about optimal ways to evaluate queries.

Copyright © 1986 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98. and ... Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings. and ... BibTeX

Printed Edition

Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 24-26, 1986, Cambridge, Massachusetts. ACM 1986, ISBN 0-89791-179-2
Contents BibTeX

Online Edition: ACM Digital Library

References

[Bancilhon 1985a]
...
[Bancilhon 1985b]
...
[Brough and Walker 1984]
Derek R. Brough, Adrian Walker: Some Practical Properties of Logic Programming Interpreters. FGCS 1984: 149-156 BibTeX
[Gallaire and Minker 1978]
...
[Lozinskii 1984]
...
[Maier 1983]
David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
Contents BibTeX
[Maier and Warren 1985]
...
[McKay and Shapiro 1981]
...
[Pereira and Warren 1983]
...
[Porter 1985]
...
[Sagiv and Ullman 1984]
...
[Ullman 1982]
Jeffrey D. Ullman: Principles of Database Systems, 2nd Edition. Computer Science Press 1982, ISBN 0-914894-36-6
BibTeX
[Ullman 1985]
Jeffrey D. Ullman: Implementation of Logical Query Languages for Databases. ACM Trans. Database Syst. 10(3): 289-321(1985) BibTeX
[Van Gelder 1985]
Allen Van Gelder: A Message Passing Framework for Logical Query Evaluation. SIGMOD Conference 1986: 155-165 BibTeX

Referenced by

  1. Richard T. Snodgrass, Serge Abiteboul, Sophie Cluet, Michael J. Franklin, Guy M. Lohman, David B. Lomet, Gultekin Özsoyoglu, Raghu Ramakrishnan, Kenneth A. Ross, Timos K. Sellis, Patrick Valduriez: Reminiscences on Influential Papers. SIGMOD Record 28(1): 110-114(1999)
  2. Raghu Ramakrishnan: Review - Magic Sets and Other Strange Ways to Implement Logic Programs. ACM SIGMOD Digital Review 1: (1999)
  3. Stavros S. Cosmadakis: Inherent Complexity of Recursive Queries (Extended Abstract). PODS 1999: 148-154
  4. Jia Liang Han: Optimizing Relational Queries in Connection Hypergraphs: Nested Queries, Views, and Binding Propagations. VLDB J. 7(1): 1-11(1998)
  5. David B. Kemp, Kotagiri Ramamohanarao: Efficient Recursive Aggregation and Negation in Deductive Databases. IEEE Trans. Knowl. Data Eng. 10(5): 727-745(1998)
  6. Sergio Greco: Binding Propagation in Disjunctive Databases. VLDB 1998: 287-298
  7. Surajit Chaudhuri: An Overview of Query Optimization in Relational Systems. PODS 1998: 34-43
  8. Chien-Le Goh, Masahiko Tsukamoto, Shojiro Nishio: Fast Methods with Magic Sampling for Knowledge Discovery in Deductive Databases with Large Deduction Results. ER Workshops 1998: 14-28
  9. Nicola Leone, Pasquale Rullo, Antonella Mecchia, Giuseppe Rossi: A Deductive Environment for Dealing with Objects and Nonmonotonic Reasoning. IEEE Trans. Knowl. Data Eng. 9(4): 539-558(1997)
  10. Serge Abiteboul, Victor Vianu: Regular Path Queries with Constraints. PODS 1997: 122-133
  11. David B. Kemp, Thomas Conway, Evan P. Harris, Fergus Henderson, Kotagiri Ramamohanarao, Zoltan Somogyi: Database Transactions in a Purely Declarative Logic Programming Language. DASFAA 1997: 283-292
  12. Yangjun Chen: Speeding up the Counting Method by Computing Heritage Functions in Topological Order. ADBIS 1997: 108-116
  13. Kenneth A. Ross: Tail Recursion Elimination in Deductive Databases. ACM Trans. Database Syst. 21(2): 208-237(1996)
  14. Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan: Magic Conditions. ACM Trans. Database Syst. 21(1): 107-155(1996)
  15. Colin Bell, Anil Nerode, Raymond T. Ng, V. S. Subrahmanian: Implementing Deductive Databases by Mixed Integer Programming. ACM Trans. Database Syst. 21(2): 238-269(1996)
  16. Ismail H. Toroslu, Ghassan Z. Qadah: The Strong Partial Transitive-Closure Problem: Algorithms and Performance Evaluation. IEEE Trans. Knowl. Data Eng. 8(4): 617-629(1996)
  17. Chien-Le Goh, Masahiko Tsukamoto, Shojiro Nishio: Knowledge Discovery in Deductive Databases with Large Deduction Results: the First Step. IEEE Trans. Knowl. Data Eng. 8(6): 952-956(1996)
  18. Praveen Seshadri, Joseph M. Hellerstein, Hamid Pirahesh, T. Y. Cliff Leung, Raghu Ramakrishnan, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan: Cost-Based Optimization for Magic: Algebra and Implementation. SIGMOD Conference 1996: 435-446
  19. Jiawei Han: Chain-Split Evaluation in Deductive Databases. IEEE Trans. Knowl. Data Eng. 7(2): 261-273(1995)
  20. Jan Chomicki, David Toman: Implementing Temporal Integrity Constraints Using an Active DBMS. IEEE Trans. Knowl. Data Eng. 7(4): 566-582(1995)
  21. Piero A. Bonatti, Sarit Kraus, V. S. Subrahmanian: Foundations of Secure Deductive Databases. IEEE Trans. Knowl. Data Eng. 7(3): 406-422(1995)
  22. Sergio Greco, Luigi Palopoli, Eugenio Spadafora: DatalogA: Array Manipulations in a Deductive Database Language. DASFAA 1995: 180-188
  23. Johann Eder: View Definitions with Parameters. ADBIS 1995: 170-184
  24. Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
    Contents
  25. Jayen Vaghani, Kotagiri Ramamohanarao, David B. Kemp, Zoltan Somogyi, Peter J. Stuckey, Tim S. Leask, James Harland: The Aditi Deductive Database System. VLDB J. 3(2): 245-288(1994)
  26. Kotagiri Ramamohanarao, James Harland: An Introduction to Deductive Database Languages and Systems. VLDB J. 3(2): 107-122(1994)
  27. Werner Kießling, Helmut Schmidt, Werner Strauß, Gerhard Dünzinger: DECLARE and SDS: Early Efforts to Commercialize Deductive Database Technology. VLDB J. 3(2): 211-243(1994)
  28. Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan: Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs. IEEE Trans. Knowl. Data Eng. 6(4): 501-517(1994)
  29. Jiawei Han: Constraint-Based Query Evaluation in Deductive Databases. IEEE Trans. Knowl. Data Eng. 6(1): 96-107(1994)
  30. Keh-Chang Guh, Clement T. Yu: Efficient Query Processing for a Subset of Linear Recursive Binary Rules. IEEE Trans. Knowl. Data Eng. 6(5): 842-849(1994)
  31. Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv: Query Optimization by Predicate Move-Around. VLDB 1994: 96-107
  32. Inderpal Singh Mumick, Hamid Pirahesh: Implementation of Magic-sets in a Relational Database System. SIGMOD Conference 1994: 103-114
  33. Joseph M. Hellerstein: Practical Predicate Placement. SIGMOD Conference 1994: 325-335
  34. Peter J. Stuckey, S. Sudarshan: Compiling Query Constraints. PODS 1994: 56-67
  35. Zoltan Somogyi, David B. Kemp, James Harland, Kotagiri Ramamohanarao: Subsumption-Free Bottom-up Evaluation of Logic Programs with Partially Instantiated Data Structures. EDBT 1994: 59-72
  36. Wolfgang Nejdl, Stefano Ceri, Gio Wiederhold: Evaluating Recursive Queries in Distributed Databases. IEEE Trans. Knowl. Data Eng. 5(1): 104-121(1993)
  37. Maurice A. W. Houtsma, Annita N. Wilschut, Jan Flokstra: Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA/DB. VLDB 1993: 206-217
  38. Weidong Chen, David Scott Warren: Query Evaluation under the Well Founded Semantics. PODS 1993: 168-179
  39. Ismail H. Toroslu, Ghassan Z. Qadah: The Efficient Computation of Strong Partial Transitive-Closures. ICDE 1993: 530-537
  40. Jiawei Han, Kangsheng Zeng, Tong Lu: Normalization of Linear Recursions in Deductive Databases. ICDE 1993: 559-567
  41. Yangjun Chen: A Bottom-up Query Evaluation Method for Stratified Databases. ICDE 1993: 568-575
  42. Guozhu Dong, Jianwen Su: First-Order Incremental Evaluation of Datalog Queries. DBPL 1993: 295-308
  43. Sergio Greco: Optimization of Chain Queries. DASFAA 1993: 261-268
  44. Cheong Youn, Hyoung-Joo Kim, Lawrence J. Henschen, Jiawei Han: Classification and Compilation of Linear Recursive Queries in Deductive Databases. IEEE Trans. Knowl. Data Eng. 4(1): 52-67(1992)
  45. Keh-Chang Guh, Clement T. Yu: Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments. IEEE Trans. Knowl. Data Eng. 4(4): 371-381(1992)
  46. Sergio Greco, Nicola Leone, Pasquale Rullo: COMPLEX: An Object-Oriented Logic Programming System. IEEE Trans. Knowl. Data Eng. 4(4): 344-359(1992)
  47. Colin Bell, Anil Nerode, Raymond T. Ng, V. S. Subrahmanian: Implementing Deductive Databases by Linear Programming. PODS 1992: 283-292
  48. Håkan Jakobsson: On Materializing Views and On-Line Queries. ICDT 1992: 407-420
  49. Guozhu Dong, Rodney W. Topor: Incremental Evaluation of Datalog Queries. ICDT 1992: 282-296
  50. Serge Abiteboul, Allen Van Gelder: Optimizing Active Databases using the Split Technique. ICDT 1992: 171-187
  51. Jiawei Han: Chain-Split Evaluation in Deductive Databases. ICDE 1992: 376-384
  52. Jiawei Han: Compilation-Based List Processing in Deductive Databases. EDBT 1992: 104-119
  53. Sergio Greco, Carlo Zaniolo: Optimization of Linear Logic Programs Using Counting Methods. EDBT 1992: 72-87
  54. S. Sudarshan, Raghu Ramakrishnan: Aggregation and Relevance in Deductive Databases. VLDB 1991: 501-511
  55. S. Seshadri, Jeffrey F. Naughton: On the Expected Size of Recursive Datalog Queries. PODS 1991: 268-279
  56. Beat Wüthrich: Semantic Improvement of Deductive Databases. MFDBS 1991: 216-229
  57. Jayen Vaghani, Kotagiri Ramamohanarao, David B. Kemp, Zoltan Somogyi, Peter J. Stuckey: Design Overview of the Aditi Deductive Database System. ICDE 1991: 240-247
  58. Béatrice Finance, Georges Gardarin: A Rule-Based Query Rewriter in an Extensible DBMS. ICDE 1991: 248-256
  59. Kotagiri Ramamohanarao: The Aditi Deductive Database System (Extented Abstract). DASFAA 1991: 201-208
  60. Sang Ho Lee, Lawrence J. Henschen: Evaluation of Extended Recursive Queries in Deductive Databases. DASFAA 1991: 209-215
  61. Burkhard Freitag, Heribert Schütz, Günther Specht: LOLA - A Logic Language for Deductive Databases and its Implementation. DASFAA 1991: 216-225
  62. Yves Caseau: The LAURE Model for Object-Oriented Logic Databases. DASFAA 1991: 411-420
  63. Weining Zhang, Clement T. Yu, Daniel Troy: Necessary and Sufficient Conditions to Linearize Double Recursive Programs in Logic Databases. ACM Trans. Database Syst. 15(3): 459-482(1990)
  64. Michael Kifer, Eliezer L. Lozinskii: On Compile-Time Query Optimization in Deductive Databases by Means of Static Filtering. ACM Trans. Database Syst. 15(3): 385-426(1990)
  65. Danette Chimenti, Ruben Gamboa, Ravi Krishnamurthy, Shamim A. Naqvi, Shalom Tsur, Carlo Zaniolo: The LDL System Prototype. IEEE Trans. Knowl. Data Eng. 2(1): 76-90(1990)
  66. Peter T. Wood: Factoring Augmented Regular Chain Programs. VLDB 1990: 255-263
  67. Jeffrey F. Naughton, Raghu Ramakrishnan: How to Forget the Past Without Repeating It. VLDB 1990: 278-289
  68. Inderpal Singh Mumick, Hamid Pirahesh, Raghu Ramakrishnan: The Magic of Duplicates and Aggregates. VLDB 1990: 264-277
  69. Juhani Kuittinen, Otto Nurmi, Seppo Sippu, Eljas Soisalon-Soininen: Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries. VLDB 1990: 372-379
  70. David B. Kemp, Kotagiri Ramamohanarao, Zoltan Somogyi: Right-, left- and multi-linear rule transformations that maintain context information. VLDB 1990: 380-391
  71. Yatin P. Saraiya: Hard Problems for Simple Logic Programs. SIGMOD Conference 1990: 64-73
  72. Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan: Magic is Relevant. SIGMOD Conference 1990: 247-258
  73. Mihalis Yannakakis: Graph-Theoretic Methods in Database Theory. PODS 1990: 230-242
  74. Yatin P. Saraiya: Polynomial-Time Program Transformations in Deductive Databases. PODS 1990: 132-144
  75. Véronique Royer: Backward Chaining Evaluation in Stratified Disjunctive Theories. PODS 1990: 183-195
  76. Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan: Magic Conditions. PODS 1990: 314-330
  77. Seppo Sippu, Eljas Soisalon-Soininen: Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization. ICDT 1990: 485-498
  78. Maurice A. W. Houtsma, Peter M. G. Apers, Stefano Ceri: Complex Transitive Closure Queries on a Fragmented Graph. ICDT 1990: 470-484
  79. Carlo Zaniolo: Deductive Databases - Theory Meets Practice. EDBT 1990: 1-15
  80. Yuki Kusumi, Shojiro Nishio, Toshiharu Hasegawa: File Access Level Optimization Using Page Access Graph on Recursive Query Evaluation. EDBT 1990: 136-152
  81. Danette Chimenti, Ruben Gamboa, Ravi Krishnamurthy: Abstract Machine for LDL. EDBT 1990: 153-168
  82. Stefano Ceri, Georg Gottlob, Letizia Tanca: What you Always Wanted to Know About Datalog (And Never Dared to Ask). IEEE Trans. Knowl. Data Eng. 1(1): 146-166(1989)
  83. Rakesh Agrawal, Premkumar T. Devanbu: Moving Selections into Linear Least Fixpoint Queries. IEEE Trans. Knowl. Data Eng. 1(4): 424-432(1989)
  84. Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman: Argument Reduction by Factoring. VLDB 1989: 173-182
  85. Guy Hulin: Parallel Processing of Recursive Queries in Distributed Architectures. VLDB 1989: 87-96
  86. Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman: Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. SIGMOD Conference 1989: 235-242
  87. Laura M. Haas, Johann Christoph Freytag, Guy M. Lohman, Hamid Pirahesh: Extensible Query Processing in Starburst. SIGMOD Conference 1989: 377-388
  88. Hirohisa Seki: On the Power of Alexander Templates. PODS 1989: 150-159
  89. Yatin P. Saraiya: Linearizing Nonlinear Recursions in Polynomial Time. PODS 1989: 182-189
  90. Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi: Proof-Tree Transformation Theorems and Their Applications. PODS 1989: 172-181
  91. Simona Rabinovici-Cohen, Ouri Wolfson: Why a Single Parallelization Strategy in not Enough in Knowledge Bases. PODS 1989: 200-216
  92. François Bry: Logic Programming as Constructivism: A Formalization and its Application to Databases. PODS 1989: 34-50
  93. W. Yan, Nelson Mendonça Mattos: Transitive Closure and the LOGA+-Strategy for its Efficient Evaluation. MFDBS 1989: 415-428
  94. Nikolaus Steger, Helmut Schmidt, Ulrich Güntzer, Werner Kießling: Semantics and Efficient Compilation for Quantitative Deductive Databases. ICDE 1989: 660-669
  95. Hussien Aly, Z. Meral Özsoyoglu: Synchronized Counting Method. ICDE 1989: 366-373
  96. Serge Abiteboul, Stéphane Grumbach, Agnès Voisard, Emmanuel Waller: An Extensible Rule-Based Language with Complex Objects and data-Functions. DBPL 1989: 298-314
  97. Jai Hyoung Rhee, Seog Park: An Extension of Counting Method for Efficient Processing of the Cyclic Data. DASFAA 1989: 320-326
  98. Runping Qi, Wolfgang Bibel: A Framework for the Parallel Evaluation of Recursive Queries in Deductive Databases. DASFAA 1989: 301-309
  99. Shojiro Nishio, Masatsugu Nakahata, Eric G. Manning: A New Recursive Query Evaluation Strategy Using Search History Information. DASFAA 1989: 310-319
  100. Wo-Shun Luk, Simon Mok: A Comparison of I/O Performance of Some Linear Recursive Query Processing Methods. DASFAA 1989: 293-300
  101. Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
    Contents
  102. Christophe de Maindreville, Eric Simon: Modelling Non Deterministic Queries and Updates in Deductive Databases. VLDB 1988: 395-406
  103. Eliezer L. Lozinskii: Computing Facts in Non-Horn Deductive Systems. VLDB 1988: 273-279
  104. Ravi Krishnamurthy, Shamim A. Naqvi: Towards a Real Horn Clause Language. VLDB 1988: 252-263
  105. Cheong Youn, Lawrence J. Henschen, Jiawei Han: Classification of Recursive Formulas in Deductive Databases. SIGMOD Conference 1988: 320-328
  106. Ouri Wolfson, Abraham Silberschatz: Distributed Processing of Logic Programs. SIGMOD Conference 1988: 329-336
  107. Raja Ramnarayan, Hongjun Lu: A Data/Knowledge Base Management Testbed and Experimental Results on Data/Knowledge Base Query and Update Processing. SIGMOD Conference 1988: 387-395
  108. Jeffrey F. Naughton: Compiling Separable Recursions. SIGMOD Conference 1988: 312-319
  109. Ravi Krishnamurthy, Raghu Ramakrishnan, Oded Shmueli: A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract). SIGMOD Conference 1988: 154-163
  110. Jeffrey D. Ullman, Moshe Y. Vardi: The Complexity of Ordering Subgoals. PODS 1988: 74-81
  111. Raghu Ramakrishnan, Catriel Beeri, Ravi Krishnamurthy: Optimizing Existential Datalog Queries. PODS 1988: 89-102
  112. Shamim A. Naqvi, Ravi Krishnamurthy: Database Updates in Logic Programming. PODS 1988: 251-262
  113. Katherine A. Morris: An Algorithm for Ordering Subgoals in NAIL! PODS 1988: 82-88
  114. Ramsey W. Haddad, Jeffrey F. Naughton: Counting Methods for Cyclic Relations. PODS 1988: 333-340
  115. Kyu-Young Whang, Stephen Brady: A Framework for Optimization in Expert System - DBMS Interface. ICDE 1988: 126-133
  116. Seppo Sippu, Eljas Soisalon-Soininen: An Optimization Strategy for Recursive Queries in Logic Databases. ICDE 1988: 470-477
  117. Sanggoo Lee, Jiawei Han: Semantic Query Optimization in Recursive Databases. ICDE 1988: 444-451
  118. Rakesh Agrawal, Premkumar T. Devanbu: Moving Selections into Linear Least Fixpoint Queries. ICDE 1988: 452-461
  119. Ravi Krishnamurthy, Carlo Zaniolo: Optimization in a Logic Based Language for Knowledge and Data Intensive Applications. EDBT 1988: 16-33
  120. Jiawei Han, Ghassan Z. Qadah, Chinying Chaou: The Processing and Evaluation of Transitive Closure Queries. EDBT 1988: 49-75
  121. Serge Abiteboul, Stéphane Grumbach: COL: A Logic-Based Language for Complex Objects. EDBT 1988: 271-293
  122. Kyu-Young Whang, Shamkant B. Navathe: An Extended Disjunctive Normal Form Approach for Optimizing Recursive Logic Queries in Loosely Coupled Environments. VLDB 1987: 275-287
  123. Wolfgang Nejdl: Recursive Strategies for Answering Recursive Queries - The RQA/FQI Strategy. VLDB 1987: 43-50
  124. Georges Gardarin: Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs. VLDB 1987: 21-30
  125. Stefano Ceri, Letizia Tanca: Optimization of Systems of Algebraic Equations for Evaluating Datalog Queries. VLDB 1987: 31-41
  126. Weining Zhang, Clement T. Yu: A Necessary Condition for a Doubly Recursive Rule to be Equivalent to a Linear Recursive Rule. SIGMOD Conference 1987: 345-356
  127. Domenico Saccà, Carlo Zaniolo: Magic Counting Methods. SIGMOD Conference 1987: 49-59
  128. H. V. Jagadish, Rakesh Agrawal, Linda Ness: A Study of Transitive Closure As a Recursion Mechanism. SIGMOD Conference 1987: 331-344
  129. Yannis E. Ioannidis, Eugene Wong: Query Optimization by Simulated Annealing. SIGMOD Conference 1987: 9-22
  130. Jiawei Han, Lawrence J. Henschen: Handling Redundancy in the Processing of Recursive Database Queries. SIGMOD Conference 1987: 73-81
  131. Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood: A Graphical Query Language Supporting Recursion. SIGMOD Conference 1987: 323-330
  132. Hussien Aly, Z. Meral Özsoyoglu: Non-deterministic Modelling of Logical Queries in Deductive Databases. SIGMOD Conference 1987: 60-72
  133. Yehoshua Sagiv: Optimizing Datalog Programs. PODS 1987: 349-362
  134. Jeffrey F. Naughton: One-Sided Recursions. PODS 1987: 340-348
  135. Alberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà: Worst-case Complexity Analysis of Methods for Logic Query Implementation. PODS 1987: 294-301
  136. Gabriel M. Kuper: Logic Programming With Sets. PODS 1987: 11-20
  137. Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen: Efficient Evaluation for a Subset of Recursive Queries. PODS 1987: 284-293
  138. Catriel Beeri, Raghu Ramakrishnan: On the Power of Magic. PODS 1987: 269-284
  139. Catriel Beeri, Shamim A. Naqvi, Raghu Ramakrishnan, Oded Shmueli, Shalom Tsur: Sets and Negation in a Logic Database Language (LDL1). PODS 1987: 21-37
  140. Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan: Bounds on the Propagation of Selection into Logic Programs. PODS 1987: 214-226
  141. Krzysztof R. Apt, Jean-Marc Pugin: Maintenance of Stratified Databases Viewed as a Belief Revision System. PODS 1987: 136-145
  142. Clement T. Yu, Weining Zhang: Efficient Recursive Query Processing using Wavefront Methods. ICDE 1987: 652-657
  143. Michael Kifer, Eliezer L. Lozinskii: Implementing Logic Programs as a Database System. ICDE 1987: 375-385
  144. G. Barbara Demo: Recursive Versus Iterative Schemes for Least Fix Point Computation in Logic Databases. ICDE 1987: 130-137
  145. Shamim A. Naqvi, Ravi Krishnamurthy: Semantics of Updates in Logic Programming. DBPL 1987: 313-327
  146. Ravi Krishnamurthy, Carlo Zaniolo: Control and Optimization Strategies in the Implementation of LDL. DBPL 1987: 329-345
  147. Serge Abiteboul, Stéphane Grumbach: COL: A Logic-Based Language for Complex Objects. DBPL 1987: 347-374
  148. Shalom Tsur, Carlo Zaniolo: LDL: A Logic-Based Data Language. VLDB 1986: 33-41
  149. Charles Kellogg, Anthony B. O'Hare, Larry Travis: Optimizing the Rule-Data Interface in a KMS. VLDB 1986: 42-51
  150. Yannis E. Ioannidis: On the Computation of the Transitive Closure of Relational Operators. VLDB 1986: 403-411
  151. Stefano Ceri, Georg Gottlob, Luigi Lavazza: Translation and Optimization of Logic Queries: The Algebraic Approach. VLDB 1986: 395-402
  152. Georges Gardarin, Christophe de Maindreville: Evaluation of Database Recursive Logic Programs as Recurrent Function Series. SIGMOD Conference 1986: 177-186
  153. François Bancilhon, Raghu Ramakrishnan: An Amateur's Introduction to Recursive Query Processing Strategies. SIGMOD Conference 1986: 16-52
  154. Domenico Saccà, Carlo Zaniolo: On the Implementation of a Simple Class of Logic Queries for Databases. PODS 1986: 16-23
  155. Jeffrey F. Naughton: Data Independent Recursion in Deductive Databases. PODS 1986: 267-279
  156. Domenico Saccà, Carlo Zaniolo: The Generalized Counting Method for Recursive Logic Queries. ICDT 1986: 31-53
  157. Michael Kifer, Eliezer L. Lozinskii: Filtering Data Flow in Deductive Databases. ICDT 1986: 186-202
  158. Paris C. Kanellakis: Logic Programming and Parallel Complexity. ICDT 1986: 1-30
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:33:48 2009