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

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

doi:10.60692/1des9-n1b89

ScienceGate Book Chapters

JOURNAL ARTICLE

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

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

Year: 2016 Journal: Greater South Information System

DOI: 10.60692/1des9-n1b89

Get Full-Text PDF Get Analytical Report

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 signa

Keywords:

Graph Signature (topology) Tree (set theory) Database query Graph database Query language

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.32

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

Graph Theory and Algorithms

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

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

Abstract

Metrics

Topics

Related Documents

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

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

Querying Object-Oriented Databases Based on Signature File Hierarchy and Signature Graph

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