专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20050108209A1 Context quantifier transformation in XML query rewrite 失效
标题翻译： XML查询重写中的上下文量词变换
公开(公告)号：US20050108209A1
公开(公告)日：2005-05-19
申请号：US10717870
申请日：2003-11-19
申请人： Kevin Beyer , Roberta Cochrane , Fatma Ozcan , Normen Seemann
发明人： Kevin Beyer , Roberta Cochrane , Fatma Ozcan , Normen Seemann
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30935 , G06F17/30932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： An XML query compilation processor (20) includes an execution compiler (42) that transforms an XML query into an executable XML query plan (22). A query rewrite processor (34) performs query transformations on the XML query. Said query transformations include transforming an expression input (60) received by an expression (62) conditional upon a set of items defined by an output (64) of the expression (62) being independent of grouping of items in the expression input (60).
摘要翻译： XML查询编译处理器（20）包括将XML查询转换成可执行XML查询计划（22）的执行编译器（42）。查询重写处理器（34）对XML查询执行查询转换。所述查询变换包括变换由表达式（62）接收的表达式输入（60），该表达式输入（60）是由表达式（62）的输出（64）定义的一组项独立于表达式输入（60）中的项目的分组而条件的。。

2. 发明申请

US20050097084A1 XPath containment for index and materialized view matching 有权
标题翻译： XPath包含索引和物化视图匹配
公开(公告)号：US20050097084A1
公开(公告)日：2005-05-05
申请号：US10698622
申请日：2003-10-31
申请人： Andrey Balmin , Kevin Beyer , Roberta Cochrane , Fatma Ozcan , Mir Pirahesh
发明人： Andrey Balmin , Kevin Beyer , Roberta Cochrane , Fatma Ozcan , Mir Pirahesh
IPC分类号： G06F17/30
CPC分类号： G06F17/30935 , G06F17/30457 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： A method for using pre-computed information stored in auxiliary structures to speed up processing of expensive queries on hierarchical documents such as XML documents being queried using XPath. The invention defines a taxonomy of such structures such as indexes and materialized views for storing pre-computed XPath results (PXRs), determines what portion of the query can be evaluated by the structures, and computes the compensation for the results generated by the structures. The invention detects all structures applicable to the query and rewrites the query to use such structures, speeding up the performance of the queries. The invention identifies the matching structures by detecting containment mappings between XPath expressions in the query and the structure. The invention also includes a new representation for XPath expressions that is rich enough to express all features of XPath.
摘要翻译：使用存储在辅助结构中的预先计算的信息的方法，用于加速使用XPath查询的诸如XML文档之类的分层文档上的昂贵查询的处理。本发明定义了这种结构的分类法，例如用于存储预先计算的XPath结果（PXR）的索引和物化视图，确定该结构可以评估查询的哪些部分，并且计算由结构生成的结果的补偿。本发明检测适用于查询的所有结构，并重写查询以使用这种结构，加速查询的执行。本发明通过检测查询中的XPath表达式和结构之间的容纳映射来识别匹配结构。本发明还包括XPath表达式的新表示，其足以表达XPath的所有特征。

3. 发明授权

US07165063B2 Context quantifier transformation in XML query rewrite 失效
标题翻译： XML查询重写中的上下文量词变换
公开(公告)号：US07165063B2
公开(公告)日：2007-01-16
申请号：US10717870
申请日：2003-11-19
申请人： Kevin S. Beyer , Roberta J. Cochrane , Fatma Ozcan , Normen Seemann
发明人： Kevin S. Beyer , Roberta J. Cochrane , Fatma Ozcan , Normen Seemann
IPC分类号： G06F17/30
CPC分类号： G06F17/30935 , G06F17/30932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： An XML query compilation processor (20) includes an execution compiler (42) that transforms an XML query into an executable XML query plan (22). A query rewrite processor (34) performs query transformations on the XML query. Said query transformations include transforming an expression input (60) received by an expression (62) conditional upon a set of items defined by an output (64) of the expression (62) being independent of grouping of items in the expression input (60).
摘要翻译： XML查询编译处理器（20）包括将XML查询转换成可执行XML查询计划（22）的执行编译器（42）。查询重写处理器（34）对XML查询执行查询转换。所述查询变换包括变换由表达式（62）接收的表达式输入（60），该表达式输入（60）是由表达式（62）的输出（64）定义的一组项独立于表达式输入（60）中的项目的分组而条件的。。

