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

Authors

  • Tran Minh Bao Hue University image/svg+xml
  • Truong Cong Tuan Hue University image/svg+xml
  • Huynh Trong Duc Ho Chi Minh City Industry and Trade College

DOI:

https://doi.org/10.4108/eai.12-2-2016.151087

Keywords:

Object-oriented query, object signature, signature file, signature graph

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.

Downloads

Published

12-02-2016

How to Cite

1.
Minh Bao T, Cong Tuan T, Trong Duc H. Querying Object-Oriented Databases Based on Signature Graph and n-ary Tree. EAI Endorsed Trans Context Aware Syst App [Internet]. 2016 Feb. 12 [cited 2024 Feb. 22];3(7):e4. Available from: https://publications.eai.eu/index.php/casa/article/view/1994