Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2005-04-12
2005-04-12
Metjahic, Safet (Department: 2161)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
06879980
ABSTRACT:
A method for locating neighbor objects of a query object in a database. A query tile set is defined including a plurality of tiles that define an initial query radius that the query object is grouped within. Neighbor objects are located within the initial query radius. A number of neighbor objects within the initial query radius is determined. The query radius is expanded beyond the initial query radius by defining an expanded query tile set beyond the query tile set if the number of neighbor objects is less than a target number. Neighbor objects are located within the expanded query radius. It is determined whether a number of neighbor objects within the expanded radius corresponds to a target number. The query radius is expanded and neighbor objects located within the expanded radius until the number of neighbor objects equals or exceeds the target number.
REFERENCES:
patent: 5615321 (1997-03-01), Corn
patent: 5740280 (1998-04-01), Leonardi et al.
patent: 5848373 (1998-12-01), DeLorme et al.
patent: 5963956 (1999-10-01), Smartt
patent: 5990896 (1999-11-01), Barrus
patent: 6014641 (2000-01-01), Loeb et al.
patent: 6021406 (2000-02-01), Kuznetsov
patent: 6130673 (2000-10-01), Pulli et al.
patent: 6134541 (2000-10-01), Castelli et al.
patent: 6148295 (2000-11-01), Megiddo et al.
patent: 20010011270 (2001-08-01), Himmelstein et al.
patent: 20020027567 (2002-03-01), Niamir
patent: 20020147703 (2002-10-01), Yu et al.
patent: 20020151315 (2002-10-01), Hendrey
patent: 20020165854 (2002-11-01), Blayvas et al.
Samet, Hanan. “The Quadtree and Related Hierarchical Data Structures.” ACM Computing Surveys (CSUR), vol. 16, Issue 2, pp. 187-260. Jun. 1984. ACM Press.*
Hjaltason et al. “Distance Browsing in Spatial Databases.” ACM Transactions on Database Systems (TODS). vol. 24, No. 2, pp. 265-318. Jun. 1999. ACM Press.
Kothuri Ravi Kanth V.
Ravada Siva
Sharma Jayant
Goddard Brian
Metjahic Safet
Oracle International Corporation
Swidler Berlin , LLP
LandOfFree
Nearest neighbor query processing in a linear quadtree... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Nearest neighbor query processing in a linear quadtree..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nearest neighbor query processing in a linear quadtree... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3405853