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

1. 发明申请

US20060173927A1 Extensible Decimal Identification System for Ordered Nodes 失效
标题翻译：有序节点的可扩展十进制识别系统
公开(公告)号：US20060173927A1
公开(公告)日：2006-08-03
申请号：US10605448
申请日：2003-09-30
申请人： Kevin Beyer , Robert Lyle , Edison Ting
发明人： Kevin Beyer , Robert Lyle , Edison 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。另外，如果发生这种变化，则保留父，子和兄弟节点之间的顺序和关系。

2. 发明申请

US20070174241A1 Match graphs for query evaluation 审中-公开
标题翻译：匹配图表进行查询评估
公开(公告)号：US20070174241A1
公开(公告)日：2007-07-26
申请号：US11336022
申请日：2006-01-20
申请人： Kevin Beyer , Vanja Josifovski , Edison Ting
发明人： Kevin Beyer , Vanja Josifovski , Edison Ting
IPC分类号： G06F17/30
CPC分类号： G06F17/2247 , G06F16/8365 , G06F17/2241
摘要： Provided are techniques for processing a query. The query is received, and the query is formed by one or more paths, where each path includes one or more steps. A hierarchical document is received that includes one or more document nodes. While processing the query and traversing the hierarchical document to find document nodes described by at least one of the one or more steps of the query, a match graph is constructed that includes one or more match nodes. Each of the match nodes identifies a step instance and is associated with step instances that are ancestors and descendants of the identified step instance. Also, each of the match nodes is associated with a level. In addition, the match graph includes zero or more edges between the match nodes indicating relationships between the match nodes. The match nodes in the match graph are traversed from lower levels to higher levels to construct results for the query.
摘要翻译：提供了用于处理查询的技术。接收到查询，并且查询由一个或多个路径形成，其中每个路径包括一个或多个步骤。收到包含一个或多个文档节点的分层文档。在处理查询并遍历分层文档以查找由查询的一个或多个步骤中的至少一个描述的文档节点时，构建包括一个或多个匹配节点的匹配图。每个匹配节点标识步骤实例，并且与作为所识别的步骤实例的祖先和后代的步骤实例相关联。此外，每个匹配节点与一个级别相关联。此外，匹配图包括指示匹配节点之间的关系的匹配节点之间的零个或多个边缘。匹配图中的匹配节点从较低级别遍历到更高级别，以构造查询的结果。

3. 发明申请

US20060004792A1 Hierarchical storage architecture using node ID ranges 有权
标题翻译：使用节点ID范围的分层存储架构
公开(公告)号：US20060004792A1
公开(公告)日：2006-01-05
申请号：US10870924
申请日：2004-06-21
申请人： Robert Lyle , Edison Ting
发明人： Robert Lyle , Edison Ting
IPC分类号： G06F17/00
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.
摘要翻译：提供了一种用于通过物理块存储管理和存储逻辑分组的分层数据的系统和方法。通过创建索引条目并将其插入到节点ID范围内，对生成节点ID范围的已解析XML节点数据的逻辑组进行索引。索引条目指示节点ID存储节点的范围界限。咨询节点ID范围索引便于通过不同块中的节点之间的逻辑链路遍历XML节点。另外，块内的节点之间的物理链路允许快速节点遍历。此架构也促进了包括插入和删除以及基于文档顺序的预取和XML文档重新组织的节点更新。

4. 发明申请

US20080033975A1 Isolated Ordered Regions (IOR) Node Order 失效
公开(公告)号：US20080033975A1
公开(公告)日：2008-02-07
申请号：US11837712
申请日：2007-08-13
申请人： Edison Ting , James Kleewein
发明人： Edison Ting , James Kleewein
IPC分类号： G06F7/00 , G06F17/00
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.

5. 发明申请

