Delayed distance computations for nearest-neighbor queries...

Details Delayed distance computations for nearest-neighbor queries... Delayed distance computations for nearest-neighbor queries...

2007-02-20

2007-02-20

Le, Uyen (Department: 2163)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

10397529

ABSTRACT:
A method for locating neighboring data geometries of a query geometry. A minimum bounding rectangle of the query geometry is determined. A minimum bounding rectangle of each data geometry is determined. Candidate data geometries are identified by determining if a distance between the minimum bounding rectangle of the query geometry and the data geometry is less than a threshold distance. A distance between the query geometry and the candidate data geometry is mathematically calculated when a number of candidate data geometries equals a threshold number or when no more data geometries remain.

REFERENCES:
patent: 5953722 (1999-09-01), Lampert et al.
patent: 5963956 (1999-10-01), Smartt
patent: 6263334 (2001-07-01), Fayyad et al.
patent: 6353832 (2002-03-01), Acharya et al.
patent: 6438269 (2002-08-01), Kim et al.
patent: 6446060 (2002-09-01), Bergman et al.
patent: 6778981 (2004-08-01), Lee et al.

Affiliated with

Also associated with

Rating

Delayed distance computations for nearest-neighbor queries... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Delayed distance computations for nearest-neighbor queries..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Delayed distance computations for nearest-neighbor queries... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3875721