01562nas a2200181   4500008004100000245008900041210006900130260000900199300001400208490000600222520092100228653002401149653002701173653002301200653002601223100001401249856011701263       2006                        eng d00aParallel algorithms for the generalized same generation query in deductive databases0 aParallel algorithms for the generalized same generation query in  c2006  a192 - 1960 v43 aThe intelligence of traditional database systems can be improved by recursion. Using recursion, relational database systems are extended into knowledge-base systems (deductive database systems). Linear recursion is the most frequently found type of recursion in deductive databases. Deductive databases queries are computationally intensive and lend themselves naturally to parallelization to speed up the solution of such queries. In this paper, parallel algorithms to solve the generalized fully and partially instantiated forms of the same generation query in deductive databases are presented. The algorithms use special data structures, namely, a special matrix that stores paths from source nodes of the graph representing a two-attribute normalized database relation to all nodes reachable from these source nodes, and a reverse matrix that stores paths from any node to all source nodes related to that node.10aDeductive databases10aLinear recursive rules10aParallel databases10aSame generation query1 aArman, N.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33749424147&partnerID=40&md5=f02aca3cb9370bdc7720ce48f7507278