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

1. 发明授权

US07870163B2 Implementation of backward compatible XML schema evolution in a relational database system 有权
标题翻译：在关系数据库系统中实现向后兼容的XML模式演进
公开(公告)号：US07870163B2
公开(公告)日：2011-01-11
申请号：US11540341
申请日：2006-09-28
申请人： Abhyudaya Agrawal , Thomas Baby , Nipun Agarwal , Sam Idicula , Ravi Murthy , Eric Sedlar
发明人： Abhyudaya Agrawal , Thomas Baby , Nipun Agarwal , Sam Idicula , Ravi Murthy , Eric Sedlar
IPC分类号： G06F17/30
CPC分类号： G06F17/2247
摘要： In-place XML schema evolution occurs by evaluating an existing XML schema in a database system to see if it is compatible with a new XML schema. To determine if the old schema is compatible with the new schema, a lock-step traversal is performed on the two schemas. Each instruction in the old schema is compared to instructions in the new schema. Detected differences between the two schemas are evaluated to determine if existing XML documents are still compatible with the new schema. If they are, then an in-place schema evolution operation can take place. The in-place schema operation basically, involves appending the updated object information to the underlying object type and preserving the order of elements in a document by storing element mapping information on disk.
摘要翻译：通过评估数据库系统中的现有XML模式来查看是否与新的XML模式兼容，就会发生就地XML模式演进。为了确定旧模式是否与新模式兼容，在两个模式上执行锁步遍历。将旧模式中的每个指令与新模式中的指令进行比较。对两个模式之间的检测差异进行评估，以确定现有XML文档是否仍然与新模式兼容。如果它们是，则可以进行就地模式演进操作。就地模式操作基本上包括将更新的对象信息附加到底层对象类型，并通过在盘上存储元素映射信息来保留文档中元素的顺序。

2. 发明申请

US20080082560A1 Implementation of backward compatible XML schema evolution 有权
标题翻译：实现向后兼容的XML模式演进
公开(公告)号：US20080082560A1
公开(公告)日：2008-04-03
申请号：US11540341
申请日：2006-09-28
申请人： Abhyudaya Agrawal , Thomas Baby , Nipun Agarwal , Sam Idicula , Ravi Murthy , Eric Sedlar
发明人： Abhyudaya Agrawal , Thomas Baby , Nipun Agarwal , Sam Idicula , Ravi Murthy , Eric Sedlar
IPC分类号： G06F7/00
CPC分类号： G06F17/2247
摘要： In-place XML schema evolution occurs by evaluating an existing XML schema in a database system to see if it is compatible with a new XML schema. To determine if the old schema is compatible with the new schema, a lock-step traversal is performed on the two schemas. Each instruction in the old schema is compared to instructions in the new schema. Detected differences between the two schemas are evaluated to determine if existing XML documents are still compatible with the new schema. If they are, then an in-place schema evolution operation can take place. The in-place schema operation basically, involves appending the updated object information to the underlying object type and preserving the order of elements in a document by storing element mapping information on disk.
摘要翻译：通过评估数据库系统中的现有XML模式来查看是否与新的XML模式兼容，就会发生就地XML模式演进。为了确定旧模式是否与新模式兼容，在两个模式上执行锁步遍历。将旧模式中的每个指令与新模式中的指令进行比较。对两个模式之间的检测差异进行评估，以确定现有XML文档是否仍然与新模式兼容。如果它们是，则可以进行就地模式演进操作。就地模式操作基本上包括将更新的对象信息附加到底层对象类型，并通过在盘上存储元素映射信息来保留文档中元素的顺序。

3. 发明授权

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模式生成对象关系表时，元素在模式中出现的最大次数是此值。技术保留对象关系存储的优点，即使在模式演进之后。

4. 发明申请

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模式生成对象关系表时，元素在模式中出现的最大次数是此值。技术保留对象关系存储的优点，即使在模式演进之后。

5. 发明申请

