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

1. 发明授权

US09043308B2 Techniques for efficient queries on a file system-like repository 有权
公开(公告)号：US09043308B2
公开(公告)日：2015-05-26
申请号：US13351448
申请日：2012-01-17
申请人： Asha Tarachandani , Bhushan Khaladkar , Sam Idicula , Adiel Yoaz , Nipun Agarwal
发明人： Asha Tarachandani , Bhushan Khaladkar , Sam Idicula , Adiel Yoaz , Nipun Agarwal
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30471 , G06F17/30477
摘要： Techniques are provided to achieve performance improvements for path-based access to hierarchical data and for utilizing an extensible indexing framework. Extensible operators may be optimized by evaluating the operators using functions native to the database system instead of using functions defined through an extensible indexing mechanism. Furthermore, the database system may resolve a resource path of a query when the query is compiled, and may store the mapping of the resource path to one or more resources in a cursor for the query execution plan to avoid resolving the resource path each time the cursor is used to run the query. The cursor may be made dependent on the one or more resources to which the resource path refers at compile time. This takes advantage of the observation that the mapping of the resource path to particular resources rarely changes between evaluations of a particular query.

2. 发明申请

US20120150865A1 Techniques For Efficient Queries On A File System-Like Repository 有权
标题翻译：用于文件系统的存储库上的高效查询的技术
公开(公告)号：US20120150865A1
公开(公告)日：2012-06-14
申请号：US13351448
申请日：2012-01-17
申请人： Asha Tarachandani , Bhushan Khaladkar , Sam Idicula , Adiel Yoaz , Nipun Agarwal
发明人： Asha Tarachandani , Bhushan Khaladkar , Sam Idicula , Adiel Yoaz , Nipun Agarwal
IPC分类号： G06F17/30
CPC分类号： G06F17/30471 , G06F17/30477
摘要： Techniques are provided to achieve performance improvements for path-based access to hierarchical data and for utilizing an extensible indexing framework. Extensible operators may be optimized by evaluating the operators using functions native to the database system instead of using functions defined through an extensible indexing mechanism. Furthermore, the database system may resolve a resource path of a query when the query is compiled, and may store the mapping of the resource path to one or more resources in a cursor for the query execution plan to avoid resolving the resource path each time the cursor is used to run the query. The cursor may be made dependent on the one or more resources to which the resource path refers at compile time. This takes advantage of the observation that the mapping of the resource path to particular resources rarely changes between evaluations of a particular query.
摘要翻译：提供了技术来实现基于路径的分层数据访问和利用可扩展索引框架的性能改进。可以通过使用本机对数据库系统的功能来评估操作员而不是使用通过可扩展索引机制定义的功能来优化可扩展运算符。此外，当查询被编译时，数据库系统可以解析查询的资源路径，并且可以将资源路径的映射存储到用于查询执行计划的游标中的一个或多个资源，以避免在每次游标用于运行查询。光标可以依赖于在编译时资源路径所指的一个或多个资源。这充分利用了对特定查询的评估之间的资源路径映射到特定资源的观察很少。

3. 发明申请

