Unlock instant, AI-driven research and patent intelligence for your innovation.

Calculation method of optimal range position query with variable distance-sensitive size

A distance and range technology, applied in the computing field of optimal range location query, can solve problems such as being fixed, unable to solve effectively, and unable to consider the distance from the query point, etc., to achieve the effect of wide application and wide practical significance.

Active Publication Date: 2018-03-13
EAST CHINA NORMAL UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

But this problem has certain limitations, such as the need for a fixed size range, and the distance from the query point cannot be considered
[0004] But in the existing MaxRS problem, the range is always fixed, so it is not easy to use and flexible enough
In the face of some scenes that cannot be fixed or do not need to be fixed, it cannot be effectively solved

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
  • Calculation method of optimal range position query with variable distance-sensitive size
  • Calculation method of optimal range position query with variable distance-sensitive size
  • Calculation method of optimal range position query with variable distance-sensitive size

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] Calculation method described in the present invention, its definition for the query:

[0031] In two-dimensional space R 2 Given a set P of points, each point in P There will be an independent non-negative value w(p) as the weight of this point. Then given a rectangle with fixed ratio and maximum size and the position r of the query point o and its initial size (the initial size limits the minimum rectangle size and can be 0). The goal of its query problem is to find a location to place the rectangle and determine its size so that the weight of the point that the rectangle can cover is the largest and the distance cost and size cost are the smallest. Its "coverage weight" is the sum of the weights of the covered points:

[0032] covered-weight(r)=∑ p∈P∩r w(p).

[0033] Assuming that all point weights in P are 1, then "coverage weight" can be simply defined as the number of points covered by r. attached figure 1 is a simple query example, r o is the initial q...

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 an optimal scope location search computing method featuring sensitive distance and changeable size. The method comprises following steps of constructing a grid for data, mapping each grid cell, constructing latitudinal and longitudinal lines to obtain a cross point set, locating all effective cross points and constructing a largest rectangle, and retracting the largest rectangle till finding an optimal size and location of rectangle. Through adoption of the method, the optimal location can be flexibly conveniently searched; and through traversal of all possible conditions, the method can get a correct result in a short time through a divide-and-conquer method and a pruning method.

Description

technical field [0001] The invention relates to the technical field of location-based services (LBS) and the field of spatial databases, in particular to a calculation method for an optimal range position query (Maximum Range Sum) whose distance-sensitive size can be changed. Background technique [0002] In modern society, location-based services (LBS) are getting more and more attention and application. LBS can be used in various fields and environments, such as navigation, tourism planning, facility construction and transportation, etc. These LBS applications all need to store and process a very large amount of spatial data, and it is necessary to use spatial database technology and algorithms to provide a correct and appropriate solution for each LBS application. There is an important LBS problem in the spatial database, called the MaxRS problem, the optimal range position query (Maximizing Range Sum), given a fixed size range, find an optimal position in the entire dat...

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 Patents(China)
IPC IPC(8): G06F17/30
CPCG06F16/9537
Inventor 林欣罗序辉邱鑫周慧君王桢陈黎
Owner EAST CHINA NORMAL UNIV