Query prunning using exterior tiles in an R-tree index

Details Query prunning using exterior tiles in an R-tree index Query prunning using exterior tiles in an R-tree index

2007-05-15

2007-05-15

Le, Uyen (Department: 2163)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

10841540

ABSTRACT:
Determining relationships among objects represented in a database includes defining a plurality of tiles in the approximation of the first geometry by dividing the approximation of the first geometry in a first direction a plurality of times and dividing the approximation of the first geometry in a second direction perpendicular to the first direction a plurality of times. A second geometry is analyzed to determine if it fulfills a first filter condition with respect to any of the tiles defined in the approximation of the first geometry. If the second geometry fulfills the first filter condition with respect to any of the tiles defined in the first geometry carrying out a mathematical comparison of the first geometry and the second geometry.

REFERENCES:
patent: 5428744 (1995-06-01), Webb et al.
patent: 5710916 (1998-01-01), Barbara et al.
patent: 5963956 (1999-10-01), Smartt
patent: 5988853 (1999-11-01), Kim et al.
patent: 6084595 (2000-07-01), Bach et al.
patent: 6115717 (2000-09-01), Mehrotra et al.
patent: 6148295 (2000-11-01), Megiddo et al.
patent: 6154746 (2000-11-01), Berchtold et al.
patent: 6252605 (2001-06-01), Beesley et al.
patent: 6263334 (2001-07-01), Fayyad et al.
patent: 6308177 (2001-10-01), Israni et al.
patent: 6438269 (2002-08-01), Kim et al.
Kim et al., “Development of multi-step filtering processor”, IEEE 1999, pp. 169-176.
Silva et al., “An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes”, IEEE 1998, pp. 87-94.
P. Fischer et al., “Computing a maximum axis-aligned rectangle in a convex polygon”, Information Processing Letters 51 (1994), pp. 189-193.
R. Kothuri et al., “Efficient Processing of Large Spatial Queries Using Interior Approximations”, Advances in Spacial and Temporal Databases, Lecture Notes in Computer Science, 2121, pp. 404-424, Redondo Beach, CA, Jul. 2001.
H. Alt et al., Computing the Largest Inscribed Isothetic Rectangle, pp. 1-8, Proc. 7thCanadian Conference Computational Geometry, Universit'e Laval, Qu'ebec, Aug. 1995.
K. Kanth et al., “Indexing Medium-Dimensionality Data in Oracle”, Proc. Of ACM SIGMOND Int'l. Conference on Management of Data, pp. 521-522, Jun. 1999.

Affiliated with

Also associated with

Rating

Query prunning using exterior tiles in an R-tree index does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Query prunning using exterior tiles in an R-tree index, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Query prunning using exterior tiles in an R-tree index will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3720774