Institutional Repository

Efficient evaluation of regular path programs

Show simple item record Wood, PT 2018-05-20T01:40:09Z 2018-05-20T01:40:09Z 1992
dc.identifier.citation Wood PT (1992) Efficient evaluation of regular path programs. South African Computer Journal, Number 6, 1992 en
dc.identifier.issn 2313-7835
dc.description.abstract The next generation of query languages for database systems should have the ability to express recursive queries, the efficient evaluation of which will be crucial to the success of these systems. One such query language which has been the subject of much research is Datalog. We define a class of Datalog programs, namely, the regular path programs, which can always be evaluated efficiently, in particular, when constants are present in a query. Efficient evaluation is ensured by reducing the number of arguments appearing in each predicate defined in the program. The class of regular path programs is incomparable to previous classes to which the technique of argument reduction has been applied. en
dc.language en
dc.language.iso en en
dc.publisher South African Institute of Computer Scientists and Information Technologists en
dc.subject Deductive databases en
dc.subject Logic programming en
dc.subject Optimization en
dc.subject Rule rewriting en
dc.title Efficient evaluation of regular path programs en
dc.type Article en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UnisaIR


My Account