4. 发明申请

US20090259641A1 OPTIMIZATION OF EXTENSIBLE MARKUP LANGUAGE PATH LANGUAGE (XPATH) EXPRESSIONS IN A DATABASE MANAGEMENT SYSTEM CONFIGURED TO ACCEPT EXTENSIBLE MARKUP LANGUAGE (XML) QUERIES 有权
标题翻译：配置为接受可扩展标记语言（XML）查询的数据库管理系统中的可扩展标记语言路径语言（XPATH）表达式的优化
公开(公告)号：US20090259641A1
公开(公告)日：2009-10-15
申请号：US12101141
申请日：2008-04-10
申请人： Andrey Balmin , Fatma Ozcan , Tam Minh Tran
发明人： Andrey Balmin , Fatma Ozcan , Tam Minh Tran
IPC分类号： G06F7/06 , G06F17/30
CPC分类号： G06F17/30923
摘要： An apparatus, system, and method are disclosed for optimization of XPath expressions in a database management system configured to accept XML queries. Operations of the method include receiving an XQuery representation and partitioning XPath expressions within the XQuery representation into a plurality of XPath expression clusters. The XPath expression clusters may comprise one or more XPath expressions and those in each cluster may operate on a common document. Furthermore, the XPath expressions in each cluster are hierarchically related to each other such that branch nodes of the cluster are executable independent of nodes in other XPath expression clusters. The method also defines merging the one or more XPath expressions into one or more expression trees for each XPath expression cluster. The method generates one or more query execution plans from the one or more XPath expression blocks. The method includes, for each query execution plan, splitting each of the XPath expression blocks into one or more ordered fragments. The method determines a cardinality according to database statistics and an execution cost for each XPath expression block within each query execution plan. Finally, the method determines an aggregate cardinality for each query execution plan and an aggregate execution cost for each query execution plan. Therefore, an XQuery may be optimized at both the global XQuery and local XPath expression block level, improving performance and reducing overhead.
摘要翻译：公开了一种用于在被配置为接受XML查询的数据库管理系统中优化XPath表达式的装置，系统和方法。该方法的操作包括接收XQuery表示并将XQuery表示内的XPath表达式分解成多个XPath表达式集群。 XPath表达式集群可以包括一个或多个XPath表达式，并且每个集群中的那些可以在公共文档上操作。此外，每个集群中的XPath表达式彼此分层相关，使得集群的分支节点可执行为独立于其他XPath表达式集群中的节点。该方法还定义将一个或多个XPath表达式合并到每个XPath表达式集群的一个或多个表达式树中。该方法从一个或多个XPath表达式块生成一个或多个查询执行计划。对于每个查询执行计划，该方法包括将每个XPath表达块分解成一个或多个有序的片段。该方法根据数据库统计信息确定基数，并确定每个查询执行计划中每个XPath表达式块的执行成本。最后，该方法确定每个查询执行计划的聚合基数以及每个查询执行计划的总执行成本。因此，可以在全局XQuery和本地XPath表达式块级别优化XQuery，从而提高性能并减少开销。

5. 发明申请

