Distributed index for graph database searching and parallel generation method of distributed index

A distributed, database technology, applied in the field of keyword search, can solve the problem of occupying a large amount of memory and time-consuming optimization process, and achieve the effect of reducing memory dependence

Inactive Publication Date: 2014-03-19
WUHAN UNIV
View PDF2 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

These indexing techniques have proven to be very effective, but there are still some insurmountable shortcomings, such as requiring a large amount of memory, and the optimization process itself can be very time-consuming, etc.

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
  • Distributed index for graph database searching and parallel generation method of distributed index
  • Distributed index for graph database searching and parallel generation method of distributed index
  • Distributed index for graph database searching and parallel generation method of distributed index

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0046] At first, the theoretical basis of the present invention is set forth as follows:

[0047] The keyword search problem of graph database can be defined as: given graph G=(V,E) and keyword query {k 1 ,k 2 ,...,k l}, let V contain the keyword k i (1≤i≤l) vertices are keywords k i The matching vertices of all keywords are searched in the graph for subtrees that satisfy certain structural constraints that contain at least one matching vertex of all keywords. In the search, assuming that the degree of each vertex is n, then the time cost of m-step exploration starting from a matching vertex is O(1+n+n 2 +…+n m ). So, when a query has a large number of matching vertices, the search can be very time-consuming.

[0048] The graph database index proposed by the present invention is used for a heuristic clipping of matching vertices, and the search space is significantly reduced at the cost of a small amount of possible error clipping, thereby greatly improving the search e...

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 distributed index for graph database searching and a parallel generation method of the distributed index. The distributed index for graph database searching comprises a delta-neighbor peak lookup table, a matching peak cutting index and a distributed matching peak cutting index. The generation method of the distributed index is a MapReduce-based parallel algorithm. According to the distributed index and the parallel generation method, the searching space can be reduced, the searching efficiency can be improved, the defect of enormous time and space expenses for building indexes on graph databases can be overcome, in addition, the index access time required by searching each time can be minimized, and the problem of the searching time increase caused by the index access expenses is solved.

Description

technical field [0001] The invention belongs to the technical field of keyword search for graph databases, and relates to a distributed index for graph database search and a parallel generation method thereof, in particular to a method for realizing rapid retrieval on large-scale graphs with more than one million vertices. Distributed indexing technology introduced for search results. Background technique [0002] In recent years, a large amount of graph-structured data has emerged in the fields of social network, bioinformatics, chemical information, software engineering, semantic web, transportation network, etc. For example, in a social network, users are represented as vertices, which contain data such as the user's name, age, preferences, etc., and the relationship between users is represented as edges between vertices, thus forming a huge graph. In this context, applications based on graph databases have begun to flourish and show considerable economic and social valu...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
CPCG06F16/5866
Inventor 钟鸣刘梦赤
Owner WUHAN 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