http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-103559209-B

Outgoing Links

Predicate Object
classificationCPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-9537
classificationIPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-30
filingDate 2013-10-10-04:00^^<http://www.w3.org/2001/XMLSchema#date>
grantDate 2016-08-17-04:00^^<http://www.w3.org/2001/XMLSchema#date>
publicationDate 2016-08-17-04:00^^<http://www.w3.org/2001/XMLSchema#date>
publicationNumber CN-103559209-B
titleOfInvention A kind of efficient spatial K-NN search method that Voronoi Diagram is combined with virtual grid
abstract The invention discloses a kind of efficient spatial K-NN search method that Voronoi Diagram is combined with virtual grid, comprise the following steps: (1) uses Voronoi Diagram to divide the data point in two-dimensional space, forms N number of Voronoi Cell;(2) use virtual grid that two-dimensional space is divided into several grid cells, determine the length of side of grid cell and be numbered;(3) method that design calculates the corresponding relation between virtual grid unit and Voronoi Cell, and be stored in a Hash table;(4) calculate the grid cell at place, query point position, and determine the numbering of the grid cell of correspondence;(5) in Hash table, search the Voronoi Cell corresponding to grid cell at place, query point position, and the data point therefrom calculating chosen distance query point position nearest returns to user.The present invention is applicable to the two-dimentional data set of Macroscale homogenous distribution, it is possible to from O (log N), the time complexity of space K-NN search is reduced to O (1), drastically increases the efficiency of space K-NN search.
priorityDate 2013-10-10-04:00^^<http://www.w3.org/2001/XMLSchema#date>
type http://data.epo.org/linked-data/def/patent/Publication

Incoming Links

Predicate Subject
isDiscussedBy http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID415713197
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID25572

Total number of triples: 12.