US20080071812A1 Evolution of XML schemas involving partial data copy 有权
标题翻译：涉及部分数据复制的XML模式的演进
公开(公告)号：US20080071812A1
公开(公告)日：2008-03-20
申请号：US11521907
申请日：2006-09-15
申请人： Thomas Baby , Abhyudaya Agrawal , Sam Idicula , Nipun Agarwal
发明人： Thomas Baby , Abhyudaya Agrawal , Sam Idicula , Nipun Agarwal
IPC分类号： G06F7/00
CPC分类号： G06F17/2288 , G06F17/2211 , G06F17/2229 , G06F17/2247 , G06F17/30297
摘要： XML schema evolutions can be performed on an XML-type database using partial data copy techniques. The partial data copy techniques provide mechanisms to identify a minimal set of data in the database that needs be copied out in order for schema evolution operations to occur. Identifying the minimal set of data involves comparing an existing XML schema to a new XML schema and determining the differences between the two schemas. Based on those differences, a minimal set of data can be determined. That data can then be copied to a temporary storage location, while the XML schema and its associated database structure are updated to conform to the new XML schema. Then, the minimal set of data is copied back into the modified database structure.
摘要翻译：可以使用部分数据复制技术在XML类型数据库上执行XML模式演进。部分数据复制技术提供了识别数据库中需要复制出来以便模式演进操作发生的最小数据集的机制。识别最小数据集涉及将现有XML模式与新的XML模式进行比较，并确定两种架构之间的差异。基于这些差异，可以确定最小的数据集。然后可以将该数据复制到临时存储位置，同时更新XML模式及其关联的数据库结构以符合新的XML模式。然后，将最小数据集复制回修改后的数据库结构。

6. 发明授权

US08346725B2 Evolution of XML schemas involving partial data copy 有权
标题翻译：涉及部分数据复制的XML模式的演进
公开(公告)号：US08346725B2
公开(公告)日：2013-01-01
申请号：US11521907
申请日：2006-09-15
申请人： Thomas Baby , Abhyudaya Agrawal , Sam Idicula , Nipun Agarwal
发明人： Thomas Baby , Abhyudaya Agrawal , Sam Idicula , Nipun Agarwal
IPC分类号： G06F7/00
CPC分类号： G06F17/2288 , G06F17/2211 , G06F17/2229 , G06F17/2247 , G06F17/30297
摘要： XML schema evolutions can be performed on an XML-type database using partial data copy techniques. The partial data copy techniques provide mechanisms to identify a minimal set of data in the database that needs be copied out in order for schema evolution operations to occur. Identifying the minimal set of data involves comparing an existing XML schema to a new XML schema and determining the differences between the two schemas. Based on those differences, a minimal set of data can be determined. That data can then be copied to a temporary storage location, while the XML schema and its associated database structure are updated to conform to the new XML schema. Then, the minimal set of data is copied back into the modified database structure.
摘要翻译：可以使用部分数据复制技术在XML类型数据库上执行XML模式演进。部分数据复制技术提供了识别数据库中需要复制出来以便模式演进操作发生的最小数据集的机制。识别最小数据集涉及将现有XML模式与新的XML模式进行比较，并确定两种架构之间的差异。基于这些差异，可以确定最小的数据集。然后可以将该数据复制到临时存储位置，同时更新XML模式及其关联的数据库结构以符合新的XML模式。然后，将最小数据集复制回修改后的数据库结构。

7. 发明授权

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.
摘要翻译：提供了一种有效地搜索资源的多个版本的技术和机制。提供了新的运算符，以考虑特定资源的版本。查询引擎使用基于索引的方法或功能方法来评估新的运算符。在基于索引的实现下，遍历分层索引以找到与指定路径相关联的特定资源（或资源）以及与特定资源相关联的版本历史标识符。然后获得包含对特定资源的所有版本的引用的版本历史表。在功能实现下，检查包含用户工作区中的所有路径的链接表，以确定特定资源的版本历史标识符是否与链接表中指定的资源的版本历史标识符是否匹配，链接表中的资源与指定的路径相关。

8. 发明申请

