会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明申请
    • MANAGING STORAGE OF INDIVIDUALLY ACCESSIBLE DATA UNITS
    • 管理个人数据库存储
    • US20110196844A1
    • 2011-08-11
    • US12983375
    • 2011-01-03
    • Vrishal KulkarniStephen SchmidtCraig W. StanfillEphraim Meriwether Vishniac
    • Vrishal KulkarniStephen SchmidtCraig W. StanfillEphraim Meriwether Vishniac
    • G06F17/30
    • G06F17/30312G06F17/30321G06F17/30418
    • Managing data includes: receiving at least one group of individually accessible data units over an input device or port, each data unit identified by a key value, with key values of the received data units being sorted such that the key value identifying a given first data unit that is received before a given second data unit occurs earlier in a sort order than the key value identifying the given second data unit; and processing the data units for storage in a data storage system. The processing includes: storing a plurality of blocks of data, each of one or more of the blocks being generated by combining a plurality of the data units; providing an index that includes an entry for each of the blocks, wherein one or more of the entries enable location, based on a provided key value, of a block that includes data units corresponding to a range of key values that includes the provided key value; and generating one or more screening data structures associated with the stored blocks for determining a possibility that a data unit that includes a given key value was included in the group of individually accessible data units.
    • 管理数据包括:通过输入设备或端口接收至少一组单独可访问的数据单元,每个数据单元通过键值标识,所接收的数据单元的键值被排序,使得键值识别给定的第一数据 在给定的第二数据单元之前接收的单元以比识别给定的第二数据单元的键值更高的排序顺序发生; 并处理数据单元以存储在数据存储系统中。 该处理包括:存储多个数据块,通过组合多个数据单元来生成一个或多个块中的每一个块; 提供包括每个块的条目的索引,其中所述条目中的一个或多个使得能够基于提供的密钥值来确定包括与包括所提供的密钥值的密钥值的范围相对应的数据单元的块的位置 ; 以及生成与所存储的块相关联的一个或多个筛选数据结构,以确定包括给定键值的数据单元被包括在可单独访问的数据单元组中的可能性。
    • 8. 发明授权
    • Managing storage of individually accessible data units
    • 管理可单独访问的数据单元的存储
    • US08214331B2
    • 2012-07-03
    • US12983375
    • 2011-01-03
    • Vrishal KulkarniStephen SchmidtCraig W. StanfillEphraim Meriwether Vishniac
    • Vrishal KulkarniStephen SchmidtCraig W. StanfillEphraim Meriwether Vishniac
    • G06F17/30
    • G06F17/30312G06F17/30321G06F17/30418
    • Managing data includes: receiving at least one group of individually accessible data units over an input device or port, each data unit identified by a key value, with key values of the received data units being sorted such that the key value identifying a given first data unit that is received before a given second data unit occurs earlier in a sort order than the key value identifying the given second data unit; and processing the data units for storage in a data storage system. The processing includes: storing a plurality of blocks of data, each of one or more of the blocks being generated by combining a plurality of the data units; providing an index that includes an entry for each of the blocks, wherein one or more of the entries enable location, based on a provided key value, of a block that includes data units corresponding to a range of key values that includes the provided key value; and generating one or more screening data structures associated with the stored blocks for determining a possibility that a data unit that includes a given key value was included in the group of individually accessible data units.
    • 管理数据包括:通过输入设备或端口接收至少一组单独可访问的数据单元,每个数据单元通过键值标识,所接收的数据单元的键值被排序,使得键值识别给定的第一数据 在给定的第二数据单元之前接收的单元以比识别给定的第二数据单元的键值更高的排序顺序发生; 并处理数据单元以存储在数据存储系统中。 该处理包括:存储多个数据块,通过组合多个数据单元来生成一个或多个块中的每一个块; 提供包括每个块的条目的索引,其中所述条目中的一个或多个使得能够基于提供的密钥值来确定包括与包括所提供的密钥值的密钥值的范围相对应的数据单元的块的位置 ; 以及生成与所存储的块相关联的一个或多个筛选数据结构,以确定包括给定键值的数据单元被包括在可单独访问的数据单元组中的可能性。
    • 10. 发明申请
    • MANAGING STORAGE OF INDIVIDUALLY ACCESSIBLE DATA UNITS
    • 管理个人数据库存储
    • US20120271862A1
    • 2012-10-25
    • US13540125
    • 2012-07-02
    • Vrishal KulkarniStephen SchmidtCraig W. StanfillEphraim Meriwether Vishniac
    • Vrishal KulkarniStephen SchmidtCraig W. StanfillEphraim Meriwether Vishniac
    • G06F17/30
    • G06F17/30312G06F17/30321G06F17/30418
    • Managing data by: receiving a group of individually accessible data units, each data unit identified by a key value, with key values determined such that the key value identifying a first data unit received before a second data unit occurs earlier in a sort order than the key value identifying the second data unit; and processing the data units for storage in a data storage system. The processing includes: storing blocks of data, the blocks being generated by combining a plurality of the data units; providing an index with entries that enable location, based on a provided key value, of a block that includes a data unit corresponding to the provided key value; and generating one or more screening data structures associated with the blocks for determining, based on a given key value, whether to search the stored blocks for a data unit corresponding to the given key value.
    • 通过以下操作来管理数据:接收一组单独可访问的数据单元,每个数据单元由键值标识,其中键值被确定为使得该键值识别在第二数据单元之前接收的第一数据单元以比该 识别第二数据单元的键值; 并处理数据单元以存储在数据存储系统中。 该处理包括:存储数据块,通过组合多个数据单元生成块; 向所述索引提供具有条目的条目,所述条目基于所提供的密钥值,所述条目包括与所提供的密钥值对应的数据单元的块; 以及生成与所述块相关联的一个或多个筛选数据结构,用于基于给定的密钥值来确定是否搜索所存储的块以获得对应于给定密钥值的数据单元。