Demand-driven indexing of prolog clauses

Santos Costa, V; Sagonas, K; Lopes, R

dc.contributor.author	Santos Costa, V	en
dc.contributor.author	Sagonas, K	en
dc.contributor.author	Lopes, R	en
dc.date.accessioned	2014-03-01T02:44:32Z
dc.date.available	2014-03-01T02:44:32Z
dc.date.issued	2007	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31873
dc.subject	Efficient Implementation	en
dc.subject	Indexation	en
dc.subject	Logic Programs	en
dc.subject.other	Aerospace applications	en
dc.subject.other	Computer programming	en
dc.subject.other	Dynamic programming	en
dc.subject.other	Dynamical systems	en
dc.subject.other	Dynamics	en
dc.subject.other	Fuzzy logic	en
dc.subject.other	Indexing (of information)	en
dc.subject.other	Logic programming	en
dc.subject.other	Mechanics	en
dc.subject.other	Multitasking	en
dc.subject.other	Set theory	en
dc.subject.other	Data sets	en
dc.subject.other	Efficient implementation	en
dc.subject.other	Heidelberg (CO)	en
dc.subject.other	international conferences	en
dc.subject.other	Orders-of-magnitude	en
dc.subject.other	Prolog programs	en
dc.subject.other	Prolog systems	en
dc.subject.other	Run-time optimization	en
dc.subject.other	Springer (CO)	en
dc.subject.other	Static generation	en
dc.subject.other	Static techniques	en
dc.subject.other	PROLOG (programming language)	en
dc.title	Demand-driven indexing of prolog clauses	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-74610-2_27	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-74610-2_27	en
heal.publicationDate	2007	en
heal.abstract	As logic programming applications grow in size, Prolog systems need to efficiently access larger and larger data sets and the need for any- and multiargument indexing becomes more and more profound. Static generation of multiargument indexing is one alternative, but applications often rely on features that are inherently dynamic which makes static techniques inapplicable or inaccurate. Another alternative is to employ dynamic schemes for flexible demand-driven indexing of Prolog clauses. We propose such schemes and discuss issues that need to be addressed for their efficient implementation in the context of WAM-based Prolog systems. We have implemented demand-driven indexing in two different Prolog systems and have been able to obtain non-negligible performance speedups: from a few percent up to orders of magnitude. Given these results, we see very little reason for Prolog systems not to incorporate some form of dynamic indexing based on actual demand. In fact, we see demand-driven indexing as only the first step towards effective runtime optimization of Prolog programs. © Springer-Verlag Berlin Heidelberg 2007.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-540-74610-2_27	en
dc.identifier.volume	4670 LNCS	en
dc.identifier.spage	395	en
dc.identifier.epage	409	en