公开(公告)号：US20130006964A1

公开(公告)日：2013-01-03

申请号：US13172573

申请日：2011-06-29

申请人： Beda Christoph Hammerschmidt ,  Zhen Hua Liu ,  Geeta Arora ,  Thomas Baby

发明人： Beda Christoph Hammerschmidt ,  Zhen Hua Liu ,  Geeta Arora ,  Thomas Baby

IPC分类号： G06F17/30

CPC分类号： G06F17/30929

摘要： A method and apparatus for automatically analyzing and providing feedback regarding the optimizability of a relational database query. A query developer's primary goal is to ensure that queries and DML operations are rewritten for the most efficient execution. Rewrite diagnosability captures metadata for each attempted query optimization including success or failure and the reasons for failure. The metadata is stored in association with the operators that were not removed through rewriting. Once all optimizations have been attempted and rewriting is complete, the metadata is selectively displayed based on the cost to perform the associated operation. The context of performing the operation may affect the cost. The cost may be based at least on the type of operation and where within the query tree the operation is located. A query developer may configure the database system not to execute the resulting query plan based on one or more criteria.

摘要翻译： 一种用于自动分析和提供关于关系数据库查询的可优化性的反馈的方法和装置。 查询开发人员的主要目标是确保查询和DML操作被重写以实现最有效的执行。 重写诊断能力捕获每个尝试的查询优化的元数据，包括成功或失败以及失败的原因。 元数据与未通过重写删除的运算符相关联存储。 一旦尝试了所有优化并重写完成后，将根据执行相关操作的成本选择性地显示元数据。 执行操作的上下文可能会影响成本。 成本可以至少基于操作类型以及操作所在查询树中的哪一个。 查询开发人员可以将数据库系统配置为不基于一个或多个标准执行生成的查询计划。

公开(公告)号：US09767214B2

公开(公告)日：2017-09-19

申请号：US13172573

申请日：2011-06-29

申请人： Beda Christoph Hammerschmidt ,  Zhen Hua Liu ,  Geeta Arora ,  Thomas Baby

发明人： Beda Christoph Hammerschmidt ,  Zhen Hua Liu ,  Geeta Arora ,  Thomas Baby

IPC分类号： G06F7/00 ,  G06F17/00 ,  G06F17/30

CPC分类号： G06F17/30929

摘要： A method and apparatus for automatically analyzing and providing feedback regarding the optimizability of a relational database query. A query developer's primary goal is to ensure that queries and DML operations are rewritten for the most efficient execution. Rewrite diagnosability captures metadata for each attempted query optimization including success or failure and the reasons for failure. The metadata is stored in association with the operators that were not removed through rewriting. Once all optimizations have been attempted and rewriting is complete, the metadata is selectively displayed based on the cost to perform the associated operation. The context of performing the operation may affect the cost. The cost may be based at least on the type of operation and where within the query tree the operation is located. A query developer may configure the database system not to execute the resulting query plan based on one or more criteria.

公开(公告)号：US09424365B2

公开(公告)日：2016-08-23

申请号：US12610164

申请日：2009-10-30

申请人： Beda Christoph Hammerschmidt ,  Zhen Hua Liu ,  Thomas Baby

发明人： Beda Christoph Hammerschmidt ,  Zhen Hua Liu ,  Thomas Baby

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30917 ,  G06F17/30241 ,  G06F17/30327

摘要： Techniques and approaches are provided for creating indexes and column constraints on structured XML data that is stored in a relational database. Data Definition Language (DDL) Create Index and Create Constraint commands have extended syntax that allows the specification of a path-based expression instead of requiring a column and table name. A mapping created by the system when an XML Schema is registered stores the correspondence of XML data elements to automatically-created database tables and columns that are given names only useful for the internal system. When a user provides a path-based expression in a DDL when creating an index or constraint, the path-based expression is translated to the underlying database constructs using the mapping. Issues are addressed for handling path-based expressions that evaluate to more than one element. Additional index optimization is described using data type information available in the XML schema to select the optimal index type.

