DBTAB: a Relational Storage Model for the YapTab Tabling System

Pedro Costa, Ricardo Rocha and Michel Ferreira

August 2006

---

Abstract

Resolution strategies based on tabling have proved to be particularly effective in logic programs. However, when tabling is used for applications that store large answers and/or a huge number of answers, we can quickly run out of memory. In general, to recover space, we will have no choice but to delete some of the tables. In this work, we propose an alternative approach and instead of deleting tables, we store them externally using a relational database system. Subsequent calls to stored tables would import answers from the database, hence avoiding re-computation. To validate our approach, we have extended the YapTab tabling system to provide engine support for exporting and importing tables to and from the MySQL relational database management system.

Bibtex

@InProceedings{costa-ciclops06,
  author =    {P. Costa and R. Rocha and M. Ferreira},
  title =     {{DBTAB: a Relational Storage Model for the YapTab Tabling System}},
  booktitle = {Proceedings of the 6th Colloquium on Implementation of Constraint and LOgic Programming 
               Systems (CICLOPS 2006)},
  pages =     {95--109},
  editor =    {E. Pontelli and Hai-Feng Guo},
  month =     {August},
  year =      {2006},
  address =   {Seattle, Washington, USA},
}

Download Paper

PDF file

Download Slides

PDF file