利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

126 条记录 (耗时 0.02 秒)

    Partitioning within a partition in a disk file storage system
    91.
    发明授权
    Partitioning within a partition in a disk file storage system 失效

    公开(公告)号：US6002866A

    公开(公告)日：1999-12-14

    申请号：US522753

    申请日：1995-09-01

    申请人： Billy J. Fuller

    发明人： Billy J. Fuller

    IPC分类号： G06F12/00 ,  G06F3/06 ,  G06F17/30

    CPC分类号： G06F3/0607 ,  G06F17/30067 ,  G06F3/0643 ,  G06F3/0644 ,  G06F3/0674 ,  Y10S707/968 ,  Y10S707/99956

    摘要： A new file system partition is added to an existing partition in disk storage space by creating a new file in the existing storage space of the existing partition and giving this file the attributes of a partition. This new file having partition attributes is referred to as a "raw file." Apparatus in a computing system for creating and accessing a raw file would comprise a storage system controller for creating a raw file of a predetermined size with the attributes of a partition, a storage space driver for accessing storage space in a data storage system and a storage access control for translating an access request for a raw file to an actual address for the raw file so the storage space driver can access the raw file based on the actual address for the raw file. Computer implemented steps create a first file of a predetermined size in a first disk file system, allocate storage locations in the first disk file system to accommodate the storage space required by the first file, store a first file allocation map indicating storage locations allocated to the first file, and convert the first file to a raw file with a unique identifier as a file partition using the same storage locations allocated to the first file. The raw file is accessed by transforming the access request for a raw file to an actual address for a storage device driver.

    Phrase recognition method and apparatus
    93.
    发明授权
    Phrase recognition method and apparatus 失效
    短语识别方法和装置

    公开(公告)号：US5819260A

    公开(公告)日：1998-10-06

    申请号：US589468

    申请日：1996-01-22

    申请人： Xin Allan Lu ,  David James Miller ,  John Richard Wassum

    发明人： Xin Allan Lu ,  David James Miller ,  John Richard Wassum

    IPC分类号： G06F17/30

    CPC分类号： G06F17/3061 ,  Y10S707/917 ,  Y10S707/968 ,  Y10S707/99931 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935

    摘要： A phrase recognition method breaks streams of text into text "chunks" and selects certain chunks as "phrases" useful for automated full text searching. The phrase recognition method uses a carefully assembled list of partition elements to partition the text into the chunks, and selects phrases from the chunks according to a small number of frequency based definitions. The method can also incorporate additional processes such as categorization of proper names to enhance phrase recognition. The method selects phrases quickly and efficiently, referring simply to the phrases themselves and the frequency with which they are encountered, rather than relying on complex, time-consuming, resource-consuming grammatical analysis, or on collocation schemes of limited applicability, or on heuristical text analysis of limited reliability or utility.

    摘要翻译： 短语识别方法将文本流分解为文本“块”，并选择某些块作为自动全文搜索有用的“短语”。 短语识别方法使用仔细组装的分区元素列表来将文本划分成块，并且根据少量基于频率的定义从块中选择短语。 该方法还可以包括额外的过程，例如分类专有名称以增强短语识别。 该方法可以快速有效地选择短语，仅仅参考短语本身及其遇到的频率，而不是依赖于复杂，耗时，资源消耗的语法分析，或者是适用性有限的搭配方案，或者是有意义的 有限可靠性或效用的文本分析。

    Computer data storage management system and methods of indexing a dataspace and searching a computer memory
    94.
    发明授权
    Computer data storage management system and methods of indexing a dataspace and searching a computer memory 失效
    计算机数据存储管理系统和索引数据空间和搜索计算机存储器的方法

    公开(公告)号：US5701467A

    公开(公告)日：1997-12-23

    申请号：US583072

    申请日：1996-05-20

    申请人： Michael William Freeston

    发明人： Michael William Freeston

    IPC分类号： G06F12/00 ,  G06F17/30

    CPC分类号： G06F17/30327 ,  Y10S707/956 ,  Y10S707/968 ,  Y10S707/99931 ,  Y10S707/99942

    摘要： A computer data storage management system includes a memory employing a hierarchical data structure comprising a plurality of nodes (root, branch and leaf), in particular a multi-dimensional information database. The branch nodes are index nodes and the leaf nodes are data nodes. The index nodes are arranged in an index tree structure. When extra information inserted into the memory results in index node overflow, the index node is split and, in certain specified circumstances, an index entry will become disposed at an index tree level higher than the hierarchical level to which it corresponds, i.e. is promoted. Whilst this makes the index tree unbalanced, it facilitates the addition of information to and the searching of such a database.

    摘要翻译： PCT No.PCT / EP94 / 02166 Sec。 371日期：1996年5月20日 102（e）日期1996年5月20日PCT提交1994年7月1日PCT公布。 第WO95 / 02222号公报 日期1995年1月19日计算机数据存储管理系统包括采用包括多个节点（根，分支和叶）的分层数据结构的存储器，特别是多维信息数据库。 分支节点是索引节点，叶节点是数据节点。 索引节点以索引树结构排列。 当插入存储器中的额外信息导致索引节点溢出时，索引节点被拆分，并且在某些特定情况下，索引条目将被设置在高于其对应的分层级别的索引树级别，即被提升。 尽管这样使得索引树不平衡，它有助于向这种数据库添加信息和搜索。

    User defined data partitioning (UDP)—grouping of data based on computation model
    98.
    发明授权
    User defined data partitioning (UDP)—grouping of data based on computation model 有权
    用户定义的数据分区（UDP） - 基于计算模型的数据分组

    公开(公告)号：US08904381B2

    公开(公告)日：2014-12-02

    申请号：US12358995

    申请日：2009-01-23

    申请人： Qiming Chen ,  Meichun Hsu

    发明人： Qiming Chen ,  Meichun Hsu

    IPC分类号： G06F17/30 ,  G06F9/50

    CPC分类号： G06F17/30339 ,  G06F9/5066 ,  G06F17/30584 ,  Y10S707/968

    摘要： Methods, systems, and computer program products are provided for generating application-aware data partitioning to support parallel computing. A label for a user defined data partitioning (UDP) key is generated by a labeling process to configure data partitions of original data. The UDP is labeled by the labeling process to include at least one key property excluded from the original data. The data partitions are evenly distributed to co-locate and balance the data partitions and corresponding computations performed by computational servers. A data record of the data partitions is retrieved by performing an all-node parallel search of the computational servers using the UDP key.

    摘要翻译： 提供了方法，系统和计算机程序产品，用于生成应用感知数据分区以支持并行计算。 用户定义的数据分区（UDP）密钥的标签由标记过程生成，以配置原始数据的数据分区。 UDP由标记过程标记，以包含从原始数据中排除的至少一个密钥属性。 数据分区均匀分布，以共同定位和平衡数据分区和计算服务器执行的相应计算。 通过使用UDP密钥执行计算服务器的全部节点并行搜索来检索数据分区的数据记录。

    Scalable partitioning in a multilayered data service framework
    99.
    发明授权
    Scalable partitioning in a multilayered data service framework 有权
    在多层数据服务框架中可扩展分区

    公开(公告)号：US08898105B1

    公开(公告)日：2014-11-25

    申请号：US13437860

    申请日：2012-04-02

    申请人： Nicholas K. Peddy ,  Chelsea Krueger ,  Michael J. McCann ,  Suguna Subramaniam ,  W. Cary Hall ,  Sasan Dashtinezhad ,  Guy Bialostocki

    发明人： Nicholas K. Peddy ,  Chelsea Krueger ,  Michael J. McCann ,  Suguna Subramaniam ,  W. Cary Hall ,  Sasan Dashtinezhad ,  Guy Bialostocki

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30041 ,  G06F17/30079 ,  G06F17/30584 ,  Y10S707/968

    摘要： A method and system is provided for maintaining customer data in a data store system utilizing a scalable partitioning framework. More specifically, the data store of a customer service system is partitioned (divided) into multiple partitions by a partitionable key of customer data so that each partition owns a subset of the customer data. By maintaining several partitions that store a subset of the customer data exclusive to each other, blackout or brownout problems can be local to one partition and, thus, the availability for the entire system will be increased. Moreover, a set of partitionable keys, a minimal unit to be moved between partitions, is grouped and associated with a partition. By eliminating direct dependencies between the partitions and the partitionable keys, the system can have great flexibility with regard to migrating customer data between partitions and adding a new partition.

    摘要翻译： 提供了一种方法和系统，用于使用可伸缩的分区框架将客户数据维护在数据存储系统中。 更具体地，客户服务系统的数据存储通过客户数据的可分割密钥被分割（分割）成多个分区，使得每个分区拥有客户数据的子集。 通过维护存储彼此独占的客户数据子集的多个分区，停电或掉电问题可以是一个分区的本地，因此整个系统的可用性将会增加。 此外，一组可分区密钥（在分区之间移动的最小单位）被分组并与分区相关联。 通过消除分区和可分区密钥之间的直接依赖关系，系统可以在分区之间迁移客户数据并添加新分区方面具有很大的灵活性。

    System and method for partitioning and indexing table data using a composite primary key
    100.
    发明授权
    System and method for partitioning and indexing table data using a composite primary key 有权
    使用复合主键分区和索引表数据的系统和方法

    公开(公告)号：US08819027B1

    公开(公告)日：2014-08-26

    申请号：US14064943

    申请日：2013-10-28

    申请人： Amazon Technologies, Inc.

    发明人： Swaminathan Sivasubramanian ,  Stefano Stefani ,  Chiranjeeb Buragohain ,  Rande A. Blackman ,  Timothy Andrew Rath ,  Grant A. M. McAlister ,  Jakub Kulesza ,  Wei Xiao ,  Raymond S. Bradford

    IPC分类号： G06F17/30

    CPC分类号： G06F17/3033 ,  G06F17/30584 ,  G06F17/30628 ,  G06F17/30949 ,  Y10S707/968 ,  Y10S707/972

    摘要： A system that implements a scaleable data storage service may maintain tables in a non-relational data store on behalf of service clients. Each table may include multiple items. Each item may include one or more attributes, each containing a name-value pair. The system may provide an API through which clients can query tables maintained by the service. Items may be partitioned and indexed in a table according to a simple or composite primary key contained in all items in the table. A composite primary key may include a hash key attribute, and a range key attribute. The range key attribute may be usable to order items having the same hash key attribute value, and to partition them dependent on a range of range key attribute values. A query request may specify a logical or mathematical expression dependent on range key attribute values and may be directed to multiple partitions.

    摘要翻译： 实现可扩展数据存储服务的系统可以代表服务客户端在非关系数据存储中维护表。 每个表可以包括多个项目。 每个项目可以包括一个或多个属性，每个属性包含名称 - 值对。 该系统可以提供一种API，通过该API，客户端可以查询由服务维护的表。 项目可以根据表中所有项目中包含的简单或复合主键在表中进行分区和索引。 复合主键可以包括散列键属性和范围键属性。 范围键属性可以用于对具有相同散列键属性值的项进行排序，并且根据范围键属性值的范围对它们进行分区。 查询请求可以指定取决于范围键属性值的逻辑或数学表达式，并且可以被引导到多个分区。