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

61. 发明授权

US07814047B2 Direct loading of semistructured data 有权
标题翻译：直接加载半结构化数据
公开(公告)号：US07814047B2
公开(公告)日：2010-10-12
申请号：US10648600
申请日：2003-08-25
申请人： Namit Jain , Nipun Agarwal , Ravi Murthy
发明人： Namit Jain , Nipun Agarwal , Ravi Murthy
IPC分类号： G06F17/30
CPC分类号： G06F17/30917
摘要： Techniques and systems are disclosed for directly storing semistructured data in a database. According to one aspect, a client application reads data that comprises instances of a parent type. The client application invokes routines associated with the parent type. An array is created for storing instances of the parent type. These routines invoke routines associated with a child type of the parent type. An array is created for storing instances of the child type. The arrays are populated with values specified in the data. According to one aspect, some columns of the arrays may be populated with other values to be stored in hidden columns of database tables. The client application converts the arrays into a data stream that conforms to the format of the database's data blocks. The client application then streams the data to a database server, which writes the data blocks directly into one or more data blocks in the database.
摘要翻译：公开了用于将半结构化数据直接存储在数据库中的技术和系统。根据一个方面，客户端应用读取包含父类型的实例的数据。客户端应用程序调用与父类型相关联的例程。创建一个数组来存储父类型的实例。这些例程调用与父类型的子类型相关联的例程。创建一个数组来存储子类型的实例。数组用数据中指定的值填充。根据一个方面，阵列的一些列可以用其他值填充以存储在数据库表的隐藏列中。客户端应用程序将阵列转换为符合数据库数据块格式的数据流。然后，客户端应用程序将数据流传输到数据库服务器，数据库服务器将数据块直接写入数据库中的一个或多个数据块。

62. 发明申请

US20050050074A1 Efficient loading of data into a relational database 有权
标题翻译：将数据高效加载到关系数据库中
公开(公告)号：US20050050074A1
公开(公告)日：2005-03-03
申请号：US10718823
申请日：2003-11-21
申请人： Namit Jain , Nipun Agarwal , Ravi Murthy
发明人： Namit Jain , Nipun Agarwal , Ravi Murthy
IPC分类号： G06F17/00
CPC分类号： G06F17/30345 , G06F17/3048 , Y10S707/99931 , Y10S707/99943
摘要： Described is a method and system for storing data into a database, where a determination is made if schema metadata that is used to load the data into the database already exists, and where the existing schema metadata is used to load the data into the database if the schema metadata already exists. If the appropriate schema metadata does not exist, then it is generated and cached so that a later load operation for the same schema type will not need to re-generate this information. In this way, the cost to generate the schema metadata is amortized over multiple load operations to load data of the same schema type. The approach is protocol neutral so that multiple different protocol-based loads can operate with the same schema metadata information and load structures.
摘要翻译：描述了一种用于将数据存储到数据库中的方法和系统，其中确定用于将数据加载到数据库中的模式元数据是否已经存在，并且使用现有模式元数据将数据加载到数据库中，如果模式元数据已经存在。如果相应的模式元数据不存在，那么它将被生成和缓存，以便相同模式类型的后续加载操作将不需要重新生成此信息。以这种方式，生成架构元数据的成本将通过多个加载操作进行分摊，以加载相同模式类型的数据。该方法是协议中性的，以便多个不同的基于协议的负载可以使用相同的模式元数据信息和负载结构进行操作。

63. 发明授权

US07933928B2 Method and mechanism for loading XML documents into memory 有权
标题翻译：将XML文档加载到内存中的方法和机制
公开(公告)号：US07933928B2
公开(公告)日：2011-04-26
申请号：US11317101
申请日：2005-12-22
申请人： Sivasankaran Chandrasekar , Nipun Agarwal , Namit Jain , Ravi Murthy
发明人： Sivasankaran Chandrasekar , Nipun Agarwal , Namit Jain , Ravi Murthy
IPC分类号： G06F7/00 , G06F17/30 , G06F12/00
CPC分类号： G06F17/2247 , G06F17/30908
摘要： A method and apparatus for loading an XML document into memory is provided. A client loads one or more array elements into a first partition of an array that is maintained in memory. Each array element represents an XML element of an XML document. Upon determining that an amount of data maintained in the first partition exceeds a first threshold, the client subsequently loads array elements into a new partition of the array. Upon determining that an amount of data maintained in the memory of the client exceeds a second threshold, the array elements of the least recently used partition are persistently stored in a database without persistently storing the entire XML document. When the last XML element of the XML document is loaded into a partition of the array, that partition is persistently stored in the database, thereby causing the entire XML document to be stored in the database.
摘要翻译：提供了一种将XML文档加载到存储器中的方法和装置。客户端将一个或多个数组元素加载到内存中维护的数组的第一个分区中。每个数组元素表示XML文档的XML元素。在确定在第一分区中维护的数据量超过第一阈值时，客户端随后将数组元素加载到阵列的新分区中。在确定在客户端的存储器中维护的数据量超过第二阈值时，最近最少使用的分区的数组元素被持久地存储在数据库中，而不会持续存储整个XML文档。当XML文档的最后一个XML元素加载到数组的分区中时，该分区将永久存储在数据库中，从而使整个XML文档存储在数据库中。

