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

1. 发明授权

US08117170B2 Transient range versioning based on redirection 失效
标题翻译：基于重定向的瞬态范围版本控制
公开(公告)号：US08117170B2
公开(公告)日：2012-02-14
申请号：US10711808
申请日：2004-10-06
申请人： James C. Kleewein , Edison Lao Ting
发明人： James C. Kleewein , Edison Lao Ting
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30309
摘要： A method (and an article of manufacture having computer readable program code to implement the method) is disclosed to version a node range and locate a versioned node range in a storage architecture, wherein the method comprises: maintaining a set of node ranges, with each node range being formed from a range of node ID values assigned to each node among a plurality of nodes, receiving a node modification request for a node range from a database system, versioning the node range by copying (to a storage) a node range to which the node modification request is to be made, labeling the copied node range with a timestamp, locating the labeled node range via the timestamp and a hash on the node range, and outputting the located labeled node range. Optionally, versioning is done by shadowing nodes in the range to a version hash table based on a range identifier.
摘要翻译：公开了一种方法（以及具有用于实现该方法的计算机可读程序代码的制造物品），用于对节点范围进行版本定位并将存储体系结构中的版本化节点范围定位，其中所述方法包括：维护一组节点范围，节点范围从分配给多个节点中的每个节点的节点ID值的范围形成，从数据库系统接收节点范围的节点修改请求，通过将节点范围复制（存储）到节点范围来对节点范围进行版本化要进行节点修改请求，用时间戳标记复制的节点范围，经由时间戳定位标记的节点范围，并在节点范围上定位散列，并输出定位的标记节点范围。可选地，版本控制通过基于范围标识符将范围内的节点映射到版本哈希表来完成。

2. 发明授权

US08086956B2 Isolated ordered regions (IOR) node order 失效
公开(公告)号：US08086956B2
公开(公告)日：2011-12-27
申请号：US11837712
申请日：2007-08-13
申请人： Edison Lao Ting , James C. Kleewein
发明人： Edison Lao Ting , James C. Kleewein
IPC分类号： G06F17/27
CPC分类号： G06F17/30896 , G06F17/2247 , G06F17/272 , Y10S707/99934
摘要： Method for ordering nodes within hierarchical data. The concept of isolated ordered regions to maintain coordinates of nodes is used by associating each node with coordinates relative to a containing region. Modifications to nodes within a region only affect the nodes in that region, and not nodes in other regions. Traversals that retrieve information from the nodes can rebase the coordinates from their containing region and return with a total order.

3. 发明授权

US07647313B2 Isolated ordered regions (IOR) node order 失效
标题翻译：隔离有序区域（IOR）节点顺序
公开(公告)号：US07647313B2
公开(公告)日：2010-01-12
申请号：US11837741
申请日：2007-08-13
申请人： Edison Lao Ting , James C. Kleewein
发明人： Edison Lao Ting , James C. Kleewein
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30896 , G06F17/2247 , G06F17/272 , Y10S707/99934
摘要： Method for ordering nodes within hierarchical data. The concept of isolated ordered regions to maintain coordinates of nodes is used by associating each node with coordinates relative to a containing region. Modifications to nodes within a region only affect the nodes in that region, and not nodes in other regions. Traversals that retrieve information from the nodes can rebase the coordinates from their containing region and return with a total order.
摘要翻译：在层次数据中排序节点的方法。通过将每个节点与相对于包含区域的坐标相关联来使用隔离有序区域维持节点坐标的概念。对区域内节点的修改仅影响该区域中的节点，而不影响其他区域中的节点。从节点检索信息的遍历可以从其包含的区域中重新调整坐标，并以总顺序返回。

4. 发明授权

US07165147B2 Isolated ordered regions (IOR) prefetching and page replacement 失效
标题翻译：隔离有序区域（IOR）预取和页面替换
公开(公告)号：US07165147B2
公开(公告)日：2007-01-16
申请号：US10604453
申请日：2003-07-22
申请人： Edison Lao Ting , James C. Kleewein
发明人： Edison Lao Ting , James C. Kleewein
IPC分类号： G06F12/00 , G06F12/12
CPC分类号： G06F12/0862 , G06F12/121
摘要： The concept of isolated ordered regions to maintain coordinates of nodes is used by associating each node with coordinates relative to a containing region. Modifications to nodes within a region only affect the nodes in that region, and not nodes in other regions. Traversals that retrieve information from the nodes can rebase the coordinates from their containing region and return with a total order. Access patterns and usage are used to recognize and prefetch pages. The probability of revisiting traversed nodes are identified and pages in a bufferpool are replaced based upon the identified probabilities (e.g., replacing pages with the least probability of a revisit).
摘要翻译：通过将每个节点与相对于包含区域的坐标相关联来使用隔离有序区域维持节点坐标的概念。对区域内节点的修改仅影响该区域中的节点，而不影响其他区域中的节点。从节点检索信息的遍历可以从其包含的区域中重新调整坐标，并以总顺序返回。访问模式和用法用于识别和预取页面。识别遍历节点的重新访问概率，并且基于所识别的概率来替换缓冲池中的页面（例如，替换具有最小访问概率的页面）。

