Abstract

In this paper, we propose an extended version of the associative graph- machine. Then we offer efficient algorithms for implementing the second group of relational algebra operations that consists of operations Product, Join, and Union. The proposed algorithms are represented as the corresponding procedures for the AG-machine. We prove their correctness and evaluate their time complexity.

File
nepomn.pdf141.26 KB
Issue
Pages
105-117