US20110184933A1 JOIN ALGORITHMS OVER FULL TEXT INDEXES 失效
标题翻译：在完整的文本索引上加入算法
公开(公告)号：US20110184933A1
公开(公告)日：2011-07-28
申请号：US12696013
申请日：2010-01-28
申请人： Latha Sankar Colby , Quanzhong Li , Fatma Ozcan , Mir Hamid Pirahesh , Eugene J. Shekita , Zografoula Vagena
发明人： Latha Sankar Colby , Quanzhong Li , Fatma Ozcan , Mir Hamid Pirahesh , Eugene J. Shekita , Zografoula Vagena
IPC分类号： G06F17/30
CPC分类号： G06F17/30498
摘要： According to one embodiment of the present invention, a method for processing join predicates in full-text indexes is provided. The method includes evaluating local predicates of an outer full text index to generate a first posting list of documents. For each document in the first posting list, the value of a join attribute is determined and an inner full text index is probed to obtain a second posting list of documents containing one of the join attributes determined for each document. Local predicates of an inner full text index are evaluated to generate a third posting list of documents, and the second posting list is merged with the third posting list to generate a merge list of documents. Documents in the first posting list may be paired up with documents in the merge list.
摘要翻译：根据本发明的一个实施例，提供了一种用于处理全文索引中的连接谓词的方法。该方法包括评估外部全文本索引的本地谓词以生成文档的第一张贴列表。对于第一个发布列表中的每个文档，确定连接属性的值，并探测内部全文索引以获取包含为每个文档确定的连接属性之一的文档的第二个发布列表。评估内部全文本索引的本地谓词以生成文档的第三张发布列表，并且将第二张发布列表与第三张发布列表合并以生成文档的合并列表。第一个发布列表中的文档可能与合并列表中的文档配对。

6. 发明授权

US07716210B2 Method and apparatus for XML query evaluation using early-outs and multiple passes 有权
标题翻译：使用早期和多次通过的XML查询评估的方法和装置
公开(公告)号：US07716210B2
公开(公告)日：2010-05-11
申请号：US11613944
申请日：2006-12-20
申请人： Fatma Ozcan , Edison Lao Ting
发明人： Fatma Ozcan , Edison Lao Ting
IPC分类号： G06F17/30
CPC分类号： G06F17/30935
摘要： A method and apparatus is disclosed for XML query evaluation using early-outs and multiple passes to evaluate an XML query. A multi-pass evaluation procedure evaluates the XML query one step at a time as needed to complete evaluation. The multi-pass evaluation procedure evaluates XML queries containing logical expressions such as “AND” expressions, “OR” expressions, and implied “AND” expressions within “FOR” clauses. Queries containing logical expressions are often satisfied before every component is evaluated. Thus, executing the multi-pass evaluation procedure allows the evaluation to exit early when the veracity of the query is determined, not necessarily when every component has been evaluated. The multi-pass evaluation procedure executes as long as a descendant axis of the XML query need not be evaluated past a child node. When evaluation of a descendant axis past a child node is required, the multi-pass evaluation procedure may switch to a single-pass evaluation procedure to complete evaluation.
摘要翻译：公开了一种用于XML查询评估的方法和装置，其使用早期和多次来评估XML查询。多遍评估过程根据需要一次评估XML查询，以完成评估。多遍评估过程评估包含逻辑表达式的XML查询，例如“AND”表达式，“OR”表达式和“FOR”子句中的隐含“AND”表达式。在评估每个组件之前，经常会满足包含逻辑表达式的查询。因此，执行多遍评估过程允许评估在确定查询的真实性时提前退出，而不一定在每个组件被评估之后。只要不需要通过子节点对XML查询的后代轴进行求值，就执行多遍评估过程。当需要对后代轴进行评估时，多路径评估程序可以转换为单程评估程序来完成评估。

7. 发明授权