US20090158047A1 HIGH PERFORMANCE SECURE CACHING IN THE MID-TIER 审中-公开
标题翻译：中层高性能安全缓存
公开(公告)号：US20090158047A1
公开(公告)日：2009-06-18
申请号：US12276182
申请日：2008-11-21
申请人： Thomas Baby , Asha Tarachandani , Naveen Zalpuri , Sam Idicula , Nipun Agarwal , Shu Ling , Ravi Murthy , Fredric Scott Goell , Eric Sedlar , Ming Lei , Ajay Desai , Lawrence Jacobs
发明人： Thomas Baby , Asha Tarachandani , Naveen Zalpuri , Sam Idicula , Nipun Agarwal , Shu Ling , Ravi Murthy , Fredric Scott Goell , Eric Sedlar , Ming Lei , Ajay Desai , Lawrence Jacobs
IPC分类号： H04L9/00
CPC分类号： H04L63/101 , G06F12/0813 , G06F12/0875 , G06F21/6218 , G06F2221/2141 , H04L63/20 , H04L67/14 , H04L67/142 , H04L67/145 , H04L67/28 , H04L67/2819 , H04L67/2842
摘要： In a multi-tier data server system, data from the first tier is cached in a mid-tier cache of the middle tier. Access control information from the first tier for the data is also cached within the mid-tier cache. Caching the security information in the middle tier allows the middle tier to make access control decisions regarding requests for data made by clients in the outer tier.
摘要翻译：在多层数据服务器系统中，来自第一层的数据被缓存在中间层的中间层缓存中。来自数据的第一层的访问控制信息也缓存在中间层缓存中。缓存中间层的安全信息允许中间层对外层客户端的数据请求进行访问控制决策。

9. 发明申请

US20070208946A1 High performance secure caching in the mid-tier 审中-公开
标题翻译：中层高性能安全缓存
公开(公告)号：US20070208946A1
公开(公告)日：2007-09-06
申请号：US11359236
申请日：2006-02-21
申请人： Thomas Baby , Asha Tarachandani , Naveen Zalpuri , Sam Idicula , Nipun Agarwal , Gary Ling , Ravi Murthy , Fredric Goell , Eric Sedlar
发明人： Thomas Baby , Asha Tarachandani , Naveen Zalpuri , Sam Idicula , Nipun Agarwal , Gary Ling , Ravi Murthy , Fredric Goell , Eric Sedlar
IPC分类号： H04L9/00
CPC分类号： H04L63/101 , G06F12/0813 , G06F12/0875 , G06F21/6218 , G06F2221/2141 , H04L63/20 , H04L67/14 , H04L67/142 , H04L67/145 , H04L67/28 , H04L67/2819 , H04L67/2842
摘要： In a multi-tier data server system, data from the first tier is cached in a mid-tier cache of the middle tier. Access control information from the first tier for the data is also cached within the mid-tier cache. Caching the security information in the middle tier allows the middle tier to make access control decisions regarding requests for data made by clients in the outer tier.
摘要翻译：在多层数据服务器系统中，来自第一层的数据被缓存在中间层的中间层缓存中。来自数据的第一层的访问控制信息也缓存在中间层缓存中。缓存中间层的安全信息允许中间层对外层客户端的数据请求进行访问控制决策。

10. 发明申请

US20070043783A1 Handling uniqueness constraints in a database system with versioned data 有权
标题翻译：在具有版本化数据的数据库系统中处理唯一性约束
公开(公告)号：US20070043783A1
公开(公告)日：2007-02-22
申请号：US11295310
申请日：2005-12-05
申请人： Sam Idicula , Nipun Agarwal , Ravi Murthy , Thomas Baby
发明人： Sam Idicula , Nipun Agarwal , Ravi Murthy , Thomas Baby
IPC分类号： G06F17/30
CPC分类号： G06F17/30312 , Y10S707/99953 , Y10S707/99954
摘要： A version history of each of a plurality of resources is stored in a table. The version history for each resource comprises a set of one or more values for the resource, wherein each value in the version history of a resource indicates the value that the resource had in a particular version of the resource. In response to a request to perform an operation that causes a given resource that is subject to a uniqueness constraint to have a particular value, it is determined whether the uniqueness constraint is violated based on whether any version of any resource other than the given resource has the particular value. The uniqueness constraint is determined to be violated if any version of any resource other than the given resource has the particular value. The uniqueness constraint is not violated by existence of a version of the given resource that has the particular value.
摘要翻译：多个资源中的每一个的版本历史被存储在表中。每个资源的版本历史包括用于资源的一个或多个值的集合，其中资源的版本历史中的每个值指示资源在资源的特定版本中具有的值。响应于执行导致受到唯一性约束的给定资源具有特定值的操作的请求，基于是否具有给定资源的任何资源的任何版本的任何版本是否被确定是否违反唯一性约束具体的价值。如果给定资源以外的任何资源的任何版本具有特定值，则唯一性约束被确定为违反。唯一性约束不被存在具有特定值的给定资源的版本所抵触。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式