会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • EFFICIENT STRING SORTING
    • 有效的STRING SORTING
    • US20080235228A1
    • 2008-09-25
    • US11688886
    • 2007-03-21
    • Carmel Gerda KentDafna Sheinwald
    • Carmel Gerda KentDafna Sheinwald
    • G06F7/08
    • G06F7/24
    • A method for processing data includes reading respective initial substrings of the strings in a group, and computing respective codewords for the initial substrings. The codewords indicate differences between the substrings and point to the strings from which the substrings were respectively read. The codewords are arranged in a heap, which includes a tree of nodes. Each node has no more than two children and has a respective codeword pointing to a string that is in a predetermined ordinal relation, based on the lexicographical ordering, to the strings pointed to by the codewords of the children of the node. A list of one or more of the strings is output in accordance with a lexicographical ordering by selecting one or more of the nodes in the heap and reading the strings that are pointed to by the corresponding codewords.
    • 一种处理数据的方法包括读取组中的字符串的各个初始子串,并计算初始子字符串的相应码字。 码字表示子串之间的差异,并指向分别读取子串的字符串。 码字被排列在堆中,其中包含一个节点树。 每个节点具有不超过两个子节点,并且具有指向基于词典排序的预定顺序关系的字符串的相应代码字与节点的子节点的码字指向的字符串。 通过选择堆中的一个或多个节点并读取由相应码字指向的字符串,根据字典排序输出一个或多个字符串的列表。