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

41. 发明授权

US07840609B2 Using sibling-count in XML indexes to optimize single-path queries 有权
标题翻译：在XML索引中使用sibling-count来优化单路径查询
公开(公告)号：US07840609B2
公开(公告)日：2010-11-23
申请号：US11888415
申请日：2007-07-31
申请人： Sivasankaran Chandrasekar , Ravi Murthy , Thomas Baby , Nipun Agarwal
发明人： Sivasankaran Chandrasekar , Ravi Murthy , Thomas Baby , Nipun Agarwal
IPC分类号： G06F7/00
CPC分类号： G06F17/30935 , G06F17/30442
摘要： 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.
摘要翻译：提供了一种方法和装置，用于在XML索引中使用同级计数来优化单路径查询。在SQL查询中使用b-tree XML索引对数地减少了通过传递索引条目的磁盘访问次数，确定不会找到匹配项。但是，由于某些索引条目被传递，因此某些查询有时需要，无法确定路径表达式是否在XML索引中多次出现。通过维护XML索引中每个节点条目的兄弟数量，可以克服这个障碍。由于兄弟计数与索引条目一起存储，索引将显示匹配节点是单个节点还是具有其他兄弟节点。除了通过使用XML索引重新编写原始查询进行优化外，还将重新编写索引中的单路径条件。

42. 发明申请

US20090037369A1 Using sibling-count in XML indexes to optimize single-path queries 有权
标题翻译：在XML索引中使用sibling-count来优化单路径查询
公开(公告)号：US20090037369A1
公开(公告)日：2009-02-05
申请号：US11888415
申请日：2007-07-31
申请人： Sivasankaran Chandrasekar , Ravi Murthy , Thomas Baby , Nipun Agarwal
发明人： Sivasankaran Chandrasekar , Ravi Murthy , Thomas Baby , Nipun Agarwal
IPC分类号： G06F17/30
CPC分类号： G06F17/30935 , G06F17/30442
摘要： 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.
摘要翻译：提供了一种方法和装置，用于在XML索引中使用同级计数来优化单路径查询。在SQL查询中使用b-tree XML索引对数地减少了通过传递索引条目的磁盘访问次数，确定不会找到匹配项。但是，由于某些索引条目被传递，因此某些查询有时需要，无法确定路径表达式是否在XML索引中多次出现。通过维护XML索引中每个节点条目的兄弟数量，可以克服这个障碍。由于兄弟计数与索引条目一起存储，索引将显示匹配节点是单个节点还是具有其他兄弟节点。除了通过使用XML索引重新编写原始查询进行优化外，还将重新编写索引中的单路径条件。

43. 发明授权

US07761479B2 Management of complex XML schemas in a database system 有权
标题翻译：在数据库系统中管理复杂的XML模式
公开(公告)号：US07761479B2
公开(公告)日：2010-07-20
申请号：US11519720
申请日：2006-09-11
申请人： Abhyudaya Agrawal , Thomas Baby , Ravi Murthy , Nipun Agarwal
发明人： Abhyudaya Agrawal , Thomas Baby , Ravi Murthy , Nipun Agarwal
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30917 , Y10S707/954
摘要： Techniques manage the presence of repeated constructs within a complex type at the time of schema registration. At registration, techniques detect repeated elements in the XML schema and analyze whether the repeated elements are from the same complex type. If so, techniques perform additional analysis to determine a minimal common ancestor. Within the context of a minimal common ancestor, techniques determine the maximum number of times an element may occur in the schema. In a choice content model, the largest maximum occurrence value is selected. In other content models, the maximum occurrence value is determined by adding together the occurrence values for the repeated elements. Then, when an object relational table is generated for the XML schema, the maximum number of times that an element appears in the schema is this value. Techniques retain the advantages of object relational storage, even after a schema evolution.
摘要翻译：技术在模式注册时管理复杂类型中重复构造的存在。在注册时，技术会检测XML模式中的重复元素，并分析重复的元素是否来自相同的复杂类型。如果是这样，技术将进行额外的分析，以确定一个最小的共同祖先。在最小共同祖先的上下文中，技术确定元素在模式中可能发生的最大次数。在选择内容模型中，选择最大的最大出现值。在其他内容模型中，通过将重复元素的出现值相加来确定最大出现值。然后，当为XML模式生成对象关系表时，元素在模式中出现的最大次数是此值。技术保留对象关系存储的优点，即使在模式演进之后。

