A K-Nearest Neighbor Query Method Based on Area Coverage

A technology of area coverage and query method, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as high time cost, achieve convenient query, save main memory space, and improve query efficiency

Active Publication Date: 2011-12-21
NORTHEASTERN UNIV
View PDF1 Cites 31 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

ST 2 B-tree is a self-adjustable moving object B + Tree index structure, first in time, ST 2 The B tree will be the underlying B + The tree is divided into two subtrees BT 0 and BT 1 , each moving object selects the corresponding sub-tree for indexing according to the update time, and the two sub-trees manage the moving objects alternately with time; secondly, in terms of space, according to the distribution of moving objects in the area, a reference is selected according to the density point set, and divid

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
  • A K-Nearest Neighbor Query Method Based on Area Coverage
  • A K-Nearest Neighbor Query Method Based on Area Coverage
  • A K-Nearest Neighbor Query Method Based on Area Coverage

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0061] The present invention will be described in further detail below in conjunction with the accompanying drawings and embodiments.

[0062] The hardware environment adopted in this embodiment is: one IBM server, CPU Xeon EM64T Quad core E5405 (2.0GHz 12MB L21333MHz 80w, memory 16G Bytes DDR RAM,

[0063] Software environment: operating system: CentOS 5.2; development tools: GNU Toolkits (GCC, G++, GDB), Make, Vim, SVN, etc.; development language: standard C++ language;

[0064] Aiming at the situation that there are a large number of soldiers participating in the battle on the battlefield, this embodiment only takes 20 soldiers as an example, and the k-nearest neighbor query method based on area coverage includes the following steps:

[0065] Step 1: Each soldier reports his current coordinates upwards to determine the battlefield space: Soldiers are required to have positioning communication devices, upload their own positions and query requests, and the distribution of so...

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 provides a k-nearest neighbor searching method based on regional coverage, belonging to the technical field of mobile data indexes. The k-nearest neighbor searching method comprises the steps of: gridding a space, storing data points in corresponding grids, storing grids which are taken as the leaf nodes of a quadtree, meanwhile, storing the grids, which are taken as mobile objects, into a Voronoi image; and during searching, firstly finding out a grid in which an object is located according to coordinates of the object, further finding out the position of the grid in the Voronoi image, structuring the object in the grid according to an ascending order of distances to form a result linked list, meanwhile, putting adjacent grids into an access linked list based on the ascending order of the distances according to the Voronoi image, comparing the distances, and finally finding out K nearest neighbors of the object. In the k-nearest neighbor searching method, an index structure with the Voronoi image and a virtual grid quadtree is comprehensively utilized, and a Hash table is utilized for rapid searching and positioning, so that the searching efficiency is increased.

Description

technical field [0001] The invention belongs to the technical field of mobile data indexing, in particular to a k-nearest neighbor query method based on area coverage. Background technique [0002] With the advancement of science and technology, especially the development of wireless communication technology, Global Positioning System (Global Positioning System, GPS) technology and database technology, mobile object database technology has gradually become a research hotspot in the database field. Among them, the K-nearest neighbor query method for mobile object data is an important area of ​​research. The so-called K-Nearest Neighbor (KNN, K Nearest Neighbor) query refers to finding the K closest objects before a given point in space, where K can be one or more. However, most of the past research work is aimed at K-nearest neighbor queries in a static environment, where the attribute values ​​of the target points remain unchanged or rarely need to be updated. The research ...

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 NORTHEASTERN 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