会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 8. 发明公开
    • A method of querying a data structure
    • Verfahren zur Abfrage einer Datenstruktur
    • EP2618275A1
    • 2013-07-24
    • EP12194308.8
    • 2012-11-26
    • Data-Re Limited
    • Longshaw, Thomas, Benjamin
    • G06F17/30G06F7/24
    • G06F17/30321G06F7/24G06F17/30595
    • There is provided a method of querying a data structure (100), the data structure comprising a plurality of records (T1 - T7) and a plurality of data items (R, G, B, Y, O), each record comprising an index identifying the record and a collection of paths (P1 - P5) pointing to a selection of the data items. Each path of a record corresponds to a respective data variable, the value of the data variable being the data item pointed to by the path. The method comprises receiving (200) a query to sort a sub-set of the records according to a data variable; creating (210) a first array; defining (220) start points in the first array for respective data items of the first data variable according to the order in which the data items are to be sorted; for each record of the sub-set, storing (230) the index of the record after the start point corresponding to the data item of the first data variable of the record; determining (240) an end point for each start point; determining (250) which locations in each sequence of locations within the first array where indexes to the records have been stored based on the start points and the end points; and returning (250) the determined locations to designate where the record indexes corresponding to the respective data items may be found.
    • 提供了一种查询数据结构(100)的方法,所述数据结构包括多个记录(T1-T7)和多个数据项(R,G,B,Y,O),每个记录包括索引 识别记录和指向数据项的选择的路径(P1-P5)的集合。 记录的每个路径对应于相应的数据变量,数据变量的值是路径指向的数据项。 该方法包括:根据数据变量接收(200)查询以对记录的子集进行排序; 创建(210)第一阵列; 根据要对数据项进行排序的顺序,为第一数据变量的各个数据项定义(220)起始点; 对于子集的每个记录,存储(230)与记录的第一数据变量的数据项对应的起始点之后的记录的索引; 确定(240)每个起点的终点; 确定(250)基于起始点和终点,在第一阵列内的每个记录序列中哪些位置已经存储了对记录的索引; 并返回(250)确定的位置,以指定可以找到与各个数据项对应的记录索引的位置。
    • 10. 发明公开
    • Multiple key self-sorting table
    • 自排序表有多个键的
    • EP1482403A3
    • 2007-03-21
    • EP04252867.9
    • 2004-05-17
    • Ericsson AB
    • Hook, Joseph A.Horner, Jeremy William
    • G06F7/24
    • G06F7/24
    • A multiple key self-sorting table. The table includes a plurality of intelligent self-sorting modules. Each module of the plurality of modules having an entry with at least one value. Each module making a decision to perform one of a plurality of acts, and preferably four acts, when there is an addition or deletion of an entry to the table; it holds its current value, stores a new entry, takes an entry from its immediately adjacent module with a higher value or takes an entry from its immediately adjacent module with a lower value; and performing the decision. A method for sorting a table. The method includes the steps of making a decision by each module, having an entry with at least one value, of a plurality of modules intelligent self-sorting modules to perform one of a plurality of acts, and preferably four acts, when there is an addition or deletion of an entry to the table; holding its current value, storing a new entry, taking an entry from its immediately adjacent module with a higher value or taking an entry from its immediately adjacent module with a lower value. There is the step of performing the decision.