US08661019B2 Join algorithms over full text indexes 失效
标题翻译：在全文索引上加入算法
公开(公告)号：US08661019B2
公开(公告)日：2014-02-25
申请号：US12696013
申请日：2010-01-28
申请人： Latha Sankar Colby , Quanzhong Li , Fatma Ozcan , Mir Hamid Pirahesh , Eugene J. Shekita , Zografoula Vagena
发明人： Latha Sankar Colby , Quanzhong Li , Fatma Ozcan , Mir Hamid Pirahesh , Eugene J. Shekita , Zografoula Vagena
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30498
摘要： According to one embodiment of the present invention, a method for processing join predicates in full-text indexes is provided. The method includes evaluating local predicates of an outer full text index to generate a first posting list of documents. For each document in the first posting list, the value of a join attribute is determined and an inner full text index is probed to obtain a second posting list of documents containing one of the join attributes determined for each document. Local predicates of an inner full text index are evaluated to generate a third posting list of documents, and the second posting list is merged with the third posting list to generate a merge list of documents. Documents in the first posting list may be paired up with documents in the merge list.
摘要翻译：根据本发明的一个实施例，提供了一种用于处理全文索引中的连接谓词的方法。该方法包括评估外部全文本索引的本地谓词以生成文档的第一张贴列表。对于第一个发布列表中的每个文档，确定连接属性的值，并探测内部全文索引以获取包含为每个文档确定的连接属性之一的文档的第二个发布列表。评估内部全文本索引的本地谓词以生成文档的第三张发布列表，并且将第二张发布列表与第三张发布列表合并以生成文档的合并列表。第一个发布列表中的文档可能与合并列表中的文档配对。

8. 发明申请

US20080154868A1 METHOD AND APPARATUS FOR XML QUERY EVALUATION USING EARLY-OUTS AND MULTIPLE PASSES 有权
标题翻译：使用早期和多次通行的XML查询评估的方法和设备
公开(公告)号：US20080154868A1
公开(公告)日：2008-06-26
申请号：US11613944
申请日：2006-12-20
申请人： Fatma Ozcan , Edison Lao Ting
发明人： Fatma Ozcan , Edison Lao Ting
IPC分类号： G06F7/00
CPC分类号： G06F17/30935
摘要： A method and apparatus is disclosed for XML query evaluation using early-outs and multiple passes to evaluate an XML query. A multi-pass evaluation procedure evaluates the XML query one step at a time as needed to complete evaluation. The multi-pass evaluation procedure evaluates XML queries containing logical expressions such as “AND” expressions, “OR” expressions, and implied “AND” expressions within “FOR” clauses. Queries containing logical expressions are often satisfied before every component is evaluated. Thus, executing the multi-pass evaluation procedure allows the evaluation to exit early when the veracity of the query is determined, not necessarily when every component has been evaluated. The multi-pass evaluation procedure executes as long as a descendant axis of the XML query need not be evaluated past a child node. When evaluation of a descendant axis past a child node is required, the multi-pass evaluation procedure may switch to a single-pass evaluation procedure to complete evaluation.
摘要翻译：公开了一种用于XML查询评估的方法和装置，其使用早期和多次来评估XML查询。多遍评估过程根据需要一次评估XML查询，以完成评估。多遍评估过程评估包含逻辑表达式的XML查询，例如“AND”表达式，“OR”表达式和“FOR”子句中的隐含“AND”表达式。在评估每个组件之前，经常会满足包含逻辑表达式的查询。因此，执行多遍评估过程允许评估在确定查询的真实性时提前退出，而不一定在每个组件被评估之后。只要不需要通过子节点对XML查询的后代轴进行求值，就执行多遍评估过程。当需要对后代轴进行评估时，多路径评估程序可以转换为单程评估程序来完成评估。

9. 发明授权

