-
1.
公开(公告)号:US07421445B2
公开(公告)日:2008-09-02
申请号:US10924704
申请日:2004-08-24
申请人: Patrick Eugene O'Neil , Elizabeth Jean O'Neil , Shankar Pal , Gideon Schaller , Istvan Cseri , Jose A. Blakeley , Nigel Clifton Westbury , Sameet Agarwal , F. Soner Terek
发明人: Patrick Eugene O'Neil , Elizabeth Jean O'Neil , Shankar Pal , Gideon Schaller , Istvan Cseri , Jose A. Blakeley , Nigel Clifton Westbury , Sameet Agarwal , F. Soner Terek
CPC分类号: G06F17/30917 , Y10S707/99943 , Y10S707/99956
摘要: A technique for representing the structure of hierarchically-organized data in a non-hierarchical data structure, such as a relation. The hierarchically-organized data is represented as a tree, and each node in the tree is assigned a position identifier that represents both the depth level of the node within the hierarchy, and its ancestor/descendant relationship to other nodes. The data represented by each node, as well as its position identifier, is stored in a row of a relational database, thereby capturing the hierarchical structure of the data in such relational database. A technique is provided for the compressed storage of position identifiers in a format that allows an efficient bytewise comparison of position identifiers to determine relative order and ancestry.
摘要翻译: 用于表示非分层数据结构(例如关系)中的分层组织数据的结构的技术。 分层组织的数据被表示为树,并且树中的每个节点被分配一个位置标识符,其表示层次结构内的节点的深度级别,以及其与其他节点的祖先/后代关系。 由每个节点表示的数据及其位置标识符存储在关系数据库的一行中,从而捕获这种关系数据库中数据的层次结构。 提供了一种用于以允许位置标识符的有效从字面比较确定相对顺序和祖先的格式的位置标识符的压缩存储的技术。
-
2.
公开(公告)号:US07493352B2
公开(公告)日:2009-02-17
申请号:US10925104
申请日:2004-08-24
申请人: Patrick Eugene O'Neil , Elizabeth Jean O'Neil , Shankar Pal , Gideon Schaller , Istvan Cseri , Jose A. Blakeley , Nigel Clifton Westbury , Sameet Agarwal , F. Soner Terek
发明人: Patrick Eugene O'Neil , Elizabeth Jean O'Neil , Shankar Pal , Gideon Schaller , Istvan Cseri , Jose A. Blakeley , Nigel Clifton Westbury , Sameet Agarwal , F. Soner Terek
CPC分类号: G06F17/30917 , Y10S707/99943 , Y10S707/99956
摘要: A technique for representing the structure of hierarchically-organized data in a non-hierarchical data structure, such as a relation. The hierarchically-organized data is represented as a tree, and each node in the tree is assigned a position identifier that represents both the depth level of the node within the hierarchy, and its ancestor/descendant relationship to other nodes. The data represented by each node, as well as its position identifier, is stored in a row of a relational database, thereby capturing the hierarchical structure of the data in such relational database. A technique is provided for the compressed storage of position identifiers in a format that allows an efficient bytewise comparison of position identifiers to determine relative order and ancestry.
摘要翻译: 用于表示非分层数据结构(例如关系)中的分层组织数据的结构的技术。 分层组织的数据被表示为树,并且树中的每个节点被分配一个位置标识符,其表示层次结构内的节点的深度级别,以及其与其他节点的祖先/后代关系。 由每个节点表示的数据及其位置标识符存储在关系数据库的一行中,从而捕获这种关系数据库中数据的层次结构。 提供了一种用于以允许位置标识符的有效从字面比较确定相对顺序和祖先的格式的位置标识符的压缩存储的技术。
-
公开(公告)号:US06889226B2
公开(公告)日:2005-05-03
申请号:US09997531
申请日:2001-11-30
申请人: Patrick Eugene O'Neil , Elizabeth Jean O'Neil , Shankar Pal , Gideon Schaller , Istvan Cseri , Jose A. Blakeley , Nigel Clifton Westbury , Sameet Agarwal , F. Soner Terek
发明人: Patrick Eugene O'Neil , Elizabeth Jean O'Neil , Shankar Pal , Gideon Schaller , Istvan Cseri , Jose A. Blakeley , Nigel Clifton Westbury , Sameet Agarwal , F. Soner Terek
CPC分类号: G06F17/30917 , Y10S707/99943 , Y10S707/99956
摘要: A technique for representing the structure of hierarchically-organized data in a non-hierarchical data structure, such as a relation. The hierarchically-organized data is represented as a tree, and each node in the tree is assigned a position identifier that represents both the depth level of the node within the hierarchy, and its ancestor/descendant relationship to other nodes. The data represented by each node, as well as its position identifier, is stored in a row of a relational database, thereby capturing the hierarchical structure of the data in such relational database. A technique is provided for the compressed storage of position identifiers in a format that allows an efficient bytewise comparison of position identifiers to determine relative order and ancestry.
-
公开(公告)号:US07155442B2
公开(公告)日:2006-12-26
申请号:US10185525
申请日:2002-06-28
IPC分类号: G06F7/08
CPC分类号: G06F17/30985 , G06F17/22 , H03M7/30 , Y10S707/99931 , Y10S707/99932 , Y10S707/99942
摘要: Any string in any character set with an arbitrary-leveled weight-based comparison system is transformed into a bitstring in such a way that two transformed strings can be compared byte-by-byte. The resulting bit string has the minimum possible maximum length. The transformed bit strings can be inverted—meaning the original string can be recovered from the transformed string.
摘要翻译: 任何具有任意级别的基于权重的比较系统的字符集中的任何字符串被转换成位串,使得可以逐字节比较两个变换的字符串。 所得到的位串具有最小可能的最大长度。 转换的位串可以被反转,这意味着可以从转换的字符串中恢复原始字符串。
-
-
-