5. 发明授权

US08037082B2 Isolated ordered regions (IOR) node order 失效
标题翻译：隔离有序区域（IOR）节点顺序
公开(公告)号：US08037082B2
公开(公告)日：2011-10-11
申请号：US10604450
申请日：2003-07-22
申请人： Edison Lao Ting , James C Kleewein
发明人： Edison Lao Ting , James C Kleewein
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30896 , G06F17/2247 , G06F17/272 , Y10S707/99934
摘要： Method for ordering nodes within hierarchical data. The concept of isolated ordered regions to maintain coordinates of nodes is used by associating each node with coordinates relative to a containing region. Modifications to nodes within a region only affect the nodes in that region, and not nodes in other regions. Traversals that retrieve information from the nodes can rebase the coordinates from their containing region and return with a total order.
摘要翻译：在层次数据中排序节点的方法。通过将每个节点与相对于包含区域的坐标相关联来使用隔离有序区域维持节点坐标的概念。对区域内节点的修改仅影响该区域中的节点，而不影响其他区域中的节点。从节点检索信息的遍历可以从其包含的区域中重新调整坐标，并以总顺序返回。

6. 发明授权

US09760652B2 Hierarchical storage architecture using node ID ranges 有权
公开(公告)号：US09760652B2
公开(公告)日：2017-09-12
申请号：US10870924
申请日：2004-06-21
申请人： Robert William Lyle , Edison Lao Ting
发明人： Robert William Lyle , Edison Lao Ting
IPC分类号： G06F17/30
CPC分类号： G06F17/30911
摘要： A system and method for managing and storing logically grouped hierarchical data via physical block storage is provided. Logical groups of parsed XML node data forming node ID ranges are indexed by creating and inserting an index entry into a node ID range. Index entries indicate node ID range bounds for blocks in which nodes are stored. Consulting a node ID range index facilitates XML node traversal via logical links between nodes in different blocks. Additionally, physical links between nodes within a block allow for fast node traversal. Node update including insertion and deletion as well as document order based pre-fetch and XML document re-organization is also facilitated by this architecture.

7. 发明授权

US07698295B2 Method and apparatus for handling a LET binding 有权
标题翻译：用于处理LET绑定的方法和装置
公开(公告)号：US07698295B2
公开(公告)日：2010-04-13
申请号：US11684410
申请日：2007-03-09
申请人： Kevin Scott Beyer , Edison Lao Ting
发明人： Kevin Scott Beyer , Edison Lao Ting
IPC分类号： G06F17/30
CPC分类号： G06F17/30929 , Y10S707/99943
摘要： An apparatus and method for handling a LET binding used in a WHERE clause of an XQuery FLWOR expression during an XML pivot join procedure. XPath steps under a LET binding are identified and marked as bindings. During a match graph construction phase of the pivot join procedure, the bindings are linked to a first common non-LET binding ancestor, while traversing from the bottom up. A location identifier for each binding is truncated to the location identifier of the first common non-LET binding ancestor to create a truncated location identifier. The truncated location identifier is compared to a node identification of a FOR binding of the XQuery FLWOR expression. A match of the node identifications will qualify the XML document and the XML document is returned by the XML pivot join procedure.
摘要翻译：一种用于在XML枢轴连接过程中处理XQuery FLWOR表达式的WHERE子句中使用的LET绑定的装置和方法。识别LET绑定下的XPath步骤，并将其标记为绑定。在枢轴连接过程的匹配图构造阶段期间，绑定链接到第一个公共非LET绑定祖先，同时从下往上遍历。每个绑定的位置标识符被截断为第一个公共非LET绑定祖先的位置标识符以创建截断的位置标识符。将截断的位置标识符与XQuery FLWOR表达式的FOR绑定的节点标识进行比较。节点标识的匹配将限定XML文档，并且XML文档由XML枢轴连接过程返回。

8. 发明授权

