公开(公告)号：US20090158262A1

公开(公告)日：2009-06-18

申请号：US11954757

申请日：2007-12-12

申请人： Anguel Novoselsky ,  Zhen Hua Liu

发明人： Anguel Novoselsky ,  Zhen Hua Liu

IPC分类号： G06F9/45

CPC分类号： G06F8/41

摘要： A system which combines sequential and iterative source code is provided. The system decides which type of processing would be most suitable for all portions of the source code, regardless of type. The system can adjust that decision based on the specific nature of the constructs within the source code, and can also adjust that decision based on the platform upon which the resulting executable program will run.

摘要翻译： 提供了组合顺序和迭代源代码的系统。 系统决定哪种类型的处理最适合源代码的所有部分，不管类型如何。 系统可以根据源代码中的构造的具体特性来调整该决策，并且还可以基于生成的可执行程序将运行的平台来调整该决策。

公开(公告)号：US07949941B2

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

申请号：US11261684

申请日：2005-10-28

申请人： Zhen Hua Liu ,  Muralidhar Krishnaprasad ,  Anguel Novoselsky

发明人： Zhen Hua Liu ,  Muralidhar Krishnaprasad ,  Anguel Novoselsky

IPC分类号： G06F17/27

CPC分类号： G06F17/227 ,  G06F17/2247

摘要： Transformation of a set of XML documents via an XSLT stylesheet is made more efficient by rewriting the stylesheet at compile-time, based on the structural description of the set of XML documents, into an optimized stylesheet containing fewer dynamic template-matching calls than the original stylesheet. This rewritten stylesheet can be further rewritten into a set of XQuery expressions. At compile-time, the particular transformation templates that are appropriate for transforming the particular nodes contained in the set of XML documents are determined, and XSLT calls to the templates are converted to calls to corresponding XQuery user-defined functions. Determination of the appropriate transformation templates may be based on the structural description of the input set of XML documents, such as an XML Schema or Document Type Definition. The data from each template is translated into corresponding XQuery constructors, instructions from the template are translated into XQuery expressions, and the XQuery functions are inlined if possible.

摘要翻译： 通过XSLT样式表转换一组XML文档通过将编译时的样式表（基于XML文档集的结构描述）重写为优化样式表，使其具有比原始文本更少的动态模板匹配调用 样式表。 这个重写的样式表可以进一步重写成一组XQuery表达式。 在编译时，确定适合于转换XML文档集中的特定节点的特定转换模板，并将XSLT对模板的调用转换为对相应XQuery用户定义函数的调用。 确定适当的转换模板可以基于XML文档的输入集合的结构描述，例如XML模式或文档类型定义。 来自每个模板的数据被转换为相应的XQuery构造函数，模板中的指令将被转换为XQuery表达式，如果可能的话XQuery函数是内联的。

公开(公告)号：US08434076B2

公开(公告)日：2013-04-30

申请号：US11954757

申请日：2007-12-12

申请人： Anguel Novoselsky ,  Zhen Hua Liu

发明人： Anguel Novoselsky ,  Zhen Hua Liu

IPC分类号： G06F9/45

CPC分类号： G06F8/41

摘要： A system which combines sequential and iterative source code is provided. The system decides which type of processing would be most suitable for all portions of the source code, regardless of type. The system can adjust that decision based on the specific nature of the constructs within the source code, and can also adjust that decision based on the platform upon which the resulting executable program will run.

摘要翻译： 提供了组合顺序和迭代源代码的系统。 系统决定哪种类型的处理最适合源代码的所有部分，不管类型如何。 系统可以根据源代码中的构造的具体特性来调整该决策，并且还可以基于生成的可执行程序将运行的平台来调整该决策。

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

公开(公告)号：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索引中的关系表存储集合中一组节点的每个节点的条目。 关系表的每个条目存储订单密钥和路径标识符以及节点的雾化值。 雾化值上的索引提供了执行节点感知全文搜索的机制。 不用在表中存储雾化值，而是可以创建一个虚拟列，以便为每个节点表示节点的雾化值。 或者，关系表的每个条目存储订单密钥和路径标识符，对于简单节点，存在雾化值，对于复杂节点存储空值。 对于具有后代文本节点的复杂节点，为关系表中的后代文本节点存储单独的条目。

公开(公告)号：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模式中指定的任何元素是否是具有多于阈值数量的后代元素的复杂元素。 如果复杂元素具有超过阈值数量的后代元素，则服务器自动生成一个或多个单独的“行外”数据库表，用于存储这些后代元素中的至少一些，使得创建用于存储 复杂元素将不超过允许的列数。 类似地生成每个外联数据库表，以便不超过允许的列数。

公开(公告)号：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索引中的关系表存储集合中一组节点的每个节点的条目。 关系表的每个条目存储订单密钥和路径标识符以及节点的雾化值。 雾化值上的索引提供了执行节点感知全文搜索的机制。 不用在表中存储雾化值，而是可以创建一个虚拟列，以便为每个节点表示节点的雾化值。 或者，关系表的每个条目存储订单密钥和路径标识符，对于简单节点，存在雾化值，对于复杂节点存储空值。 对于具有后代文本节点的复杂节点，为关系表中的后代文本节点存储单独的条目。

公开(公告)号：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.

公开(公告)号：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数据的性能。