by Werner Stein
Indexing Principles for Relational Languages Applied to PROLOG Code Generation
In this paper we propose an extensible, flexible, multi-argument indexing technique for relational languages. We present a compiler producing indexing header code for a PROLOG emulator based on the Warren Abstract Machine. We will show that our technique combines positive aspects of relational database methods and other existing WAM-based indexing schemes. All the indexing concepts introduced are implemented in LISP for the relational-functional programming language RELFUN.
The next abstract is here, and the previous abstract is here.
Note: This page was written to look best with CSS stylesheet support Level 1 or higher. Since you can see this, your browser obviously doesn't support CSS, or you have turned it off. We highly recommend you use a browser that supports and uses CSS, and review this page once you do. However, don't fear, we've tried to write this page to still work and be readable without CSS.