Research Article
Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree
@ARTICLE{10.4108/eai.9-3-2016.151114, author={Tran Minh Bao and Truong Cong Tuan}, title={Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree}, journal={EAI Endorsed Transactions on Context-aware Systems and Applications}, volume={3}, number={8}, publisher={EAI}, journal_a={CASA}, year={2016}, month={3}, keywords={Object-oriented database system, index, signature file, SD-Tree, object-oriented query}, doi={10.4108/eai.9-3-2016.151114} }- Tran Minh Bao
Truong Cong Tuan
Year: 2016
Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree
CASA
EAI
DOI: 10.4108/eai.9-3-2016.151114
Abstract
In this paper, we suggest a new technique to create index helping to query almost identical similarities with keywords in case there is no correct match found. It is based on a SD-Tree and a n-ary Tree helping to query related information when there is no correct match. Index structure arranges signatures according to hierarchical clustering for improving assessment of query. This method is based on technique of using signature file and SD-Tree and signature files are organized according to decentralization to filter unsuitable data quickly and each signature file is saved according to SD-Tree structure for increasing speed of scanning signature. This method helps to decrease effectively search space, so therefore improving effectively complexity of query time.
Copyright © 2016 T. M. Bao and T. C. Tuan, 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.