摘要翻译： 提供了技术和方法，用于为存储在关系数据库中的结构化XML数据创建索引和列约束。 数据定义语言（DDL）创建索引和创建约束命令具有扩展语法，允许指定基于路径的表达式，而不需要列和表名称。 在注册XML模式时由系统创建的映射将XML数据元素的对应关系存储到自动创建的数据库表和列，这些列和列仅对内部系统有用。 当用户在创建索引或约束时在DDL中提供基于路径的表达式时，基于路径的表达式将使用映射转换为底层数据库结构。 处理针对评估多个元素的基于路径的表达式的问题。 使用XML模式中可用的数据类型信息来描述附加索引优化，以选择最佳索引类型。

公开(公告)号：US20110106812A1

公开(公告)日：2011-05-05

申请号：US12610164

申请日：2009-10-30

申请人： Beda Christoph Hammerschmidt ,  Zhen Hua Liu ,  Thomas Baby

发明人： Beda Christoph Hammerschmidt ,  Zhen Hua Liu ,  Thomas Baby

IPC分类号： G06F7/00

CPC分类号： G06F17/30917 ,  G06F17/30241 ,  G06F17/30327

摘要： Techniques and approaches are provided for creating indexes and column constraints on structured XML data that is stored in a relational database. Data Definition Language (DDL) Create Index and Create Constraint commands have extended syntax that allows the specification of a path-based expression instead of requiring a column and table name. A mapping created by the system when an XML Schema is registered stores the correspondence of XML data elements to automatically-created database tables and columns that are given names only useful for the internal system. When a user provides a path-based expression in a DDL when creating an index or constraint, the path-based expression is translated to the underlying database constructs using the mapping. Issues are addressed for handling path-based expressions that evaluate to more than one element. Additional index optimization is described using data type information available in the XML schema to select the optimal index type.

摘要翻译： 提供了技术和方法，用于为存储在关系数据库中的结构化XML数据创建索引和列约束。 数据定义语言（DDL）创建索引和创建约束命令具有扩展语法，允许指定基于路径的表达式，而不需要列和表名称。 在注册XML模式时由系统创建的映射将XML数据元素的对应关系存储到自动创建的数据库表和列，这些列和列仅对内部系统有用。 当用户在创建索引或约束时在DDL中提供基于路径的表达式时，基于路径的表达式将使用映射转换为底层数据库结构。 处理针对评估多个元素的基于路径的表达式的问题。 使用XML模式中可用的数据类型信息来描述附加索引优化，以选择最佳索引类型。

公开(公告)号：US20140067819A1

公开(公告)日：2014-03-06

申请号：US13604402

申请日：2012-09-05

申请人： Anguel Novoselsky ,  Zhen Hua Liu ,  Thomas Baby

发明人： Anguel Novoselsky ,  Zhen Hua Liu ,  Thomas Baby

IPC分类号： G06F17/30

CPC分类号： G06F16/83

摘要： A method and apparatus are provided for building and using a persistent XML tree index for navigating an XML document. The XML tree index is stored separately from the XML document content, and thus is able to optimize performance through the use of fixed-sized index entries. The XML document hierarchy need not be constructed in volatile memory, so creating and using the XML tree index scales even for large documents. To evaluate a path expression including descendent or ancestral syntax, navigation links can be read from persistent storage and used directly to find the nodes specified in the path expression. The use of an abstract navigational interface allows applications to be written that are independent of the storage implementation of the index and the content. Thus, the XML tree index can index documents stored at least in a database, a persistent file system, or as a sequence of in memory.

摘要翻译： 提供了一种用于构建和使用用于导航XML文档的持久XML树索引的方法和装置。 XML树索引与XML文档内容分开存储，因此能够通过使用固定大小的索引条目来优化性能。 XML文档层次结构不需要在易失性存储器中构建，因此创建和使用XML树索引即使对于大型文档也会进行缩放。 要评估包含后代或祖先语法的路径表达式，导航链接可以从持久存储读取，并直接用于查找路径表达式中指定的节点。 使用抽象导航界面允许写入独立于索引和内容的存储实现的应用程序。 因此，XML树索引可以索引至少存储在数据库中的文档，持久文件系统或作为内存中的序列。

