More efficient datalog queries: subsumptive tabling beats magic sets

K. Tuncay Tekle, Yanhong A. Liu. More efficient datalog queries: subsumptive tabling beats magic sets. In Timos K. Sellis, Renée J. Miller, Anastasios Kementsietsidis, Yannis Velegrakis, editors, Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, Athens, Greece, June 12-16, 2011. pages 661-672, ACM, 2011. [doi]

@inproceedings{TekleL11,
  title = {More efficient datalog queries: subsumptive tabling beats magic sets},
  author = {K. Tuncay Tekle and Yanhong A. Liu},
  year = {2011},
  doi = {10.1145/1989323.1989393},
  url = {http://doi.acm.org/10.1145/1989323.1989393},
  tags = {magic sets, Datalog},
  researchr = {https://researchr.org/publication/TekleL11},
  cites = {0},
  citedby = {0},
  pages = {661-672},
  booktitle = {Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, Athens, Greece, June 12-16, 2011},
  editor = {Timos K. Sellis and Renée J. Miller and Anastasios Kementsietsidis and Yannis Velegrakis},
  publisher = {ACM},
  isbn = {978-1-4503-0661-4},
}