Relational Models for Tabling Logic Programs in a Database

Authors:
Pedro Costa;Ricardo Rocha;Michel Ferreira
Affiliations:
DCC-FC & LIACC, University of Porto, Portugal;DCC-FC & CRACS, University of Porto, Portugal;DCC-FC & LIACC, University of Porto, Portugal
Venue:
Applications of Declarative Programming and Knowledge Management
Year:
2009

Citing 5
Cited 1

Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
Trie memory

Communications of the ACM
OLD Resolution with Tabulation

Proceedings of the Third International Conference on Logic Programming
Associative-Commutative Discrimination Nets

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
On improving the efficiency and robustness of table storage mechanisms for tabled evaluation

PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages

A Term-Based Global Trie for Tabled Logic Programs

ICLP '09 Proceedings of the 25th International Conference on Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Resolution strategies based on tabling are considered to be particularly effective in Logic Programming. Unfortunately, when faced with applications that compute large and/or many answers, memory exhaustion is a potential problem. In such cases, table deletion is the most common approach to recover space. In this work, we propose a different approach, storing tables into a relational database. Subsequent calls to stored tables import answers from the database, rather than performing a complete re-computation. To validate this approach, we have extended the YapTab tabling system, providing engine support for exporting and importing tables to and from the MySQL RDBMS. Three different relational models for data storage and two recordset retrieval strategies are compared.