Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method of k-neighbour query based on data mesh

A query method and data grid technology, applied in the direction of electrical digital data processing, special data processing applications, instruments, etc., to achieve the effect of improving performance, improving efficiency, and good code portability

Inactive Publication Date: 2007-04-25
ZHEJIANG UNIV
View PDF0 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] Although some research has been done on traditional database query in grid environment [9，10] , but there are few literatures on high-dimensional k-nearest neighbor query based on data grid

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
  • Method of k-neighbour query based on data mesh
  • Method of k-neighbour query based on data mesh
  • Method of k-neighbour query based on data mesh

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0081] The technical scheme and the steps of the specific implementation of the high-dimensional k-NN query based on the data grid environment of the present invention are as follows:

[0082] (1) Data distribution strategy based on starting point distance

[0083] In order to maximize the parallelism of vector reduction processing at the data node level, the present invention proposes to perform data distribution on vector data based on the distance from the starting point, so that for each query, each data node can perform vector reduction in parallel, thereby Significantly improve the efficiency of query execution.

[0084] The steps for this data distribution are as follows:

[0085] Input: Ω: vector set, α data nodes;

[0086] Output: Ω(1 to α): vectors stored in different data nodes;

[0087] (1) Calculate the starting point distance of each vector and sort them;

[0088] (2) According to the principle that the total number of vectors in each slice is consistent, the...

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 relates to a k nearby high-dimension inquire method based on data grid. Wherein, the invention via vector reduction, package transmission and product line reduces the response time of k nearby inquire. The execute node of distance calculation is dynamically set by the node condition of mesh, with better expandable property. And since the search based on content is high-dimension search, the invention can be transplanted to the searches of variable mediums.

Description

technical field [0001] The invention relates to the field of database and network, in particular to a k-nearest neighbor query method based on data grid. Background technique [0002] With the continuous development of grid and multimedia technology, especially in recent years, the explosive growth of multimedia information on the Internet, the retrieval and indexing of massive multimedia information based on content [1] has become a hot research field. How to use the grid's parallel computing ability to speed up content-based multimedia retrieval is a very important research topic. [0003] High-dimensional index technology has experienced more than 20 years of research [11] , the technologies used are mainly divided into three categories: the first category is a tree index based on data and space sharding, such as R-tree [12] and its variants [13, 14], etc. However, these tree index methods are only suitable for low-dimensional situations. As the dimension increases, t...

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): H04L29/02G06F17/30
Inventor 庄越挺庄毅吴飞
Owner ZHEJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com