44. 发明申请

US20080147615A1 Xpath based evaluation for content stored in a hierarchical database repository using xmlindex 审中-公开
标题翻译：基于Xpath的评估用于使用xmlindex存储在分层数据库存储库中的内容
公开(公告)号：US20080147615A1
公开(公告)日：2008-06-19
申请号：US11641419
申请日：2006-12-18
申请人： Man-Hay Tam , Thomas Baby , Nipun Agarwal , Ravi Murthy , Sivasankaran Chandrasekar
发明人： Man-Hay Tam , Thomas Baby , Nipun Agarwal , Ravi Murthy , Sivasankaran Chandrasekar
IPC分类号： G06F17/30
CPC分类号： G06F16/8373
摘要： A method and apparatus for efficiently processing a query that specifies a location path and a content path is provided. The location path identifies the hierarchical location of a set of documents within a resource hierarchy. The content path identifies hierarchical location of one or more nodes within the content of the set of documents. Computing the query includes using a resource hierarchy index, based on the location path, to generate first results corresponding to the set of documents. Computing the query also includes using a content index, based on the content path, to generate second results corresponding to the one or more nodes. Final results of the query are based on the first results and second results by, for example, joining the first and second results.
摘要翻译：提供了一种用于有效地处理指定位置路径和内容路径的查询的方法和装置。位置路径标识资源层次结构中一组文档的分层位置。内容路径识别文档集合内的一个或多个节点的分层位置。计算查询包括使用基于位置路径的资源层次索引来生成与该组文档相对应的第一结果。计算查询还包括使用基于内容路径的内容索引来生成对应于一个或多个节点的第二结果。查询的最终结果基于第一个结果和第二个结果，例如，加入第一个和第二个结果。

45. 发明申请

US20080065654A1 Management of complex XML schemas in a database system 有权
标题翻译：在数据库系统中管理复杂的XML模式
公开(公告)号：US20080065654A1
公开(公告)日：2008-03-13
申请号：US11519720
申请日：2006-09-11
申请人： Abhyudaya Agrawal , Thomas Baby , Ravi Murthy , Nipun Agarwal
发明人： Abhyudaya Agrawal , Thomas Baby , Ravi Murthy , Nipun Agarwal
IPC分类号： G06F7/00
CPC分类号： G06F17/30917 , Y10S707/954
摘要： Techniques manage the presence of repeated constructs within a complex type at the time of schema registration. At registration, techniques detect repeated elements in the XML schema and analyze whether the repeated elements are from the same complex type. If so, techniques perform additional analysis to determine a minimal common ancestor. Within the context of a minimal common ancestor, techniques determine the maximum number of times an element may occur in the schema. In a choice content model, the largest maximum occurrence value is selected. In other content models, the maximum occurrence value is determined by adding together the occurrence values for the repeated elements. Then, when an object relational table is generated for the XML schema, the maximum number of times that an element appears in the schema is this value. Techniques retain the advantages of object relational storage, even after a schema evolution.
摘要翻译：技术在模式注册时管理复杂类型中重复构造的存在。在注册时，技术会检测XML模式中的重复元素，并分析重复的元素是否来自相同的复杂类型。如果是这样，技术将进行额外的分析，以确定一个最小的共同祖先。在最小共同祖先的上下文中，技术确定元素在模式中可能发生的最大次数。在选择内容模型中，选择最大的最大出现值。在其他内容模型中，通过将重复元素的出现值相加来确定最大出现值。然后，当为XML模式生成对象关系表时，元素在模式中出现的最大次数是此值。技术保留对象关系存储的优点，即使在模式演进之后。

46. 发明授权

