A Parallel Algorithm for the Generalized Fully Instantiated Same Generation Query in Deductive Databases
| dc.contributor.author | Arman, Nabil | |
| dc.date.accessioned | 2017-01-23T08:03:04Z | |
| dc.date.accessioned | 2022-05-22T08:26:48Z | |
| dc.date.available | 2017-01-23T08:03:04Z | |
| dc.date.available | 2022-05-22T08:26:48Z | |
| dc.date.issued | 2006 | |
| dc.description.abstract | The expressive power and 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, a parallel algorithm to solve the generalized fully instantiated form of the same generation query in deductive databases is presented. The algorithm uses 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. | en_US |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/7798 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | 4th International Multiconference on Computer Science and Information Technology (CSIT2006) | en_US |
| dc.subject | Deductive Databases, Linear Recursive Rules, Same Generation Query, Parallel Databases. | en_US |
| dc.title | A Parallel Algorithm for the Generalized Fully Instantiated Same Generation Query in Deductive Databases | en_US |
| dc.type | Article | en_US |