Relational query method implemented on large-scale data set

A large-scale data and relational query technology, applied in the field of relational query with label restrictions, can solve the problems of sharp increase in index calculation, relational query method can not meet the requirements of entity relational query, increased calculation time, etc., to support expansion sexual effect

Active Publication Date: 2012-01-25
PEKING UNIV
View PDF2 Cites 26 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] A very important use of semantic data is semantic inference. Taking the triplet above as an example, we can infer a relationship between Beijing University of Aeronautics and Astronautics and Zhantao. In traditional relational query methods, 2-hop is often used Such methods index paths, but as the scale of th

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
  • Relational query method implemented on large-scale data set
  • Relational query method implemented on large-scale data set
  • Relational query method implemented on large-scale data set

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] The example of the present invention is based on the function of entity relationship query.

[0037] The overall method flow chart of the invention is as follows figure 1 Shown:

[0038] In the example, methods for abstracting directed graphs include:

[0039] Step 101: abstract entities in the semantic data graph into points, and abstract relationships between entities into directed edges.

[0040] Step 102: Abstract the edges corresponding to the same relationship into a label.

[0041] figure 2 It is a directed graph that has been abstracted, where the label represents the type of edge. Here, we define the length of the path between points as the number of types of labels on the path. Such as figure 2 As shown, there are two paths from point 1 to point 5, respectively p 1 (1, 2, 5), p 2 (1, 2, 3, 4, 5), the label sets of the two paths are {a, b} and {a} respectively, then according to our above definition, p 1 is of length 2, p 2 has a length of 1.

[004...

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 relational query method implemented on a large-scale data set and belongs to the field of semantic webs. The method comprises the following steps: 1) calculating connective subgraphs (only containing a same type of tags) in a semantic data directed graph G; 2) merging the connective subgraphs, and dividing the directed graph G into a plurality of subgraphs; 3) calculating a strongest connective subgraph C in each subgraph subjected to merging, and calculating a bipartite graph of the strongest connective subgraph C; 4) storing the shortest path of all the subgraphs Cinto a path set RS; 5) recording the tags (containing two points of a non-redundant tag path) in each divided subgraph so as to obtain a tag set of each subgraph; and 6) judging whether paths conforming to the query conditions exist in the directed graph G by using the tag set, if so, returning path query results, otherwise, carrying out traversal among the subgraphs, determining subgraphs which can reach a target node according to the path set RS, and then, returning the path query results by using the tag set of the subgraph. The method disclosed by the invention is used for supporting the relational query of mass data, and is strong in expandability.

Description

technical field [0001] The invention belongs to the field of database technology and the field of semantic web, and relates to a tag-restricted relational query method on a large-scale data set. Background technique [0002] Semantic data is a kind of data that represents the attribute information of entities and the semantic relationship between entities. It is generally expressed in the form of a set of triples. The format of triples is <subject, predicate, object>. For example: <Beijing University of Aeronautics and Astronautics, President, Huai Jinpeng>, <Huai Jinpeng, graduated from, Jilin University>, ..., <Jilin University, President, Zhan Tao>. [0003] A very important use of semantic data is semantic inference. Taking the triplet above as an example, we can infer a relationship between Beijing University of Aeronautics and Astronautics and Zhantao. In traditional relational query methods, 2-hop is often used Such methods index paths, but as...

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/30
Inventor 许坤赵东岩邹磊贾爱霞
Owner PEKING UNIV
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