US20070174242A1 Query evaluation using ancestor information 失效
标题翻译：使用祖先信息进行查询评估
公开(公告)号：US20070174242A1
公开(公告)日：2007-07-26
申请号：US11336140
申请日：2006-01-20
申请人： Vanja Josifovski , Edison Ting
发明人： Vanja Josifovski , Edison Ting
IPC分类号： G06F17/30
CPC分类号： G06F17/272 , G06F17/30424 , G06F17/30433 , G06F17/30929 , G06F17/30938 , Y10S707/99933
摘要： Provided are techniques for processing a query. A query is received, wherein the query is formed by one or more paths, and wherein each path includes one or more steps. A hierarchical document including one or more document nodes is received. While processing the query and traversing the hierarchical document, one or more extraction entries are constructed, wherein each extraction entry includes a step instance match candidate identifying a document node and a step instance ancestor path for the document node, and one or more tuples are constructed using the one or more extraction entries by associating the step instance match candidate from one of the one or more extraction entries with the step instance match candidate from at least one of the one or more other extraction entries.
摘要翻译：提供了用于处理查询的技术。接收到查询，其中查询由一个或多个路径形成，并且其中每个路径包括一个或多个步骤。接收包括一个或多个文档节点的分层文档。在处理查询并遍历分层文档时，构建一个或多个提取条目，其中每个提取条目包括标识文档节点的步骤实例匹配候选和文档节点的步骤实例祖先路径，并且构造一个或多个元组通过将所述一个或多个提取条目中的一个提取条目的所述步骤实例匹配候选与所述一个或多个其他提取条目中的至少一个提取条目与所述步骤实例匹配候选相关联来使用所述一个或多个提取条目。

6. 发明申请

US20150032492A1 Methods of Identifying Relevant Content and Subject Matter Expertise for Online Communities 审中-公开
标题翻译：识别相关内容的方法和在线社区的主题专长
公开(公告)号：US20150032492A1
公开(公告)日：2015-01-29
申请号：US13950258
申请日：2013-07-24
申请人： Edison Ting , Kirk Yokomizo , Hao Tang , Johny Vinh Tuan Lam , Jack Herrington , Ed VanSiclen
发明人： Edison Ting , Kirk Yokomizo , Hao Tang , Johny Vinh Tuan Lam , Jack Herrington , Ed VanSiclen
IPC分类号： G06Q10/06 , G06Q50/00
CPC分类号： G06Q10/063112 , G06Q50/01
摘要： A disclosed method identifies a subject matter expert in an online community for a business entity. The method is performed at a server having one or more processors and memory. The method identifies a plurality of subject matter areas for postings on a website for an online community, and each posting is assigned to one or more of the subject matter areas. For a first subject matter area a set of users is identified, each of whom has authored a plurality of postings assigned to the first subject matter area. A first user of the set of users is identified as a subject matter expert for the first subject matter area based on a determination that the first user's postings assigned to the first subject matter area have consistently been highly relevant to the first subject matter area over a predefined period of time.
摘要翻译：公开的方法识别商业实体的在线社区中的主题专家。该方法在具有一个或多个处理器和存储器的服务器上执行。该方法识别用于在线社区的网站上的过帐的多个主题区域，并且将每个发布分配给主题区域中的一个或多个。对于第一主题区域，识别一组用户，每个用户已经创作了分配给第一主题区域的多个帖子。基于确定分配给第一主题区域的第一用户的发布一直与第一主题区域高度相关的确定，将该组用户的第一用户识别为第一主题区域的主题专家，预定义的时间段。

7. 发明申请

US20080040337A1 Isolated Ordered Regions (IOR) Node Order 失效
标题翻译：隔离有序区域（IOR）节点顺序
公开(公告)号：US20080040337A1
公开(公告)日：2008-02-14
申请号：US11837741
申请日：2007-08-13
申请人： Edison Ting , James Kleewein
发明人： Edison Ting , James Kleewein
IPC分类号： G06F7/00
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.
摘要翻译：在层次数据中排序节点的方法。通过将每个节点与相对于包含区域的坐标相关联来使用隔离有序区域维持节点坐标的概念。对区域内节点的修改仅影响该区域中的节点，而不影响其他区域中的节点。从节点检索信息的遍历可以从其包含的区域中重新调整坐标，并以总顺序返回。

8. 发明申请

US20050018152A1 ISOLATED ORDERED REGIONS (IOR) PREFETCHING AND PAGE REPLACEMENT 失效
标题翻译：隔离区域（IOR）预选和页面替换
公开(公告)号：US20050018152A1
公开(公告)日：2005-01-27
申请号：US10604453
申请日：2003-07-22
申请人： Edison Ting , James Kleewein
发明人： Edison Ting , James Kleewein
IPC分类号： G03B21/14
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).
摘要翻译：通过将每个节点与相对于包含区域的坐标相关联来使用隔离有序区域维持节点坐标的概念。对区域内节点的修改仅影响该区域中的节点，而不影响其他区域中的节点。从节点检索信息的遍历可以从其包含的区域中重新调整坐标，并以总顺序返回。访问模式和用法用于识别和预取页面。识别遍历节点的重新访问概率，并且基于所识别的概率来替换缓冲池中的页面（例如，替换具有最小访问概率的页面）。

