Magic Sets algorithm

From Wikipedia, the free encyclopedia

Magic Sets is the name of a query transformation algorithm for processing recursive queries written in Datalog.

[edit] References

  • Francois Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D Ullman. Magic sets and other strange ways to implement logic programs (extended abstract). Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, March 24-26, 1986, Cambridge, Massachusetts.
Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.