Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree

Tran Minh Bao; Trương Công Tuấn

doi:10.60692/39sby-qyf47

ScienceGate Book Chapters

JOURNAL ARTICLE

Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree

Tran Minh Bao Trương Công Tuấn

Year: 2016 Journal: Greater South Information System

DOI: 10.60692/39sby-qyf47

Get Full-Text PDF Get Analytical Report

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 sign

Keywords:

Query optimization Sargable Web query classification Query language Web search query Query expansion Database query Tree (set theory) Object (grammar) Index (typography)

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.33

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Advanced Database Systems and Queries

Physical Sciences → Computer Science → Computer Networks and Communications

Cloud Computing and Resource Management

Physical Sciences → Computer Science → Information Systems

Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree

Abstract

Metrics

Topics

Related Documents

Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree

Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree

Tree query optimization in distributed object-oriented databases

Query Optimization in Object Oriented Databases Based on Signature File Hierarchy and SD-Tree

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