Relational Models for Tabling Logic Programs in a Database

• Type: Article in International Conference Proceedings Book
• Date: 2009

Authors

Pedro Costa (Author) FEUP; Ricardo Rocha (Author) FCUP; Michel Ferreira (Author) FCUP

Conference proceedings International

Title: APPLICATIONS OF DECLARATIVE PROGRAMMING AND KNOWLEDGE MANAGEMENT

Pages: 99-116

17th International Conference on Applications of Declarative Programming and Knowledge Management/21st Workshop on Logic Programming

Wurzburg, GERMANY, OCT 04-06, 2007

Indexing

ISI Web of Knowledge - 1 Citation

Scopus - 1 Citation

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-003-P44

DOI: 10.1007/978-3-642-00675-3_7

Abstract (EN): 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 18