US20110113036A1 EFFICIENT FILE ACCESS IN A LARGE REPOSITORY USING A TWO-LEVEL CACHE 有权
标题翻译：使用两级高速缓存的大型报表中的高效文件访问
公开(公告)号：US20110113036A1
公开(公告)日：2011-05-12
申请号：US12615090
申请日：2009-11-09
申请人： Sam Idicula , Sabina Petride , Bhushan Khaladkar , Nipun Agarwal
发明人： Sam Idicula , Sabina Petride , Bhushan Khaladkar , Nipun Agarwal
IPC分类号： G06F17/30 , G06F12/00 , G06F12/08
CPC分类号： G06F17/30097 , G06F12/0811 , G06F12/084 , G06F17/30929
摘要： A two-level cache to facilitate resolving resource path expressions for a hierarchy of resources is described, which includes a system-wide shared cache and a session-level cache. The shared cache is organized as a hierarchy of hash tables that mirrors the structure of a repository hierarchy. A particular hash table in a shared cache includes information for the child resources of a particular resource. A database management system that manages a shared cache may control the amount of memory used by the cache by implementing a replacement policy for the cache based on one or more characteristics of the resources in the repository. The session-level cache is a single level cache in which information for target resources of resolved path expressions may be tracked. In the session-level cache, the resource information is associated with the entire path expression of the associated resource.
摘要翻译：描述了用于促进解决资源层级的资源路径表达式的两级缓存，其包括系统范围共享高速缓存和会话级缓存。共享缓存被组织为映射存储库层次结构的散列表的层次结构。共享缓存中的特定哈希表包括特定资源的子资源的信息。管理共享高速缓存的数据库管理系统可以基于存储库中的资源的一个或多个特性来实现对高速缓存的替换策略来控制高速缓存所使用的存储器量。会话级缓存是单级缓存，其中可以跟踪解析的路径表达式的目标资源的信息。在会话级缓存中，资源信息与相关资源的整个路径表达式相关联。

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. 发明申请

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结果的序列化表示。

6. 发明申请

US20110060726A1 TECHNIQUE TO GATHER STATISTICS ON VERY LARGE HIERARCHICAL COLLECTIONS IN A SCALABLE AND EFFICIENT MANNER 有权
标题翻译：技术统计在非常大的分层收集在一个可靠和有效的手段
公开(公告)号：US20110060726A1
公开(公告)日：2011-03-10
申请号：US12555198
申请日：2009-09-08
申请人： Sam Idicula , Asha Tarachandani , Bhushan Khaladkar , Niput Agarwal
发明人： Sam Idicula , Asha Tarachandani , Bhushan Khaladkar , Niput Agarwal
IPC分类号： G06F7/10 , 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.
摘要翻译：提供了技术来高效地收集分层组织的数据集合的统计数据。数据库系统利用容器级修改时间戳和存储的子树级别更改信息，从上次收集统计信息以来统计信息已经更改的分层收集中的那些资源中收集统计信息。还描述了一种无锁数据结构，用于存储子树级别改变信息，其中可以存储与包含改变的资源的集合中的每个子树对应的标识符。该数据结构可以是与表示集合的一个或多个表不同的表。在本发明的一个实施例中，可以通过在基于跟踪的子树级别信息收集统计信息的同时利用修改时间戳从子树表中省略特定修改资源的直接父资源。

7. 发明授权

US07305667B1 Call back structures for user defined DOMs 有权
标题翻译：调用用户定义的DOM的结构
公开(公告)号：US07305667B1
公开(公告)日：2007-12-04
申请号：US10171796
申请日：2002-06-13
申请人： Tomas Saulys , Sheng-Yih Guan , Ian Macky , Bhushan Khaladkar , Deepak Agrawal
发明人： Tomas Saulys , Sheng-Yih Guan , Ian Macky , Bhushan Khaladkar , Deepak Agrawal
IPC分类号： G06F9/44
CPC分类号： G06F9/4491
摘要： Described herein are techniques that allow applications developed in non-object oriented languages, such as C, to interact with DOM trees implemented under different DOM implementations. An application accesses different DOM implementations through a set of function pointers that conform to a set of function signatures. The set of function pointers may be stored in a data structure defined to have member function pointers that point to functions that conform to the set of function signatures. The set of function signatures define a common interface through which applications may interact with a variety of DOM implementations. One or more applications generate the set of function pointers and store them in a data structure. The other applications register the function pointers with an application by, for example, passing a pointer to the data structure to the application.
摘要翻译：这里描述的是允许以非面向对象语言（如C）开发的应用程序与在不同DOM实现下实现的DOM树进行交互的技术。应用程序通过一组符合一组函数签名的函数指针访问不同的DOM实现。函数指针集合可以存储在定义为具有指向符合该组函数签名的函数的成员函数指针的数据结构中。这组函数签名定义了一个通用接口，应用程序可以通过这些接口与各种DOM实现进行交互。一个或多个应用程序生成一组函数指针并将它们存储在数据结构中。其他应用程序通过一个应用程序注册函数指针，例如，将一个指针传递给应用程序的数据结构。

