发明授权
US07840609B2 Using sibling-count in XML indexes to optimize single-path queries
有权
在XML索引中使用sibling-count来优化单路径查询
- 专利标题: Using sibling-count in XML indexes to optimize single-path queries
- 专利标题(中): 在XML索引中使用sibling-count来优化单路径查询
-
申请号: US11888415申请日: 2007-07-31
-
公开(公告)号: US07840609B2公开(公告)日: 2010-11-23
- 发明人: Sivasankaran Chandrasekar , Ravi Murthy , Thomas Baby , Nipun Agarwal
- 申请人: Sivasankaran Chandrasekar , Ravi Murthy , Thomas Baby , Nipun Agarwal
- 申请人地址: US CA Redwood Shores
- 专利权人: Oracle International Corporation
- 当前专利权人: Oracle International Corporation
- 当前专利权人地址: US CA Redwood Shores
- 代理机构: Hickman Palermo Truong & Becker LLP
- 主分类号: G06F7/00
- IPC分类号: G06F7/00
摘要:
A method and apparatus are provided for using sibling-counts in XML indices to optimize single-path queries. Using a b-tree XML index with a SQL query logarithmically reduces the number of disk accesses by passing over index entries where it is determined that a match will not be found. However, because certain index entries are passed over, it is impossible to ascertain if a path expression occurs more than once in the XML index, as certain queries sometimes require. This hurdle can be overcome by maintaining a sibling count with each node entry in the XML index. Because the sibling count is stored with the index entry, the index will reveal whether the matching node is single or has other siblings. In additional to re-writing the original query for optimization by use of an XML index, it will be re-written to check for a single-path condition in the index.
公开/授权文献
信息查询