2010•Unpublished venueRequires access
Precise complexity analysis for efficient datalog queries
K. Tuncay Tekle, Yanhong A. Liu
Open publisher page 17 citations
Abstract
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answering the query, top-down evaluation is extended with tabling that stores the results of the subqueries encountered, and bottom-up evaluation is done on rules transformed based on demand from the query.