公开(公告)号：US08219563B2

公开(公告)日：2012-07-10

申请号：US12346327

申请日：2008-12-30

申请人： Thomas Baby ,  Zhen Hua Liu ,  Wesley Lin

发明人： Thomas Baby ,  Zhen Hua Liu ,  Wesley Lin

IPC分类号： G06F17/30

CPC分类号： G06F17/30911

摘要： Techniques are provided for searching within a collection of XML documents. A relational table in an XML index stores an entry for each node of a set of nodes in the collection. Each entry of the relational table stores an order key and a path identifier along with the atomized value of the node. An index on the atomized value provides a mechanism to perform a node-aware full-text search. Instead of storing the atomized value in the table, a virtual column may be created to represent, for each node, the atomized value of the node. Alternately, each entry of the relational table stores an order key and a path identifier along with, for simple nodes, the atomized value, and for complex nodes, a null value. For a complex node with a descendant text node, a separate entry is stored for the descendant text node in the relational table.

摘要翻译： 提供了在XML文档集合内进行搜索的技术。 XML索引中的关系表存储集合中一组节点的每个节点的条目。 关系表的每个条目存储订单密钥和路径标识符以及节点的雾化值。 雾化值上的索引提供了执行节点感知全文搜索的机制。 不用在表中存储雾化值，而是可以创建一个虚拟列，以便为每个节点表示节点的雾化值。 或者，关系表的每个条目存储订单密钥和路径标识符，对于简单节点，存在雾化值，对于复杂节点存储空值。 对于具有后代文本节点的复杂节点，为关系表中的后代文本节点存储单独的条目。

公开(公告)号：US20100211560A1

公开(公告)日：2010-08-19

申请号：US12388249

申请日：2009-02-18

申请人： Zhen Hua Liu ,  Thomas Baby ,  Sukhendu Chakraborty ,  Anguel Novoselsky

发明人： Zhen Hua Liu ,  Thomas Baby ,  Sukhendu Chakraborty ,  Anguel Novoselsky

IPC分类号： G06F17/30 ,  G06F12/02 ,  G06F7/00

CPC分类号： G06F17/30929

摘要： Techniques are provided for efficiently evaluating XML queries that conform to an extension of an XML language (e.g., XQuery or XPath). The extension allows XML queries to have full-text search capabilities. Such an XML query is compiled to generate a tree of nodes that correspond to one or more conditions in the full-text portion of the query. In one technique, the amount of memory for the execution state of the tree is determined at compile time and allocated only once throughout execution of the query. In another technique, to ensure at most a single scan of a document, all the words or phrases in the full-text portion of an XML query are located before any of the other conditions in the full-text portion are evaluated. In another technique, the elements of the full-text portion of an XML query are analyzed to determine, based at least in part on cost, which evaluation strategy, of a plurality of evaluation strategies, should be employed.

摘要翻译： 提供了有效评估符合XML语言（例如，XQuery或XPath）的扩展的XML查询的技术。 该扩展允许XML查询具有全文搜索功能。 编译这样的XML查询以生成与查询的全文部分中的一个或多个条件相对应的节点树。 在一种技术中，树的执行状态的内存量在编译时确定，并且在执行查询时只分配一次。 在另一种技术中，为了确保文档的单次扫描，XML查询的全文部分中的所有单词或短语位于全文部分中的任何其他条件之前。 在另一技术中，分析XML查询的全文部分的元素，至少部分地基于成本来确定应当采用多个评估策略的哪个评估策略。

公开(公告)号：US10698953B2

公开(公告)日：2020-06-30

申请号：US13604402

申请日：2012-09-05

申请人： Anguel Novoselsky ,  Zhen Hua Liu ,  Thomas Baby

发明人： Anguel Novoselsky ,  Zhen Hua Liu ,  Thomas Baby

IPC分类号： G06F7/00 ,  G06F17/30 ,  G06F16/83

