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

1. 发明授权

US08713426B2 Technique for skipping irrelevant portions of documents during streaming XPath evaluation 有权
标题翻译：在流式传输XPath评估期间跳过文档的无关部分的技术
公开(公告)号：US08713426B2
公开(公告)日：2014-04-29
申请号：US12491981
申请日：2009-06-25
申请人： Sam Idicula , Nipun Agarwal , Sanket Malde
发明人： Sam Idicula , Nipun Agarwal , Sanket Malde
IPC分类号： G06F17/00
CPC分类号： G06F17/2247 , G06F17/22 , G06F17/30929
摘要： A method and apparatus are described for summarizing a document. For each node in the document that satisfies a marking criteria, a start and end mark pair is stored in a summary in document order. The start mark specifies a location in the document where the node starts, and the end mark specifies a location in the document where the node ends. When evaluating a query for a hierarchical path, the document is streamed into memory until the mark of a tag matches a start mark in the summary. If that tag does not fit within the path, then streaming of the document may resume at the end mark, thereby skipping the node during streaming evaluation. Translation information may be used to indicate a logical position relative to the marks in the summary when the document is modified.
摘要翻译：描述用于总结文档的方法和装置。对于满足标记条件的文档中的每个节点，开始和结束标记对将以文档顺序存储在摘要中。开始标记指定文档中节点启动的位置，结束标记指定节点结束的文档中的位置。当评估分层路径的查询时，文档将流式传输到内存中，直到标记的标记与摘要中的起始标记相匹配。如果该标签不适合路径，则可以在结束标记处恢复文档的流传输，从而在流评估期间跳过该节点。当文档被修改时，翻译信息可以用于指示在摘要中相对于标记的逻辑位置。

2. 发明申请

US20100332966A1 TECHNIQUE FOR SKIPPING IRRELEVANT PORTIONS OF DOCUMENTS DURING STREAMING XPATH EVALUATION 有权
标题翻译：解决XPATH评估过程中文档不可避免部分的技巧
公开(公告)号：US20100332966A1
公开(公告)日：2010-12-30
申请号：US12491981
申请日：2009-06-25
申请人： Sam Idicula , Nipun Agarwal , Sanket Malde
发明人： Sam Idicula , Nipun Agarwal , Sanket Malde
IPC分类号： G06F17/00
CPC分类号： G06F17/2247 , G06F17/22 , G06F17/30929
摘要： A method and apparatus are described for summarizing a document. For each node in the document that satisfies a marking criteria, a start and end mark pair is stored in a summary in document order. The start mark specifies a location in the document where the node starts, and the end mark specifies a location in the document where the node ends. When evaluating a query for a hierarchical path, the document is streamed into memory until the mark of a tag matches a start mark in the summary. If that tag does not fit within the path, then streaming of the document may resume at the end mark, thereby skipping the node during streaming evaluation. Translation information may be used to indicate a logical position relative to the marks in the summary when the document is modified.
摘要翻译：描述用于总结文档的方法和装置。对于满足标记条件的文档中的每个节点，开始和结束标记对将以文档顺序存储在摘要中。开始标记指定文档中节点启动的位置，结束标记指定节点结束的文档中的位置。当评估分层路径的查询时，文档将流式传输到内存中，直到标记的标记与摘要中的起始标记相匹配。如果该标签不适合路径，则可以在结束标记处恢复文档的流传输，从而在流评估期间跳过该节点。当文档被修改时，翻译信息可以用于指示在摘要中相对于标记的逻辑位置。

3. 发明授权

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.

4. 发明授权

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.
摘要翻译：提供了技术来高效地收集分层组织的数据集合的统计数据。数据库系统利用容器级修改时间戳和存储的子树级别更改信息，从上次收集统计信息以来统计信息已经更改的分层收集中的那些资源中收集统计信息。还描述了一种无锁数据结构，用于存储子树级别改变信息，其中可以存储与包含改变的资源的集合中的每个子树对应的标识符。该数据结构可以是与表示集合的一个或多个表不同的表。在本发明的一个实施例中，可以通过在基于跟踪的子树级别信息收集统计信息的同时利用修改时间戳从子树表中省略特定修改资源的直接父资源。

5. 发明申请

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.
摘要翻译：公开了一种用于提供用于存储器内数据库查询处理的关系的优化数据表示的方法。该方法寻求通过编码执行存储器内数据库查询处理的关系和通过使用辅助结构来维持性能来优化可用存储器的使用。关系基于关系的一个或多个属性列中的数据模式进行编码，并且所选择的编码适合列中的特定类型的数据。一组辅助结构的成员根据结构可以提供的好处和所使用的记忆体的结构成本进行选择。关系的编码在查询处理发生时实时执行，使用锁来消除查询处理和编码之间的冲突。

6. 发明申请

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.
摘要翻译：公开了一种用于提高连接操作性能的系统和方法。一个实施例中的方法包括构建顶点和边的图，其表示特定数据库模式的表和连接条件。然后，该方法遍历图形以找到一组候选连接操作。该方法还包括从充分利用给定量的存储器的连接操作的集合集合中进行选择，这意味着找到一种非规范化集合，其在驻留在存储器中时提供最大的收益，并且给定量的记忆。然后，该方法部署非规范化，以便查询处理系统中的当前查询可以使用它们，而不是实际执行连接。

7. 发明授权

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数据复制到缓存中。行数据可以在首次使用基于路径的行源缓存，并在后续的行请求中重新使用。一旦从优化的基于路径的行源中获得行的后续请求，则可以重新组织高速缓存以有效地产生行源的行。

