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

41. 发明申请

US20110302195A1 Multi-Versioning Mechanism for Update of Hierarchically Structured Documents Based on Record Storage 审中-公开
标题翻译：基于记录存储的层次结构化文档更新的多版本化机制
公开(公告)号：US20110302195A1
公开(公告)日：2011-12-08
申请号：US12796599
申请日：2010-06-08
申请人： Mengchu Cai , Eric N. Katayama , Guogen Zhang , Shirley Zhou
发明人： Mengchu Cai , Eric N. Katayama , Guogen Zhang , Shirley Zhou
IPC分类号： G06F17/30
CPC分类号： G06F16/83
摘要： A method for multi-versioning data of a hierarchically structured document stored in data records includes: changing document data in one or more data records, each data record assigned a record identifier, the data record including a plurality of nodes assigned a node identifier, and the document assigned a document identifier; storing an update timestamp in a base table row referencing the document identifier; storing in each changed data record a start timestamp for a start of a validity period for the changed data record and an end timestamp for an end of the validity period; and storing the start timestamp and the end timestamp in one or more node identifier index entries referencing the document identifier, the record identifier, and the node identifier. A version of the document may be obtained using node identifier index entries satisfying a version timestamp.
摘要翻译：一种存储在数据记录中的分层结构化文档的数据多版本化方法包括：在一个或多个数据记录中改变文档数据，每个数据记录分配记录标识符，数据记录包括分配有节点标识符的多个节点，以及该文件分配了文件标识符; 将更新时间戳存储在引用文档标识符的基表行中; 在每个改变的数据记录中存储用于所述改变的数据记录的有效期的开始的开始时间戳和所述有效期的结束的结束时间戳; 并将开始时间戳和结束时间戳存储在引用文档标识符，记录标识符和节点标识符的一个或多个节点标识符索引条目中。可以使用满足版本时间戳的节点标识符索引条目来获得文档的版本。

42. 发明授权

US08019779B2 Efficient locking protocol for sub-document concurrency control using prefix encoded node identifiers in XML databases 有权
标题翻译：在XML数据库中使用前缀编码节点标识符的子文档并发控制的高效锁定协议
公开(公告)号：US08019779B2
公开(公告)日：2011-09-13
申请号：US10709416
申请日：2004-05-04
申请人： James Zu-Chia Teng , Brian Shaun Vickery , Guogen Zhang
发明人： James Zu-Chia Teng , Brian Shaun Vickery , Guogen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30362
摘要： A system and method for concurrency control of hierarchically structured data is provided. Lock requests on a target node are processed by exploiting ancestor-descendant information encoded into prefix encoded node identifiers (IDs). A set of implicit locks on ancestor nodes along a path from an immediate parent of a target node to a root node is derived from an explicit lock request on a target node. A logical lock tree describing existing lock modes for ancestor nodes is consulted to determine compatibility with the derived set of implicit locks. If existing lock modes for ancestor nodes are compatible with the derived set of implicit locks, a lock request on a target node is granted. Otherwise, the lock request is denied. A lock release request follows the reverse process; a target node in a particular transaction is released, as are subsequent locks on its ancestors made by the same transaction.
摘要翻译：提供了一种用于分级结构化数据并发控制的系统和方法。通过利用编码为前缀编码节点标识符（ID）的祖先 - 后代信息来处理目标节点上的锁定请求。从目标节点的直接父节点到根节点的路径上的祖先节点上的一组隐式锁派生自目标节点上的显式锁定请求。查询描述祖先节点的现有锁模式的逻辑锁树，以确定与导出的隐式锁定集的兼容性。如果祖先节点的现有锁定模式与导出的隐式锁定集合兼容，则会授予目标节点上的锁定请求。否则，锁请求被拒绝。锁定释放请求遵循相反的过程; 特定事务中的目标节点被释放，同一事务由其祖先的后续锁也被释放。

43. 发明授权

