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

1. 发明授权

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

2. 发明申请

US20120136868A1 EFFICIENTLY REGISTERING A RELATIONAL SCHEMA 有权
标题翻译：有效地注册关系图
公开(公告)号：US20120136868A1
公开(公告)日：2012-05-31
申请号：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.
摘要翻译：提供了一种用于有效地注册关系模式的方法，设备和非暂时计算机可读存储介质。在共同编译和数据指南方法中，选择了来自模式描述的实体的子集用于物理注册，并且来自模式描述的其他实体没有物理注册。在共同编译方法中，第一模式描述引用第二模式描述，并且该子集包括来自第一模式描述使用的第二模式描述的一组实体。在数据指南方法中，子集包括由一组结构化文档使用的实体。在现收现付方式中，模式注册包括逻辑注册实体，而不创建与实体相对应的关系数据库结构。数据库服务器可以执行引用逻辑注册实体的数据库命令。可以通过创建关系数据库结构来存储数据来执行用于存储实体的数据的请求。

3. 发明申请

US20110179085A1 Using Node Identifiers In Materialized XML Views And Indexes To Directly Navigate To And Within XML Fragments 有权
标题翻译：在物化XML视图和索引中使用节点标识符直接导航到XML片段中
公开(公告)号：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数据的性能。

4. 发明授权

US08346813B2 Using node identifiers in materialized XML views and indexes to directly navigate to and within XML fragments 有权
标题翻译：在物化的XML视图和索引中使用节点标识符直接导航到XML片段内部和内部
公开(公告)号：US08346813B2
公开(公告)日：2013-01-01
申请号：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数据的性能。

5. 发明授权

US08566343B2 Searching backward to speed up query 有权
标题翻译：向后搜索以加快查询速度
公开(公告)号：US08566343B2
公开(公告)日：2013-10-22
申请号：US12871869
申请日：2010-08-30
申请人： Thomas Baby , Sukhendu Chakraborty , Junyan Ding , Zhen Hua Liu , Anguel Novoselsky
发明人： Thomas Baby , Sukhendu Chakraborty , Junyan Ding , Zhen Hua Liu , Anguel Novoselsky
IPC分类号： G06F17/30
CPC分类号： G06F17/30539
摘要： A method, computing device, and a non-transitory computer-readable medium are provided for performing a context-aware search by finding a set of nodes that are mapped to a given text or other value and, for each node in the set of nodes, performing a reverse path lookup to determine whether the node satisfies a given context. The query processor performs the reverse path lookup for a node by traversing up a node tree away from the node, using a stored mapping from the node to a parent of the node. Using mappings from nodes to parent nodes, the node tree is traversed backwards from the node up to distant ancestor nodes through parent nodes. An optimizer instructs the query processor to perform a value-based portion of the search before a path-based portion of the search based on value distribution statistics and path distribution statistics.
摘要翻译：提供了一种方法，计算设备和非暂时计算机可读介质，用于通过找到映射到给定文本或其他值的节点集合来执行上下文感知搜索，并且对于节点集合中的每个节点，执行反向路径查找以确定节点是否满足给定的上下文。查询处理器通过使用存储的从节点到节点的父节点的映射来遍历节点之外的节点树来执行对节点的反向路径查找。使用从节点到父节点的映射，节点树通过父节点从节点向后穿过远处的祖先节点。优化器指示查询处理器在基于值分布统计和路径分布统计的基于路径的搜索部分之前执行搜索的基于值的部分。

6. 发明申请

US20130006964A1 Technique and Framework to Provide Diagnosability for XML Query/DML Rewrite and XML Index Selection 有权
标题翻译：为XML查询/ DML重写和XML索引选择提供可诊断性的技术和框架
公开(公告)号：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操作被重写以实现最有效的执行。重写诊断能力捕获每个尝试的查询优化的元数据，包括成功或失败以及失败的原因。元数据与未通过重写删除的运算符相关联存储。一旦尝试了所有优化并重写完成后，将根据执行相关操作的成本选择性地显示元数据。执行操作的上下文可能会影响成本。成本可以至少基于操作类型以及操作所在查询树中的哪一个。查询开发人员可以将数据库系统配置为不基于一个或多个标准执行生成的查询计划。

7. 发明申请

US20100169354A1 Indexing Mechanism for Efficient Node-Aware Full-Text Search Over XML 有权
标题翻译：用于高效节点感知的索引机制通过XML进行全文搜索
公开(公告)号：US20100169354A1
公开(公告)日：2010-07-01
申请号：US12346327
申请日：2008-12-30
申请人： Thomas Baby , Zhen Hua Liu , Wesley Lin
发明人： Thomas Baby , Zhen Hua Liu , Wesley Lin
IPC分类号： G06F7/06 , 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索引中的关系表存储集合中一组节点的每个节点的条目。关系表的每个条目存储订单密钥和路径标识符以及节点的雾化值。雾化值上的索引提供了执行节点感知全文搜索的机制。不用在表中存储雾化值，而是可以创建一个虚拟列，以便为每个节点表示节点的雾化值。或者，关系表的每个条目存储订单密钥和路径标识符，对于简单节点，存在雾化值，对于复杂节点存储空值。对于具有后代文本节点的复杂节点，为关系表中的后代文本节点存储单独的条目。

8. 发明申请

US20090287719A1 CREATING STORAGE FOR XML SCHEMAS WITH LIMITED NUMBERS OF COLUMNS PER TABLE 有权
标题翻译：创建具有每表列的有限数量的XML方案的存储
公开(公告)号：US20090287719A1
公开(公告)日：2009-11-19
申请号：US12122589
申请日：2008-05-16
申请人： James W. Warner , Thomas Baby , Zhen Hua Liu
发明人： James W. Warner , Thomas Baby , Zhen Hua Liu
IPC分类号： G06F17/30
CPC分类号： G06F17/30917
摘要： Techniques are described herein for automatically generating multiple interrelated database tables to store XML data, while ensuring that each such table has no more than the maximum DBMS-allowed number of columns. In response to the registration of an XML schema with a database server, the server determines whether any of the elements specified in the XML schema are complex elements that have more than a threshold number of descendant elements. If a complex element has more than the threshold number of descendant elements, then the server automatically generates one or more separate “out-of-line” database tables for storing at least some of those descendant elements, so that the table created to store the complex element will have no more than the permitted number of columns. Each of the out-of-line database tables is similarly generated so as to have no more than the permitted number of columns.
摘要翻译：这里描述了用于自动生成多个相互关联的数据库表以存储XML数据的技术，同时确保每个这样的表具有不超过DBMS允许的最大列数。响应于XML模式与数据库服务器的注册，服务器确定XML模式中指定的任何元素是否是具有多于阈值数量的后代元素的复杂元素。如果复杂元素具有超过阈值数量的后代元素，则服务器自动生成一个或多个单独的“行外”数据库表，用于存储这些后代元素中的至少一些，使得创建用于存储复杂元素将不超过允许的列数。类似地生成每个外联数据库表，以便不超过允许的列数。

9. 发明授权

US10698953B2 Efficient XML tree indexing structure over XML content 有权
公开(公告)号：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.

10. 发明授权

US09767214B2 Technique and framework to provide diagnosability for XML query/DML rewrite and XML index selection 有权
公开(公告)号：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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式