8. 发明申请

US20110184969A1 TECHNIQUES FOR FAST AND SCALABLE XML GENERATION AND AGGREGATION OVER BINARY XML 有权
标题翻译：用于二进制XML的快速和可扩展的XML生成和聚合的技术
公开(公告)号：US20110184969A1
公开(公告)日：2011-07-28
申请号：US12692549
申请日：2010-01-22
申请人： Sam Idicula , Sandeep Mane , Bhushan Khaladkar , Nipun Agarwal
发明人： Sam Idicula , Sandeep Mane , Bhushan Khaladkar , Nipun Agarwal
IPC分类号： G06F17/30
CPC分类号： G06F17/30938
摘要： Techniques for fast and scalable generation and aggregation of XML data are described. In an example embodiment, an XML query that requests data from XML documents is received. The XML query is evaluated to determine one or more XML results. For each particular XML result, evaluating the XML query comprises: instantiating a particular data structure that represents the particular XML result, where the particular data structure is encoded in accordance with tags specified in the XML query but does not store the tags; and storing, in the particular data structure, one or more locators that respectively point to one or more fragments in the XML documents, where the particular data structure stores the one or more locators but does not store the one or more fragments. On demand, in response to a request indicating the particular XML result, a serialized representation of the particular XML result is generated based at least on the particular data structure.
摘要翻译：描述了用于快速和可扩展的XML数据生成和聚合的技术。在示例实施例中，接收从XML文档请求数据的XML查询。评估XML查询以确定一个或多个XML结果。对于每个特定的XML结果，评估XML查询包括：实例化表示特定XML结果的特定数据结构，其中特定数据结构根据XML查询中指定的标签进行编码，但不存储标签; 以及在所述特定数据结构中存储分别指向所述XML文档中的一个或多个片段的一个或多个定位符，其中所述特定数据结构存储所述一个或多个定位符，但不存储所述一个或多个片段。根据需要，响应于指示特定XML结果的请求，至少基于特定数据结构生成特定XML结果的序列化表示。

9. 发明申请

US20090144804A1 METHOD AND APPARATUS TO SUPPORT PRIVILEGES AT MULTIPLE LEVELS OF AUTHENTICATION USING A CONSTRAINING ACL 有权
标题翻译：使用约束ACL在多个级别的认证中支持特权的方法和装置
公开(公告)号：US20090144804A1
公开(公告)日：2009-06-04
申请号：US11947235
申请日：2007-11-29
申请人： Sam Idicula , Thomas Keefe , Mohammed Irfan Rafiq , Tanvir Ahmed , Vikram Pesati , Nipun Agarwal
发明人： Sam Idicula , Thomas Keefe , Mohammed Irfan Rafiq , Tanvir Ahmed , Vikram Pesati , Nipun Agarwal
IPC分类号： H04L9/32
CPC分类号： G06F21/6218 , G06F2221/2141
摘要： Embodiments of the present invention provide systems and techniques for creating, updating, and using an ACL (access control list). A database system may include a constraining ACL which represents a global security policy that is to be applied to all applications that interact with the database. By ensuring that all ACLs inherit from the constraining ACL, the database system can ensure that the global security policy is applied to all applications that interact with the database. During operation, the system may receive a request to create or update an ACL. Before creating or updating the ACL, the system may modify the ACL to ensure that it inherits from the constraining ACL. In an embodiment, the system grants a privilege to a user only if both the ACL and the constraining ACL grant the privilege.
摘要翻译：本发明的实施例提供了用于创建，更新和使用ACL（访问控制列表）的系统和技术。数据库系统可以包括约束ACL，其表示要应用于与数据库交互的所有应用的全局安全策略。通过确保所有ACL从约束ACL继承，数据库系统可以确保将全局安全策略应用于与数据库交互的所有应用程序。在操作期间，系统可能会收到创建或更新ACL的请求。在创建或更新ACL之前，系统可能会修改ACL，以确保其从约束ACL继承。在一个实施例中，只有当ACL和约束ACL同时授予特权时，系统才向用户授予权限。

10. 发明授权

US07472140B2 Label-aware index for efficient queries in a versioning system 有权
标题翻译：标签感知索引，用于版本控制系统中的高效查询
公开(公告)号：US07472140B2
公开(公告)日：2008-12-30
申请号：US11313526
申请日：2005-12-20
申请人： Nipun Agarwal , Sam Idicula , Thomas Baby , Eric Sedlar
发明人： Nipun Agarwal , Sam Idicula , Thomas Baby , Eric Sedlar
IPC分类号： G06F17/30
CPC分类号： G06F17/30625 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99942 , Y10S707/99954
摘要： A mechanism for querying a label-aware index in the context of versioning is provided. The key of the label-aware index is a composite key and includes a unique label identifier, corresponding to a specific label, and the key of the original index, which key itself may be a composite key. The label-aware index may be implemented as an index-organized table. The label-aware index is organized on disk first by the label identifier and then by the original index key so that queries of versions of resources within a particular label are as efficient as queries on an index of an unversioned repository with the same number of resources.
摘要翻译：提供了一种用于在版本控制的上下文中查询标签感知索引的机制。标签感知索引的密钥是复合密钥，并且包括对应于特定标签的唯一标签标识符和原始索引的密钥，该密钥本身可以是复合密钥。标签感知索引可以被实现为索引组织表。标签感知索引首先由标签标识符组织，然后由原始索引键组织，以便特定标签内的资源版本的查询与具有相同数量资源的未版本化存储库的索引上的查询一样有效。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式