US09665572B2 Optimal data representation and auxiliary structures for in-memory database query processing 有权
公开(公告)号：US09665572B2
公开(公告)日：2017-05-30
申请号：US13611479
申请日：2012-09-12
申请人： Sam Idicula , Kevin Moore , Brian Gold , Nipun Agarwal , Eric Sedlar
发明人： Sam Idicula , Kevin Moore , Brian Gold , Nipun Agarwal , Eric Sedlar
IPC分类号： G06F17/30
CPC分类号： G06F17/30 , G06F17/30289 , G06F17/30312
摘要： A method for providing optimized data representation of relations for in-memory database query processing is disclosed. The method seeks to optimize the use of the available memory by encoding relations on which the in-memory database query processing is performed and by employing auxiliary structures to maintain performance. Relations are encoded based on data patterns in one or more attribute-columns of the relation and the encoding that is selected is suited to a particular type of data in the column. Members of a set of auxiliary structures are selected based on the benefit the structure can provide and the cost of the structure in terms of the amount of memory used. Encoding of the relations is performed in real-time while query processing occurs, using locks to eliminate conflicts between the query processing and encoding.

47. 发明授权

US09582525B2 Technique to gather statistics on very large hierarchical collections in a scalable and efficient manner 有权
标题翻译：以可扩展和高效的方式收集关于非常大的分层收藏的统计数据的技术
公开(公告)号：US09582525B2
公开(公告)日：2017-02-28
申请号：US12555198
申请日：2009-09-08
申请人： Sam Idicula , Asha Tarachandani , Bhushan Khaladkar , Nipun Agarwal
发明人： Sam Idicula , Asha Tarachandani , Bhushan Khaladkar , Nipun Agarwal
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30306
摘要： Techniques are provided for efficiently collecting statistics for hierarchically-organized collections of data. A database system leverages container-level modification time stamps and stored subtree-level change information to gather statistical information from only those resources in a hierarchical collection for which the statistics have changed since the last time that statistics were gathered for the collection. A lockless data structure is also described for storing the subtree-level change information in which an identifier corresponding to each subtree in a collection containing a changed resource may be stored. This data structure may be a table that is distinct from one or more tables representing the collection. In one embodiment of the invention, the immediate parent resource of a particular modified resource may be omitted from the subtree table by leveraging modification time stamps while gathering statistics based on tracked subtree-level information.
摘要翻译：提供了技术来高效地收集分层组织的数据集合的统计数据。数据库系统利用容器级修改时间戳和存储的子树级别更改信息，从上次收集统计信息以来统计信息已经更改的分层收集中的那些资源中收集统计信息。还描述了一种无锁数据结构，用于存储子树级别改变信息，其中可以存储与包含改变的资源的集合中的每个子树对应的标识符。该数据结构可以是与表示集合的一个或多个表不同的表。在本发明的一个实施例中，可以通过在基于跟踪的子树级别信息收集统计信息的同时利用修改时间戳从子树表中省略特定修改资源的直接父资源。

48. 发明申请

US20140074819A1 Optimal Data Representation and Auxiliary Structures For In-Memory Database Query Processing 有权
标题翻译：内存数据库查询处理的最佳数据表示和辅助结构
公开(公告)号：US20140074819A1
公开(公告)日：2014-03-13
申请号：US13611479
申请日：2012-09-12
申请人： Sam Idicula , Kevin Moore , Brian Gold , Nipun Agarwal , Eric Sedlar
发明人： Sam Idicula , Kevin Moore , Brian Gold , Nipun Agarwal , Eric Sedlar
IPC分类号： G06F17/30
CPC分类号： G06F17/30 , G06F17/30289 , G06F17/30312
摘要： A method for providing optimized data representation of relations for in-memory database query processing is disclosed. The method seeks to optimize the use of the available memory by encoding relations on which the in-memory database query processing is performed and by employing auxiliary structures to maintain performance. Relations are encoded based on data patterns in one or more attribute-columns of the relation and the encoding that is selected is suited to a particular type of data in the column. Members of a set of auxiliary structures are selected based on the benefit the structure can provide and the cost of the structure in terms of the amount of memory used. Encoding of the relations is performed in real-time while query processing occurs, using locks to eliminate conflicts between the query processing and encoding.
摘要翻译：公开了一种用于提供用于存储器内数据库查询处理的关系的优化数据表示的方法。该方法寻求通过编码执行存储器内数据库查询处理的关系和通过使用辅助结构来维持性能来优化可用存储器的使用。关系基于关系的一个或多个属性列中的数据模式进行编码，并且所选择的编码适合列中的特定类型的数据。一组辅助结构的成员根据结构可以提供的好处和所使用的记忆体的结构成本进行选择。关系的编码在查询处理发生时实时执行，使用锁来消除查询处理和编码之间的冲突。

