On Improving the Efficiency and Robustness of Table Storage Mechanisms for Tabled Evaluation

Ricardo Rocha

January 2007

---

Abstract

Most of the recent proposals in tabling technology were designed as a means to improve some practical deficiencies of current tabling execution models that reduce their applicability in particular applications. The discussion we address in this paper was also motivated by practical deficiencies we encountered, in particular, on the table storage mechanisms used for tabling support. To improve such mechanisms, we propose two new implementation techniques that make tabling models more efficient when dealing with incomplete tables and more robust when recovering memory from the table space. To validate our proposals, we have implemented them in the YapTab tabling system as an elegant extension of the original design.

Bibtex

@InProceedings{rocha-padl07,
  author =    {R. Rocha},
  title =     {{On Improving the Efficiency and Robustness of Table Storage Mechanisms for Tabled Evaluation}},
  booktitle = {Proceedings of the 9th International Symposium on Practical Aspects of Declarative
               Languages (PADL 2007)},
  pages =     {155--169},
  number =    {4354},
  series =    {LNCS},
  publisher = {Springer},
  editor =    {M. Hanus},
  month =     {January},
  year =      {2007},
  address =   {Nice, France},
}

Download Paper

PDF file
Springer

Download Slides

PDF file