64. 发明授权

US07490093B2 Generating a schema-specific load structure to load data into a relational database based on determining whether the schema-specific load structure already exists 有权
标题翻译：基于确定模式特定的负载结构是否已经存在，生成模式特定的负载结构以将数据加载到关系数据库中
公开(公告)号：US07490093B2
公开(公告)日：2009-02-10
申请号：US10718823
申请日：2003-11-21
申请人： Namit Jain , Nipun Agarwal , Ravi Murthy
发明人： Namit Jain , Nipun Agarwal , Ravi Murthy
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/30345 , G06F17/3048 , Y10S707/99931 , Y10S707/99943
摘要： Described is a method and system for storing data into a database, where a determination is made if schema metadata that is used to load the data into the database already exists, and where the existing schema metadata is used to load the data into the database if the schema metadata already exists. If the appropriate schema metadata does not exist, then it is generated and cached so that a later load operation for the same schema type will not need to re-generate this information. In this way, the cost to generate the schema metadata is amortized over multiple load operations to load data of the same schema type. The approach is protocol neutral so that multiple different protocol-based loads can operate with the same schema metadata information and load structures.
摘要翻译：描述了一种用于将数据存储到数据库中的方法和系统，其中确定用于将数据加载到数据库中的模式元数据是否已经存在，并且使用现有模式元数据将数据加载到数据库中，如果模式元数据已经存在。如果相应的模式元数据不存在，那么它将被生成和缓存，以便相同模式类型的后续加载操作将不需要重新生成此信息。以这种方式，生成架构元数据的成本将通过多个加载操作进行分摊，以加载相同模式类型的数据。该方法是协议中性的，以便多个不同的基于协议的负载可以使用相同的模式元数据信息和负载结构进行操作。

65. 发明授权

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.

66. 发明申请

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.
摘要翻译：提供了技术来实现基于路径的分层数据访问和利用可扩展索引框架的性能改进。可以通过使用本机对数据库系统的功能来评估操作员而不是使用通过可扩展索引机制定义的功能来优化可扩展运算符。此外，当查询被编译时，数据库系统可以解析查询的资源路径，并且可以将资源路径的映射存储到用于查询执行计划的游标中的一个或多个资源，以避免在每次游标用于运行查询。光标可以依赖于在编译时资源路径所指的一个或多个资源。这充分利用了对特定查询的评估之间的资源路径映射到特定资源的观察很少。

67. 发明授权

US08090731B2 Document fidelity with binary XML storage 有权
标题翻译：使用二进制XML存储文件保真
公开(公告)号：US08090731B2
公开(公告)日：2012-01-03
申请号：US12180760
申请日：2008-07-28
申请人： Balasubramanyam Sthanikam , Sivasankaran Chandrasekar , Nipun Agarwal , Sam Idicula , Vijay Medi
发明人： Balasubramanyam Sthanikam , Sivasankaran Chandrasekar , Nipun Agarwal , Sam Idicula , Vijay Medi
IPC分类号： G06F17/30
CPC分类号： G06F17/30569 , G06F17/30908
摘要： Techniques are provided for ensuring lexical fidelity when an XML document is stored in a binary format. Operations, on the XML data, that would cause the loss of lexical fidelity between the original XML document and the binary-encoded version of the XML document are not performed. Such operations include the removal of unnecessary whitespace characters, certain data type conversions, CRLF normalization, the “collapsing” of two-tag empty elements into a single tag empty element, and the replacing of entity references or numeric character references with another value. An XML schema, to which the XML document conforms, may indicate that the XML document is to be stored in a lexical fidelity mode. Additionally, or alternatively, the database statement that (when executed) causes the XML document to be stored in a binary format may so indicate.
摘要翻译：当XML文档以二进制格式存储时，提供了用于确保词汇保真度的技术。不会执行对原始XML文档和XML文档的二进制编码版本之间的词法保真度的XML数据的操作。这样的操作包括删除不必要的空白字符，某些数据类型转换，CRLF归一化，将双标签空元素“折叠”到单个标签空元素中，以及用另一个值替换实体引用或数字字符引用。 XML文档符合的XML模式可以指示XML文档将以词法保真模式存储。另外或替代地，数据库语句（当被执行时）导致XML文档以二进制格式存储可能如此指示。

