发明授权
US06879980B1 Nearest neighbor query processing in a linear quadtree spatial index
有权
线性四叉树空间索引中的最近邻查询处理
- 专利标题: Nearest neighbor query processing in a linear quadtree spatial index
- 专利标题(中): 线性四叉树空间索引中的最近邻查询处理
-
申请号: US09893550申请日: 2001-06-29
-
公开(公告)号: US06879980B1公开(公告)日: 2005-04-12
- 发明人: Ravi Kanth V. Kothuri , Siva Ravada , Jayant Sharma
- 申请人: Ravi Kanth V. Kothuri , Siva Ravada , Jayant Sharma
- 申请人地址: US CA Redwood Shores
- 专利权人: Oracle International Corporation
- 当前专利权人: Oracle International Corporation
- 当前专利权人地址: US CA Redwood Shores
- 代理机构: Swidler Berlin LLP
- 主分类号: G06F17/30
- IPC分类号: G06F17/30
摘要:
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.