Efficient traversals over hierarchical data and indexing semistructured data
    2.
    发明申请
    Efficient traversals over hierarchical data and indexing semistructured data 有权
    对层次化数据进行高效遍历和索引半结构化数据

    公开(公告)号:US20030204515A1

    公开(公告)日:2003-10-30

    申请号:US10379002

    申请日:2003-03-05

    Abstract: A method for encoding hierarchical data stored in an index, partitioned into blocks, over keys representing the data. For every key K representing a record R in the index, the key of the children records of record R are prefixed with K. The method includes traversing to a first R record represented in the index, traversing from the record R to the next sequential R such that the path in the index from the position representing R to the position representing the next sequential R does not include information relating to the children of R. Next, repeating the latter operation for 0 or more R records, and for any 0 or more particular R records, traversing from the particular R to its children. The index constitutes a balanced structure of blocks.

    Abstract translation: 一种用于编码存储在索引中的分层数据的方法,所述索引被划分成块,通过代表数据的键。 对于表示索引中的记录R的每个关键字K,记录R的子记录的密钥以K为前缀。该方法包括遍历索引中表示的第一个R记录,从记录R遍历到下一个顺序R 使得从表示R的位置到表示下一个顺序R的位置的索引中的路径不包括与R的子项有关的信息。接下来,对于0个或更多个R记录重复后一个操作,并且对于任何0个或更多个R记录 特定的R记录,从特定的R遍及其孩子。 该指数构成块的平衡结构。

Patent Agency Ranking