Invention Grant
US08892569B2 Indexing spatial data with a quadtree index having cost-based query decomposition
有权
使用具有基于成本的查询分解的四叉树索引来索引空间数据
- Patent Title: Indexing spatial data with a quadtree index having cost-based query decomposition
- Patent Title (中): 使用具有基于成本的查询分解的四叉树索引来索引空间数据
-
Application No.: US12977707Application Date: 2010-12-23
-
Publication No.: US08892569B2Publication Date: 2014-11-18
- Inventor: Ivan Thomas Bowman , David Edward De Haan
- Applicant: Ivan Thomas Bowman , David Edward De Haan
- Applicant Address: US CA Dublin
- Assignee: iAnywhere Solutions, Inc.
- Current Assignee: iAnywhere Solutions, Inc.
- Current Assignee Address: US CA Dublin
- Agency: Sterne, Kessler, Goldstein & Fox P.L.L.C.
- Main IPC: G06F17/30
- IPC: G06F17/30

Abstract:
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.
Public/Granted literature
- US20120166446A1 INDEXING SPATIAL DATA WITH A QUADTREE INDEX HAVING COST-BASED QUERY DECOMPOSITION Public/Granted day:2012-06-28
Information query