登入選單

返回Google圖書搜尋

Classification and Compilation of Linear Recursive Queries in Deductive Databases

Georgia Institute of Technology. School of Information and Computer Science

出版	School of Information and Computer Science, Georgia Institute of Technology, 1989
URL	http://books.google.com.hk/books?id=aOmxpwAACAAJ&hl=&source=gbs_api

註釋

Abstract: "In this paper, we present a graph model which is powerful in classifying and compiling linear recursive formulas in deductive databases. The graph model consists of two kinds of graph: I-graph and Resolution Graph. We can extract essential properties of a recursive formula from its I-graph and can easily figure out the compiled formula and the query evaluation plan of the recursive formula from its resolution graph. We demonstrate that based on the graph model all the linear recursive formulas can be classified into several classes and each class shares some common characteristics in query compilation and query processing.