Networked relational data query method based on hierarchical identification routing

A query method and relational data technology, applied in the field of networked relational data query based on hierarchical identification routing, can solve the problems affecting the availability and reliability of query results, affecting the recall rate, precision rate and data transmission efficiency of query results, etc. , to achieve the effect of good query recall and precision

Active Publication Date: 2015-04-22
HUNAN UNIV OF SCI & TECH
View PDF2 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Among them, dynamic routing will affect the recall rate, precision rate and data transmission efficiency of query results.
In ad

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Networked relational data query method based on hierarchical identification routing
  • Networked relational data query method based on hierarchical identification routing
  • Networked relational data query method based on hierarchical identification routing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] The following examples are only used to describe the present invention in detail, and do not limit the protection scope of the invention in any way.

[0034] In a relational database, metadata is mainly defined in the form of a table, generally declaring the value range of a column and other constraints. Each table (sometimes called a relation) contains one or more data attributes represented by columns. Each row contains a unique data entity. In a relational database, the connection structure between tables (such as the association between the primary key and the foreign key) not only indicates the data connection between the tables, but also often indicates the hierarchical relationship between the categories or categories to which the data belongs. And this hierarchical information is generally required to exist in each shard even if the data is vertically partitioned. Therefore, in a given application field, whether the established relational database is a central...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a networked relational data query method based on hierarchical identification routing. The method comprises the steps that (1) hierarchical names of data entities are constructed in local relational databases; (2) the hierarchical names are converted into query groups formed by hierarchical routing factors and query constraint factors according to information to be queried by a user, and then the query groups are sent to a routing node connected with a client side; (3) the node matches and forwards all the received query groups; (4) information of the query groups is converted into an SQL supporting the local relational databases to carry out local query; (5) a local query result and the hierarchical routing factors of an original query request are packaged into data groups, and the data groups are sent back to interfaces of the corresponding query groups; (6) routing nodes cache and aggregate the received data groups and then send the data groups back along original paths. By means of the method, SQL query of all relational databases connected through an NDN can be achieved.

Description

technical field [0001] The invention relates to the fields of relational databases, self-organizing network environments and named data networks, in particular to a method for querying networked relational data based on hierarchical identification routing. Background technique [0002] Self-organizing P2P, wireless sensor network WSN, mobile Internet, etc. all have difficulties in complex query and acquisition of dynamically distributed data, because it is necessary to consider the correct and effective routing of query requests in a dynamically distributed environment, and also consider distributed results. Dynamic aggregation and reliable return issues for . Among them, dynamic routing will affect the recall rate, precision rate and data transmission efficiency of query results. In addition, the dynamic aggregation and reliable return of query results will affect the availability and reliability of query results. The form supported by the query system in the dynamic dist...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30H04L29/08
CPCG06F16/284G06F16/288
Inventor 廖祝华
Owner HUNAN UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap