A Term-Based Global Trie for Tabled Logic Programs

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

Authors

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

Conference proceedings International

Title: LOGIC PROGRAMMING

Pages: 205-219

25th International Conference on Logic Programming (ICLP)

Pasadena, CA, JUL 14-17, 2009

Indexing

ISI Web of Knowledge - 2 Citations

Scopus - 2 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-003-R7B

DOI: 10.1007/978-3-642-02846-5_20

Abstract (EN): A critical component in the implementation of an efficient tabling system is the design of the data structures and algorithms to access and manipulate tabled data. Arguably, the most successful data structure for tabling is tries. However, when used in applications that pose many queries and/or have a large number of answers, tabling call build arbitrarily many and/or very large tables, quickly filling Lip memory. In this paper, we propose a new design for the table space organization where all terms in tabled subgoal calls and tabled answers are represented only once in a common global trie instead of being spread over several different trie data structures. Our initial experiments using the YapTab tabling system show significant reductions oil memory usage without compromising running time.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 15