US07315852B2 XPath containment for index and materialized view matching 有权
标题翻译： XPath包含索引和物化视图匹配
公开(公告)号：US07315852B2
公开(公告)日：2008-01-01
申请号：US10698622
申请日：2003-10-31
申请人： Audrey L. Balmin , Kevin S. Beyer , Roberta Jo Cochrane , Fatma Ozcan , Mir Hamid Pirahesh
发明人： Audrey L. Balmin , Kevin S. Beyer , Roberta Jo Cochrane , Fatma Ozcan , Mir Hamid Pirahesh
IPC分类号： G06F17/30
CPC分类号： G06F17/30935 , G06F17/30457 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： A method for using pre-computed information stored in auxiliary structures to speed up processing of expensive queries on hierarchical documents such as XML documents being queried using XPath. The invention defines a taxonomy of such structures such as indexes and materialized views for storing pre-computed XPath results (PXRs), determines what portion of the query can be evaluated by the structures, and computes the compensation for the results generated by the structures. The invention detects all structures applicable to the query and rewrites the query to use such structures, speeding up the performance of the queries. The invention identifies the matching structures by detecting containment mappings between XPath expressions in the query and the structure. The invention also includes a new representation for XPath expressions that is rich enough to express all features of XPath.
摘要翻译：使用存储在辅助结构中的预先计算的信息的方法，用于加速使用XPath查询的诸如XML文档之类的分层文档上的昂贵查询的处理。本发明定义了这种结构的分类法，例如用于存储预先计算的XPath结果（PXR）的索引和物化视图，确定该结构可以评估查询的哪些部分，并且计算由结构生成的结果的补偿。本发明检测适用于查询的所有结构，并重写查询以使用这种结构，加速查询的执行。本发明通过检测查询中的XPath表达式和结构之间的容纳映射来识别匹配结构。本发明还包括XPath表达式的新表示，其足以表达XPath的所有特征。

10. 发明授权

US07865502B2 Optimization of extensible markup language path language (XPATH) expressions in a database management system configured to accept extensible markup language (XML) queries 有权
标题翻译：配置为接受可扩展标记语言（XML）查询的数据库管理系统中的可扩展标记语言路径语言（XPATH）表达式的优化
公开(公告)号：US07865502B2
公开(公告)日：2011-01-04
申请号：US12101141
申请日：2008-04-10
申请人： Andrey Balmin , Fatma Ozcan , Tam Minh Dai Tran
发明人： Andrey Balmin , Fatma Ozcan , Tam Minh Dai Tran
IPC分类号： G06F7/00
CPC分类号： G06F17/30923
摘要： An apparatus, system, and method are disclosed for optimization of XPath expressions in a database management system configured to accept XML queries. Operations of the method include receiving an XQuery representation and partitioning XPath expressions within the XQuery representation into a plurality of XPath expression clusters. The XPath expression clusters may comprise one or more XPath expressions and those in each cluster may operate on a common document. Furthermore, the XPath expressions in each cluster are hierarchically related to each other such that branch nodes of the cluster are executable independent of nodes in other XPath expression clusters. The method also defines merging the one or more XPath expressions into one or more expression trees for each XPath expression cluster. The method generates one or more query execution plans from the one or more XPath expression blocks. The method includes, for each query execution plan, splitting each of the XPath expression blocks into one or more ordered fragments. The method determines a cardinality according to database statistics and an execution cost for each XPath expression block within each query execution plan. Finally, the method determines an aggregate cardinality for each query execution plan and an aggregate execution cost for each query execution plan. Therefore, an XQuery may be optimized at both the global XQuery and local XPath expression block level, improving performance and reducing overhead.
摘要翻译：公开了一种用于在被配置为接受XML查询的数据库管理系统中优化XPath表达式的装置，系统和方法。该方法的操作包括接收XQuery表示并将XQuery表示内的XPath表达式分解成多个XPath表达式集群。 XPath表达式集群可以包括一个或多个XPath表达式，并且每个集群中的那些可以在公共文档上操作。此外，每个集群中的XPath表达式彼此分层相关，使得集群的分支节点可执行为独立于其他XPath表达式集群中的节点。该方法还定义将一个或多个XPath表达式合并到每个XPath表达式集群的一个或多个表达式树中。该方法从一个或多个XPath表达式块生成一个或多个查询执行计划。对于每个查询执行计划，该方法包括将每个XPath表达块分解成一个或多个有序的片段。该方法根据数据库统计信息确定基数，并确定每个查询执行计划中每个XPath表达式块的执行成本。最后，该方法确定每个查询执行计划的聚合基数以及每个查询执行计划的总执行成本。因此，可以在全局XQuery和本地XPath表达式块级别优化XQuery，从而提高性能并减少开销。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式