Querying Object-Oriented Databases Based on Signature Graph and n-ary Tree

Abstract

In this paper, we suggest a new technique to create index helping for querying almost identical similarities with keywords in case there is no correct match found. It’s based on a signature graph and n-ary tree helping to query related information when there is no correct match. Main idea is a signature graph structure, created based on signature file, created for a layer and signature files are arranged as a hierarchical system according to nested structure of layers. This technique helps to decrease effectively search space, so therefore it will improve effectively complexity of query time. More than that, we develop query algorithm on signature graph based on Chen and partners method [3] suggested, thereby helping to improve query time on signature graph better.