US07552119B2 Apparatus and method for skipping XML index scans with common ancestors of a previously failed predicate 有权
标题翻译：用以前故障谓词的共同祖先跳过XML索引扫描的设备和方法
公开(公告)号：US07552119B2
公开(公告)日：2009-06-23
申请号：US11613757
申请日：2006-12-20
申请人： Edison Lao Ting , Tuong Chanh Truong
发明人： Edison Lao Ting , Tuong Chanh Truong
IPC分类号： G06F17/30
CPC分类号： G06F17/30938 , Y10S707/99936 , Y10S707/99943
摘要： An apparatus and method are disclosed for skipping XML index scans with common ancestors of a previously failed predicate. An XML index is scanned by an XML index scan to filter entries of the index matching at least one search value (predicate) of an XML query. When the XML index scan finds a matching entry, the entry is passed to an XPath evaluation component. The XPath evaluation component evaluates the entry against remaining predicates of the XML query for further qualification. When the XPath evaluation component disqualifies an entry, the XPath evaluation component provides feedback to the XML index scan to skip remaining entries comprising a common ancestor of the disqualified entry's path. The XML index scan can then efficiently skip index entries that will not qualify against the XML query.
摘要翻译：公开了一种用于跳过具有先前故障谓词的共同祖先的XML索引扫描的装置和方法。通过XML索引扫描扫描XML索引，以过滤与XML查询的至少一个搜索值（谓词）匹配的索引的条目。当XML索引扫描找到匹配的条目时，该条目将传递给XPath评估组件。 XPath评估组件根据XML查询的剩余谓词评估条目以进一步验证。当XPath评估组件取消条目资格时，XPath评估组件向XML索引扫描提供反馈，以跳过包含不合格条目路径的共同祖先的剩余条目。然后，XML索引扫描可以有效地跳过不符合XML查询条件的索引条目。

9. 发明授权

US08180802B2 Extensible decimal identification system for ordered nodes 失效
标题翻译：有序节点的可扩展十进制识别系统
公开(公告)号：US08180802B2
公开(公告)日：2012-05-15
申请号：US10605448
申请日：2003-09-30
申请人： Kevin Scott Beyer , Robert William Lyle , Edison Lao Ting
发明人： Kevin Scott Beyer , Robert William Lyle , Edison Lao Ting
IPC分类号： G06F17/30
CPC分类号： G06F17/30961
摘要： An extensible identification system for nodes in a hierarchy is described wherein each node is assigned a concatenation of decimal based values. The values assigned uniquely identify the node, provides an order for the node, and identifies its parent, child, and sibling relationships with other nodes Furthermore, the IDs assigned can be encoded to be byte comparable. Furthermore, the ID's assigned to nodes need not be modified when changes (adding/deleting a child node or a subtree of nodes) are made in the hierarchy. Additionally, in the event of such a change, the order and relationships between the parent, child, and sibling nodes are retained.
摘要翻译：描述了用于层次结构中的节点的可扩展识别系统，其中每个节点被分配为基于十进制的值的级联。分配的值唯一标识节点，提供节点的顺序，并识别其与其他节点的父，子节点和兄弟关系。此外，分配的ID可以编码为字节可比。此外，在层次结构中进行更改（添加/删除子节点或节点子树）时，不需要修改分配给节点的ID。另外，如果发生这种变化，则保留父，子和兄弟节点之间的顺序和关系。

10. 发明授权

US08112462B2 Distributed garbage collection in a dataflow system 有权
标题翻译：在数据流系统中分布式垃圾回收
公开(公告)号：US08112462B2
公开(公告)日：2012-02-07
申请号：US12622596
申请日：2009-11-20
申请人： Mayank Pradhan , Edison Lao Ting , Robbert Van der Linden
发明人： Mayank Pradhan , Edison Lao Ting , Robbert Van der Linden
IPC分类号： G06F17/30
CPC分类号： G06F12/0269
摘要： A method and system for distributed garbage collection in a pipelined workflow environment comprising a plurality of processing nodes that pass item references to each other. Each node maintains a reference list of local item references and a reference dictionary of remote item references, and periodically synchronizes the reference list with the reference dictionaries of other nodes in the workflow, so that item references are not marked for garbage collection while other processing nodes may still have outstanding references to them.
摘要翻译：一种用于在流水线工作流环境中分布式垃圾收集的方法和系统，包括将项目引用彼此传递的多个处理节点。每个节点维护本地项目引用的引用列表和远程项目引用的引用字典，并且周期性地将参考列表与工作流中的其他节点的引用字典同步，使得项目引用不被标记为垃圾收集，而其他处理节点可能仍然有很好的参考。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式