US07937413B2 Self-adaptive prefix encoding for stable node identifiers 失效
标题翻译：用于稳定节点标识符的自适应前缀编码
公开(公告)号：US07937413B2
公开(公告)日：2011-05-03
申请号：US10709415
申请日：2004-05-04
申请人： Brian Thinh-Vinh Tran , Guogen Zhang
发明人： Brian Thinh-Vinh Tran , Guogen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30908
摘要： A variable-length binary string is utilized to encode node identifiers in a tree for an XML document object model. A general prefix encoding scheme is followed; a node identifier is generated by the concatenation of encodings at each level of a tree along a path from a root node to another particular node. Arbitrary insertions are supported without change to existing node identifier encodings. In addition, the method provides for document order when unsigned binary string comparison is used to compare encoded node identifiers. In support of sub-document concurrency control, prefix encoding provides a way to derive ancestor-descendant relationships among nodes in a tree. Lastly, the encoding method provides a natural pre-order clustering sequence, also known as depth-first clustering. If a prefix is applied to an encoding with a level number, starting with zero at the root, width-first clustering will result. A mixed clustering can also be supported.
摘要翻译：使用可变长度的二进制字符串来编码用于XML文档对象模型的树中的节点标识符。遵循一般的前缀编码方案; 通过沿着从根节点到另一个特定节点的路径的树的每个级别的编码的级联来生成节点标识符。支持任意插入，而不改变现有的节点标识符编码。此外，当使用无符号二进制字符串比较来比较编码节点标识符时，该方法提供了文档顺序。为了支持子文档并发控制，前缀编码提供了一种在树中节点之间派生祖先 - 后代关系的方法。最后，编码方法提供了一种自然的预购聚类序列，也称为深度优先聚类。如果将前缀应用于具有级号的编码，则从根开始为零，将导致宽度优先聚类。也可以支持混合群集。

44. 发明授权

US07529726B2 XML sub-document versioning method in XML databases using record storages 失效
标题翻译：使用记录存储的XML数据库中的XML子文档版本控制方法
公开(公告)号：US07529726B2
公开(公告)日：2009-05-05
申请号：US11161908
申请日：2005-08-22
申请人： James Zu-Chia Teng , Guogen Zhang , Qinghua Zou
发明人： James Zu-Chia Teng , Guogen Zhang , Qinghua Zou
IPC分类号： G06F17/30
CPC分类号： G06F17/30923 , Y10S707/99931 , Y10S707/99937 , Y10S707/99953
摘要： A new sub-document versioning method for record storages of XML documents which uses virtual cutting points to ensure that a search tree is able to support multiple versions of sub-documents and provide efficient mechanisms for XML updating. Record boundaries and virtual cut points divide the two-dimensional space, the horizontal axis representing node identifiers in document order and vertical axis representing version numbers, into rectangles. The bottom corner of the rectangle is used to represent the rectangles and the corresponding information of the corner is added to the search tree index.
摘要翻译：一种用于记录XML文档存储的新的子文档版本控制方法，它使用虚拟切割点来确保搜索树能够支持多个版本的子文档，并为XML更新提供有效的机制。记录边界和虚拟切点将二维空间分开，横轴表示文档顺序中的节点标识符和表示版本号的垂直轴，成矩形。矩形的底角用于表示矩形，并将角的相应信息添加到搜索树索引。

45. 发明申请

US20060004758A1 An Efficient Locking Protocol for Sub-Document Concurrency Control Using Prefix Encoded Node Identifiers in XML Databases 有权
标题翻译：使用XML数据库中的前缀编码节点标识符进行子文档并发控制的高效锁定协议
公开(公告)号：US20060004758A1
公开(公告)日：2006-01-05
申请号：US10709416
申请日：2004-05-04
申请人： James Teng , Brian Vickery , Guogen Zhang
发明人： James Teng , Brian Vickery , Guogen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30362
摘要： A system and method for concurrency control of hierarchically structured data is provided. Lock requests on a target node are processed by exploiting ancestor-descendant information encoded into prefix encoded node identifiers (IDs). A set of implicit locks on ancestor nodes along a path from an immediate parent of a target node to a root node is derived from an explicit lock request on a target node. A logical lock tree describing existing lock modes for ancestor nodes is consulted to determine compatibility with the derived set of implicit locks. If existing lock modes for ancestor nodes are compatible with the derived set of implicit locks, a lock request on a target node is granted. Otherwise, the lock request is denied. A lock release request follows the reverse process; a target node in a particular transaction is released, as are subsequent locks on its ancestors made by the same transaction.
摘要翻译：提供了一种用于分级结构化数据并发控制的系统和方法。通过利用编码为前缀编码节点标识符（ID）的祖先 - 后代信息来处理目标节点上的锁定请求。从目标节点的直接父节点到根节点的路径上的祖先节点上的一组隐式锁派生自目标节点上的显式锁定请求。查询描述祖先节点的现有锁模式的逻辑锁树，以确定与导出的隐式锁定集的兼容性。如果祖先节点的现有锁定模式与导出的隐式锁定集合兼容，则会授予目标节点上的锁定请求。否则，锁请求被拒绝。锁定释放请求遵循相反的过程; 特定事务中的目标节点被释放，同一事务由其祖先的后续锁也被释放。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式