68. 发明授权

US08015165B2 Efficient path-based operations while searching across versions in a repository 有权
标题翻译：高效的基于路径的操作，同时在存储库中的版本中进行搜索
公开(公告)号：US08015165B2
公开(公告)日：2011-09-06
申请号：US11304414
申请日：2005-12-14
申请人： Sam Idicula , Thomas Baby , Nipun Agarwal , Ravi Murthy
发明人： Sam Idicula , Thomas Baby , Nipun Agarwal , Ravi Murthy
IPC分类号： G06F17/30
CPC分类号： G06F17/30235 , G06F17/30533
摘要： A technique and mechanism for efficiently searching across multiple versions of a resource is provided. New operators are provided that take into account the versions of a particular resource. The query engine evaluates the new operators using either an index-based approach or a functional approach. Under an index-based implementation, a hierarchical index is traversed to find a particular resource (or resources) associated with a specified path and the version history identifier associated with the particular resource(s). A version history table containing references to all versions of the particular resource(s) are then obtained. Under the functional implementation, a link table, which contains all paths in a user's workspace, is examined to determine whether the version history identifier of a particular resource matches a version history identifier of a resource specified in the link table and whether the path to the resource in the link table is related to the path specified.
摘要翻译：提供了一种有效地搜索资源的多个版本的技术和机制。提供了新的运算符，以考虑特定资源的版本。查询引擎使用基于索引的方法或功能方法来评估新的运算符。在基于索引的实现下，遍历分层索引以找到与指定路径相关联的特定资源（或资源）以及与特定资源相关联的版本历史标识符。然后获得包含对特定资源的所有版本的引用的版本历史表。在功能实现下，检查包含用户工作区中的所有路径的链接表，以确定特定资源的版本历史标识符是否与链接表中指定的资源的版本历史标识符是否匹配，链接表中的资源与指定的路径相关。

69. 发明申请

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.
摘要翻译：描述了用于促进解决资源层级的资源路径表达式的两级缓存，其包括系统范围共享高速缓存和会话级缓存。共享缓存被组织为映射存储库层次结构的散列表的层次结构。共享缓存中的特定哈希表包括特定资源的子资源的信息。管理共享高速缓存的数据库管理系统可以基于存储库中的资源的一个或多个特性来实现对高速缓存的替换策略来控制高速缓存所使用的存储器量。会话级缓存是单级缓存，其中可以跟踪解析的路径表达式的目标资源的信息。在会话级缓存中，资源信息与相关资源的整个路径表达式相关联。

70. 发明授权

US07933935B2 Efficient partitioning technique while managing large XML documents 有权
标题翻译：管理大型XML文档时的高效分区技术
公开(公告)号：US07933935B2
公开(公告)日：2011-04-26
申请号：US11716074
申请日：2007-03-08
申请人： Sam Idicula , Sivasankaran Chandrasekar , Nipun Agarwal
发明人： Sam Idicula , Sivasankaran Chandrasekar , Nipun Agarwal
IPC分类号： G06F17/00
CPC分类号： G06F17/30923
摘要： A method is provided to efficiently evaluate an expression to determine the partition key for an XML document stored in a database without the entire XML document first being stored in temporary memory storage. The partition key is determined using streaming evaluation or incrementally using a DOM node tree as a portion of the document is read and stored in the buffer. The XML document is stored in the partition using the read portion of the document stored in the buffer and the remaining portion from the original source.
摘要翻译：提供了一种方法来有效地评估表达式以确定存储在数据库中的XML文档的分区密钥，而不将整个XML文档首先存储在临时存储器存储器中。当文档的一部分被读取并存储在缓冲器中时，使用流式评估或递增地使用DOM节点树来确定分区密钥。使用存储在缓冲区中的文档的读取部分和原始源的剩余部分将XML文档存储在分区中。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式