Research Article
Querying Object-Oriented Databases Based on Signature Graph and n-ary Tree
@ARTICLE{10.4108/eai.12-2-2016.151087, author={Tran Minh Bao and Truong Cong Tuan and Huynh Trong Duc}, title={Querying Object-Oriented Databases Based on Signature Graph and n-ary Tree}, journal={EAI Endorsed Transactions on Context-aware Systems and Applications}, volume={3}, number={7}, publisher={EAI}, journal_a={CASA}, year={2016}, month={2}, keywords={Object-oriented query, object signature, signature file, signature graph}, doi={10.4108/eai.12-2-2016.151087} }- Tran Minh Bao
Truong Cong Tuan
Huynh Trong Duc
Year: 2016
Querying Object-Oriented Databases Based on Signature Graph and n-ary Tree
CASA
EAI
DOI: 10.4108/eai.12-2-2016.151087
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.
Copyright © 2016 Tran Minh Bao et al., licensed to EAI. This is an open access article distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.