9. 发明申请

US20060075000A1 Transient Range Versioning Based on Redirection 失效
标题翻译：基于重定向的瞬态范围版本控制
公开(公告)号：US20060075000A1
公开(公告)日：2006-04-06
申请号：US10711808
申请日：2004-10-06
申请人： James Kleewein , Edison Ting
发明人： James Kleewein , Edison Ting
IPC分类号： G06F17/30
CPC分类号： G06F17/30309
摘要： A mechanism is described for transient versioning in architectures that manage node ranges, wherein each node is assigned a node ID value and a set of nodes form a range of node IDs called a node range. Each entry in the index describes one range and points to where the range is located. Individual nodes are located by finding the correct range in the index. When nodes are added to or deleted from a node range, the range of nodes are versioned by copying the nodes before changes, to transient storage, and then the original nodes are modified. Different versions are tracked by assigning timestamps to each copy of the node range. Each entry in the node ID range index points to the location of the nodes in a range called the range identifier or RID. Before changes are made in a range, the nodes in a range are copied to a Version Hash Table based on the RID. Copies of the range including the current one is assigned a timestamp or LSN. New readers after a change, access the current nodes through RID, while old readers access the old nodes through the same RID, but hashing it to find the shadowed copy in the Version Hash Table. If changes causes nodes in the range to be moved to a new RID, previous readers need to be redirected from the new RID to the old RID.
摘要翻译：描述了用于管理节点范围的架构中的瞬态版本化的机制，其中每个节点被分配有节点ID值，并且一组节点形成称为节点范围的节点ID的范围。索引中的每个条目都描述一个范围，并指出范围所在的位置。通过在索引中找到正确的范围来定位各个节点。当节点被添加到或从节点范围中删除时，节点的范围通过将更改之前的节点复制到临时存储，然后修改原始节点进行版本控制。通过为节点范围的每个副本分配时间戳来跟踪不同的版本。节点ID范围索引中的每个条目指向称为范围标识符或RID的范围内的节点的位置。在范围内进行更改之前，将范围内的节点根据RID复制到版本散列表中。分配包括当前范围的范围的副本被分配了时间戳或LSN。新读者在更改后，通过RID访问当前节点，而旧读者通过相同的RID访问旧节点，但是可以在“版本哈希表”中查找阴影副本。如果更改导致该范围内的节点移动到新的RID，则以前的读者需要从新的RID重定向到旧的RID。

10. 发明申请

US20060004791A1 Use of pseudo keys in node ID range based storage architecture 审中-公开
标题翻译：在基于节点ID范围的存储架构中使用伪密钥
公开(公告)号：US20060004791A1
公开(公告)日：2006-01-05
申请号：US10870923
申请日：2004-06-21
申请人： James Kleewein , Edison Ting
发明人： James Kleewein , Edison Ting
IPC分类号： G06F17/00
CPC分类号： G06F16/9027
摘要： A method of computing pseudo keys facilitates the bounding of node ID ranges. Pseudo keys are computed to facilitate node location in node ID ranges that have been split. A pseudo previous high key is computed by decrementing the last digit of the lowest node ID value in a newly formed node ID range by one and by appending ‘x’.‘x’. A computed pseudo key has no previous siblings or descendants of previous sibling having a node ID higher in value than a computed pseudo previous high key. Pseudo keys are also computed to define boundaries of a sub-tree. The range determined by a pseudo previous high key for a highest valued root node and a pseudo sub-tree high key bounds a sub-tree. Sub-tree pseudo keys are also comprised of a pseudo sub-tree low key and a pseudo end of document key.
摘要翻译：计算伪密钥的方法有助于节点ID范围的界限。计算伪密钥以便于已经拆分的节点ID范围内的节点位置。通过将新形成的节点ID范围中的最低节点ID值的最后一位递减1并通过追加“x”。x'来计算伪先前高密钥。计算的伪密钥没有先前兄弟姐妹的先前兄弟姐妹或后代，其节点ID的值高于计算的伪先前高密钥。还计算伪密钥以定义子树的边界。由用于最高值根节点的伪先前高密钥确定的范围和伪子树高密钥限制子树。子树伪密钥也由伪子树低密钥和文档密钥的伪尾组成。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式