Monochrome mutual nearest neighbor query processing method for uncertain spatial data

A technology of spatial data and processing methods, which is applied in electrical digital data processing, special data processing applications, instruments, etc., and can solve the problems of high I/O access times and large probability calculations.

Inactive Publication Date: 2016-07-20
NANJING UNIV OF INFORMATION SCI & TECH
View PDF0 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] The purpose of the present invention is to provide a monochromatic mutual nearest neighbor query processing method based on uncertain spatial data sets, which overcomes the defects of large amount of probability calculation and high number of I / O visits in the prior art

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
  • Monochrome mutual nearest neighbor query processing method for uncertain spatial data
  • Monochrome mutual nearest neighbor query processing method for uncertain spatial data
  • Monochrome mutual nearest neighbor query processing method for uncertain spatial data

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0070] The specific embodiments of the present invention will be further described below in conjunction with the accompanying drawings.

[0071] Such as figure 1 As shown, the present invention is a monochrome mutual nearest neighbor query method based on an uncertain data set, comprising the following steps:

[0072] Step 1: Initialize the minimum heap H rfn , let the set S temp Is empty;

[0073] Step 2: Traverse the R tree to get the nearest neighbor candidate set nn of the query object q q , and save the pruned nodes and objects in the minimum heap H rfn , the specific process is as follows:

[0074] Step 2.1: Initialize the minimum heap H, set the root node of the R tree as root, insert into H, and set the variable minf to infinity;

[0075] Step 2.2: Perform steps 2.3 to 2.6 in a loop if H is not empty, otherwise go to step 2.7;

[0076] Step 2.3: Take out the top element of the H stackt >

[0077] Step 2.4: If d t >minf, execute step 2.7;

[0078] Step 2.5: I...

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 monochrome mutual nearest neighbor query processing method for uncertain spatial data. The method includes the steps that an R tree is subjected to traversal, a nearest neighbor candidate set nnq of a query object q is obtained, and pruning nodes and objects in the process are preserved in a minimum pile Hrfn; objects in the nnq are inserted into the Hrfn; elements in the Hrfn are inserted into a set Sstemp; the Hrfn is subjected to traversal, and a reverse nearest neighbor candidate set rnnq of the q is obtained; the intersection of the nnq and the rnnq is solved to serve as the mutual nearest neighbor candidate set mnnq of the q; for each object o in the mnnq, the set Sstemp is subjected to traversal, and the nearest neighbor candidate set nno of the os is queried; the union set of the nno and the nnq is solved, and a probability calculation list of the os is obtained; the probability value of each object in the mnnq is calculated; the object with the probability value larger than the threshold value serves as the result and is returned. Compared with an existing method, the method is high in operation efficiency, low in I/O cost, short in query time and capable of improving query processing efficiency when used for processing corresponding query questions in LBS.

Description

technical field [0001] The invention relates to a single-color mutual nearest neighbor query processing method on uncertain spatial data, and belongs to the technical field of location-based database (LBS) information query in spatio-temporal database (Spatio-TemporalDataBase, STDB). Background technique [0002] Spatiotemporal database is an important branch of the database field. Spatiotemporal query is an important operation in spatiotemporal database. According to spatial conditions, it can be divided into: range query, nearest neighbor query, reverse nearest neighbor query, etc. Mutual nearest neighbor query is the deformation and extension of nearest neighbor query and reverse nearest neighbor query. Its calculation result is the nearest neighbor of a given point, and it also takes the given point as the nearest neighbor data point. Mutual nearest neighbor query has important application value in fields such as data mining, pattern recognition and decision support. ...

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/245G06F16/2246
Inventor 陈逸菲秦小麟
Owner NANJING UNIV OF INFORMATION 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