49. 发明申请

US20140067791A1 Automatic Denormalization For Analytic Query Processing In Large-Scale Clusters 有权
标题翻译：用于大规模集群中的分析查询处理的自动非规范化
公开(公告)号：US20140067791A1
公开(公告)日：2014-03-06
申请号：US13605903
申请日：2012-09-06
申请人： Sam Idicula , Sabina Petride , Nipun Agarwal
发明人： Sam Idicula , Sabina Petride , Nipun Agarwal
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , G06F17/30457 , G06F17/30501
摘要： A system and method for improving performance of join operations is disclosed. The method in one embodiment includes building a graph of vertices and edges, which represent the tables and join conditions for a particular database schema. The method then traverses the graph to find a set of candidate join operations. The method further includes selecting from the set of subset of join operations that makes the best use of a given amount of memory, which means finding a collection of denormalizations which when residing in memory provide the most benefit and the least cost for the given amount of memory. The method then deploys the denormalizations so that current queries in a query processing system can use them instead of actually performing the joins.
摘要翻译：公开了一种用于提高连接操作性能的系统和方法。一个实施例中的方法包括构建顶点和边的图，其表示特定数据库模式的表和连接条件。然后，该方法遍历图形以找到一组候选连接操作。该方法还包括从充分利用给定量的存储器的连接操作的集合集合中进行选择，这意味着找到一种非规范化集合，其在驻留在存储器中时提供最大的收益，并且给定量的记忆。然后，该方法部署非规范化，以便查询处理系统中的当前查询可以使用它们，而不是实际执行连接。

50. 发明授权

US08239373B2 Efficient way to evaluate uncorrelated path-based row sources with XML storage 有权
标题翻译：用XML存储来评估不相关的基于路径的行源的有效方式
公开(公告)号：US08239373B2
公开(公告)日：2012-08-07
申请号：US12467984
申请日：2009-05-18
申请人： Balasubramanyam Sthanikam , Sam Idicula , Nipun Agarwal
发明人： Balasubramanyam Sthanikam , Sam Idicula , Nipun Agarwal
IPC分类号： G06F17/30
CPC分类号： G06F17/30932
摘要： The approaches described herein provide an efficient way to process certain kinds of queries that retrieve XML data stored in an object-relational database. A technique determines whether a query comprises a plurality of iteration expressions that exhibit a particular relationship to one another, and if so, re-writes the query and produces an optimized query execution plan. The query execution plan specifies an XPath-based row source with caching enabled. A very small cache structure is used, and reference locators are stored in the cache that point into binary-encoded data rather than copying XMLType data into the cache. Row data may be cached on the first use of the path-based row source and re-used in subsequent requests for rows. Once there is a subsequent request for rows from the optimized path-based row source, the cache may be reorganized to efficiently produce the rows of the row source.
摘要翻译：本文描述的方法提供了处理检索存储在对象关系数据库中的XML数据的某些类型的查询的有效方式。技术确定查询是否包括彼此具有特定关系的多个迭代表达式，如果是，则重写该查询并产生优化的查询执行计划。查询执行计划指定启用缓存的基于XPath的行源。使用非常小的缓存结构，参考定位器存储在缓存中，指向二进制编码数据，而不是将XMLType数据复制到缓存中。行数据可以在首次使用基于路径的行源缓存，并在后续的行请求中重新使用。一旦从优化的基于路径的行源中获得行的后续请求，则可以重新组织高速缓存以有效地产生行源的行。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式