Efficient Access Mechanisms for Tabled Logic Programs

Ramakrishnan, I; Rao, P; Sagonas, K; Swift, T; Warren, D

dc.contributor.author	Ramakrishnan, I	en
dc.contributor.author	Rao, P	en
dc.contributor.author	Sagonas, K	en
dc.contributor.author	Swift, T	en
dc.contributor.author	Warren, D	en
dc.date.accessioned	2014-03-01T01:47:54Z
dc.date.available	2014-03-01T01:47:54Z
dc.date.issued	1999	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25365
dc.subject	Data Structure	en
dc.subject	Indexation	en
dc.subject	Logic Programs	en
dc.title	Efficient Access Mechanisms for Tabled Logic Programs	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0743-1066(98)10013-4	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0743-1066(98)10013-4	en
heal.publicationDate	1999	en
heal.abstract	This article describes the design, implementation, and experimentalevaluation of data structures and algorithms for high-performancetable access. Our approach uses tries as the basis for tables. Tries, a variantof discrimination nets, provide complete discrimination for terms, andpermit a lookup and possible insertion to be performed in a single passthrough a term. In addition, a novel technique of substitution factoring isproposed. When	en
heal.journalName	Journal of Logic Programming	en
dc.identifier.doi	10.1016/S0743-1066(98)10013-4	en