One Table Fits All

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

Authors

Jorge Costa (Author) Other; Ricardo Rocha (Author) FCUP

Conference proceedings International

Title: PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES

Pages: 195-208

11th International Symposium on Practical Aspects of Declarative Languages

Savannah, GA, JAN 19-20, 2009

Indexing

ISI Web of Knowledge - 3 Citations

Scopus - 3 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-003-RQN

DOI: 10.1007/978-3-540-92995-6_14

Abstract (EN): Tabling is all implementation technique that overcomes some limitations of traditional Prolog systems in dealing with redundant sub-computations and recursion. The performance of tabled evaluation largely depends on the implementation of the table space. Arguably, the most successful data structure for tabling is tries. However, while tries are efficient for variant based tabled evaluation, they are limited ill their ability to recognize and represent repeated answers for different calls. In this paper, we propose a new design for the table space where tabled subgoal calls and/or answers are stored only once in a common global trie instead of being spread over several different tries. Our preliminary experiments using the YapTab tabling system show very promising reductions on memory usage.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 14