摘要： A method and apparatus are provided for building and using a persistent XML tree index for navigating an XML document. The XML tree index is stored separately from the XML document content, and thus is able to optimize performance through the use of fixed-sized index entries. The XML document hierarchy need not be constructed in volatile memory, so creating and using the XML tree index scales even for large documents. To evaluate a path expression including descendent or ancestral syntax, navigation links can be read from persistent storage and used directly to find the nodes specified in the path expression. The use of an abstract navigational interface allows applications to be written that are independent of the storage implementation of the index and the content. Thus, the XML tree index can index documents stored at least in a database, a persistent file system, or as a sequence of in memory.

公开(公告)号：US08583652B2

公开(公告)日：2013-11-12

申请号：US12956264

申请日：2010-11-30

申请人： Beda Hammerschmidt ,  Zhen Hua Liu ,  Thomas Baby ,  Kongyi Zhou

发明人： Beda Hammerschmidt ,  Zhen Hua Liu ,  Thomas Baby ,  Kongyi Zhou

IPC分类号： G06F17/30

CPC分类号： G06F17/30312 ,  G06F17/30595

摘要： A method, device, and non-transitory computer-readable storage medium are provided for efficiently registering a relational schema. In co-compilation and data guide approaches, a subset of entities from schema descriptions are selected for physical registration, and other entities from the schema descriptions are not physically registered. In the co-compilation approach, a first schema description references a second schema description, and the subset includes a set of entities from the second schema description that are used by the first schema description. In the data guide approach, the subset includes entities that are used by a set of structured documents. In a pay-as-you-go approach, schema registration includes logically registering entities without creating relational database structures corresponding to the entities. A database server may execute database commands that reference the logically registered entities. A request to store data for the entities may be executed by creating relational database structures to store the data.

摘要翻译： 提供了一种用于有效地注册关系模式的方法，设备和非暂时计算机可读存储介质。 在共同编译和数据指南方法中，选择了来自模式描述的实体的子集用于物理注册，并且来自模式描述的其他实体没有物理注册。 在共同编译方法中，第一模式描述引用第二模式描述，并且该子集包括来自第一模式描述使用的第二模式描述的一组实体。 在数据指南方法中，子集包括由一组结构化文档使用的实体。 在现收现付方式中，模式注册包括逻辑注册实体，而不创建与实体相对应的关系数据库结构。 数据库服务器可以执行引用逻辑注册实体的数据库命令。 可以通过创建关系数据库结构来存储数据来执行用于存储实体的数据的请求。

公开(公告)号：US20110179085A1

公开(公告)日：2011-07-21

申请号：US12690820

申请日：2010-01-20

申请人： Beda Hammerschmidt ,  Thomas Baby ,  Zhen Hua Liu ,  Siddharth Patel

发明人： Beda Hammerschmidt ,  Thomas Baby ,  Zhen Hua Liu ,  Siddharth Patel

IPC分类号： G06F17/30

CPC分类号： G06F17/30935 ,  G06F17/30911

摘要： A method and apparatus is provided for efficiently searching and navigating XML data stored in a relational database. When storing a collection of XML documents, certain scalar elements may be shredded and stored in a relational table, whereas unstructured data may be stored as a CLOB or BLOB column. The approach includes identifying a reference address to within an XML tree index entry and storing the address in an xmltable index. The tree index entry allows for navigation in all axes. A path-based expression may be evaluated in the context of the reference address of the LOB. The result of the evaluation identifies another XML tree index entry containing a LOB locator used to retrieve the content from the document. The tree index, node index, and secondary function indexes are used together to enhance the performance of querying the XML data.

摘要翻译： 提供了一种用于有效地搜索和导航存储在关系数据库中的XML数据的方法和装置。 当存储XML文档的集合时，某些标量元素可以被切割并存储在关系表中，而非结构化数据可以被存储为CLOB或BLOB列。 该方法包括在XML树索引条目中标识参考地址并将该地址存储在xmltable索引中。 树索引条目允许在所有轴上导航。 可以在LOB的参考地址的上下文中评估基于路径的表达式。 评估结果标识另一个XML树索引条目，其中包含用于从文档中检索内容的LOB定位器。 树索引，节点索引和辅助功能索引一起用于增强查询XML数据的性能。