8. 发明授权

US07092967B1 Loadable units for lazy manifestation of XML documents 有权
标题翻译：用于懒惰表现XML文档的可加载单元
公开(公告)号：US07092967B1
公开(公告)日：2006-08-15
申请号：US10256777
申请日：2002-09-27
申请人： Syam Pannala , Eric Sedlar , Bhushan Khaladkar , Ravi Murthy , Sivasankaran Chandrasekar , Nipun Agarwal
发明人： Syam Pannala , Eric Sedlar , Bhushan Khaladkar , Ravi Murthy , Sivasankaran Chandrasekar , Nipun Agarwal
IPC分类号： G06F17/30
CPC分类号： G06F17/30908 , Y10S707/99933 , Y10S707/99942 , Y10S707/99945 , Y10S707/99948
摘要： Described herein is a system for “lazy” manifestation of XML documents. In lazy manifestation, only portions of an XML document that contain data of interest (e.g., a particular element or attribute requested by an application) are manifested. The term “manifesting a portion of an XML document” refers to creating an in-memory representation of the portion and incorporating it into existing in-memory representation of an XML document, if any. These portions are referred to herein as a loadable unit. A loadable unit is a set of one or more nodes in an XML document, where when there is need to manifest a node in the set, other nodes in the loadable unit are manifested too. Loadable units may, but not necessarily, correlate to content structures that store the nodes. A loadable unit may be the nodes whose content is contained in a row.
摘要翻译：这里描述了一种用于“懒惰”显示XML文档的系统。在懒惰表现中，仅显示包含感兴趣的数据的XML文档的部分（例如，应用所请求的特定元素或属性）。术语“呈现XML文档的一部分”是指创建该部分的内存中表示，并将其并入XML文档的现有内存中表示（如果有的话）。这些部分在这里被称为可装载单元。可加载单元是XML文档中的一个或多个节点的集合，其中当需要在集合中显示节点时，可显示可加载单元中的其他节点。可加载单元可以但不一定与存储节点的内容结构相关联。可装载单元可以是其行为中包含内容的节点。

9. 发明授权

US08909599B2 Efficient migration of binary XML across databases 有权
标题翻译：跨数据库高效迁移二进制XML
公开(公告)号：US08909599B2
公开(公告)日：2014-12-09
申请号：US11601116
申请日：2006-11-16
申请人： Bhushan Khaladkar , Nipun Agarwal , Asha Tarachandani , Sivansankaran Chandrasekar , Sabina Petride
发明人： Bhushan Khaladkar , Nipun Agarwal , Asha Tarachandani , Sivansankaran Chandrasekar , Sabina Petride
IPC分类号： G06F17/30
CPC分类号： G06F17/30908
摘要： Techniques are provided for transporting subset of databases containing binary XML data. In one embodiment, a method is provided that allows transporting binary XML data that conforms to schema by also transporting the schema entries that are necessary to derive the binary XML. In another embodiment, a method is provided that allows transporting binary XML data that does not conform to schema by also transporting the token tables that contain the mapping for the binary XML.
摘要翻译：提供了用于传输包含二进制XML数据的数据库的子集的技术。在一个实施例中，提供了一种方法，其允许传送符合模式的二进制XML数据，还传送导出二进制XML所必需的模式条目。在另一个实施例中，提供了一种方法，其允许通过还传送包含二进制XML的映射的令牌表来传输不符合模式的二进制XML数据。

10. 发明授权

US08417714B2 Techniques for fast and scalable XML generation and aggregation over binary XML 有权
标题翻译：用于通过二进制XML实现快速可扩展的XML生成和聚合的技术
公开(公告)号：US08417714B2
公开(公告)日：2013-04-09
申请号：US12692549
申请日：2010-01-22
申请人： Sam Idicula , Sandeep Mane , Bhushan Khaladkar , Nipun Agarwal
发明人： Sam Idicula , Sandeep Mane , Bhushan Khaladkar , Nipun Agarwal
IPC分类号： G06F7/00 , 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结果的序列化表示。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式