发明授权
US08892569B2 Indexing spatial data with a quadtree index having cost-based query decomposition
有权
使用具有基于成本的查询分解的四叉树索引来索引空间数据
- 专利标题: Indexing spatial data with a quadtree index having cost-based query decomposition
- 专利标题(中): 使用具有基于成本的查询分解的四叉树索引来索引空间数据
-
申请号: US12977707申请日: 2010-12-23
-
公开(公告)号: US08892569B2公开(公告)日: 2014-11-18
- 发明人: Ivan Thomas Bowman , David Edward De Haan
- 申请人: Ivan Thomas Bowman , David Edward De Haan
- 申请人地址: US CA Dublin
- 专利权人: iAnywhere Solutions, Inc.
- 当前专利权人: iAnywhere Solutions, Inc.
- 当前专利权人地址: US CA Dublin
- 代理机构: Sterne, Kessler, Goldstein & Fox P.L.L.C.
- 主分类号: G06F17/30
- IPC分类号: G06F17/30
摘要:
Approaches for indexing and retrieving spatial data with a quadtree index in database management systems are described. In an embodiment, data objects are stored without decomposition within a linearized quadtree stored within a B-tree index. In another embodiment, a method determines an optimal execution plan for a spatial query by parsing it to determine a query type and geometry object associated with the query. The method tessellates the query object by recursively decomposing the quadtree blocks that cover it. Cost-based decomposition decisions are made by consulting a cost model furnished by the database management system to minimize the cost of the resulting index range plan on the B-tree storage. Thus, data-directed query decomposition enacted by the method results in the optimal cost index range plan for the current data distribution and system context. In another embodiment, a system identifies and displays an optimal index range plan in a user interface.
公开/授权文献
信息查询