Fast computation of spatial queries in location-based services

Details Fast computation of spatial queries in location-based services Fast computation of spatial queries in location-based services

2006-02-28

2006-02-28

Robinson, Greta (Department: 2167)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

07007013

ABSTRACT:
This invention provides methods, systems and apparatus for performing fast computation of metric queries. To achieve this, in an example embodiment, the present invention segments metric regions into disjoint primitive atomic shapes. It then represents these primitive atomic shapes and then performs off-line computation of their relevant properties. As a result of the off-line computation, the execution of a query requires a minimal number of on-line calculations resulting in a very fast query. Further optimization occurs via storage of query histories and prioritization of queries with respect to the access frequency of a metric space's primitive atomic shapes.

REFERENCES:
patent: 5428726 (1995-06-01), Piegl et al.
patent: 6029162 (2000-02-01), Schultz
patent: 6134556 (2000-10-01), Shin
C. Wang and L. Schubert, “An Optimal Algorithm for constructing the Delaunay triangulation of a set of line segments”, ACM, proceedings of the third symposium on Computational geometry, Oct. 1987, pp. 223-232.

Affiliated with

Also associated with

Rating

Fast computation of spatial queries in location-based services does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast computation of spatial queries in location-based services, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast computation of spatial queries in location-based services will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3668106