中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

4 records (took 0.009 seconds)

    MAP-REDUCE READY DISTRIBUTED FILE SYSTEM
    1.
    发明申请
    MAP-REDUCE READY DISTRIBUTED FILE SYSTEM 审中-公开
    MAP-REDUCE READY分布式文件系统

    公开(公告)号：WO2011160054A1

    公开(公告)日：2011-12-22

    申请号：PCT/US2011/040936

    申请日：2011-06-17

    Applicant: MAPR TECHNOLOGIES INC.

    Inventor： SRIVAS, Mandayam, C. ,  RAVINDRA, Pindikura ,  SARADHI, Uppaluri, Vijaya ,  PANDE, Arvind, Arun ,  SANAPALA, Chndra Garu, Kiran Babu ,  RENU, Lohit, Vijaya ,  VELLANKI, Vivekanand ,  KAVACHERI, Sathya ,  HADKE, Amit, Ashoke

    IPC: G06F12/00

    CPC classification number: G06F17/30215 ,  G06F8/658 ,  G06F17/30067 ,  G06F17/30174 ,  G06F17/30194 ,  G06F17/30227 ,  G06F17/30312 ,  G06F17/30327 ,  G06F17/30345 ,  G06F17/30365 ,  G06F17/30371 ,  G06F17/30575 ,  G06F17/30581 ,  H04L65/102

    Abstract: A map-reduce compatible distributed file system that consists of successive component layers that each provide the basis on which the next layer is built provides transactional read-write-update semantics with file chunk replication and huge file-create rates. A primitive storage layer (storage pools) knits together raw block stores and provides a storage mechanism for containers and transaction logs. Storage pools are manipulated by individual file servers. Containers provide the fundamental basis for data replication, relocation, and transactional updates. A container location database allows containers to be found among all file servers, as well as defining precedence among replicas of containers to organize transactional updates of container contents. Volumes facilitate control of data placement, creation of snapshots and mirrors, and retention of a variety of control and policy information. Key-value stores relate keys to data for such purposes as directories, container location maps, and offset maps in compressed files.

    Abstract translation: 由连续的组件层组成的map-reduce兼容分布式文件系统，每个组件层提供下一层构建的基础，提供具有文件块复制和巨大的文件创建速率的事务读写更新语义。 原始存储层（存储池）将原始块存储器编织在一起，并为容器和事务日志提供存储机制。 存储池由单独的文件服务器操纵。 容器为数据复制，重定位和事务更新提供了基础。 容器位置数据库允许在所有文件服务器之间找到容器，以及在容器的副本之间定义优先级以组织容器内容的事务性更新。 卷有助于控制数据放置，创建快照和镜像，以及保留各种控制和策略信息。 密钥值存储将密钥与数据相关联，用于压缩文件中的目录，容器位置映射和偏移映射。

    TABLE FORMAT FOR MAP REDUCE SYSTEM
    2.
    发明申请
    TABLE FORMAT FOR MAP REDUCE SYSTEM 审中-公开
    地图缩小系统的表格格式

    公开(公告)号：WO2014047218A2

    公开(公告)日：2014-03-27

    申请号：PCT/US2013/060473

    申请日：2013-09-18

    Applicant: MAPR TECHNOLOGIES, INC. ,  SRIVAS, Mandayam, C. ,  RAVINDRA, Pindikura ,  SARADHI, Uppaluri, Vijaya ,  HADKE, Amit, Ashoke ,  FRANTZ, Jason ,  SANAPALA, Chandra Guru, Kiran Babu

    Inventor： SRIVAS, Mandayam, C. ,  RAVINDRA, Pindikura ,  SARADHI, Uppaluri, Vijaya ,  HADKE, Amit, Ashoke ,  FRANTZ, Jason ,  SANAPALA, Chandra Guru, Kiran Babu

    IPC: G06F17/30

    CPC classification number: G06F17/30138 ,  G06F17/3007 ,  G06F17/30076 ,  G06F17/30091 ,  G06F17/30174 ,  G06F17/30315 ,  G06F17/30339 ,  G06F17/30584

    Abstract: A key-value store provides column-oriented access to data in a distributed and fault tolerant manner. Data can be inserted into the data store and data can be retrieved either randomly or sequentially from the data store at high rates. Keys for a table are ordered and the entire table is divided into key ranges. Each key range is handled by a table which itself is divided into key ranges called a partition. Partitions are also divided into segments. Such recursive division into smaller and smaller key ranges provides parallelism. At the highest level, operations on tablets can be distributed to different nodes. At lower levels, different threads can handle operations on individual segments. Large-scale restructuring operations can be decomposed into operations on individual segments so that a global lock on larger objects does not need to be kept across the entire operation.

    Abstract translation: 键值存储以分布式和容错方式提供对列数据的访问。 数据可以插入到数据存储中，数据可以从数据存储中以高速率随机或顺序检索。 表的键被排序，整个表被分成键范围。 每个密钥范围都由一个表格来处理，该表格本身被划分为称为分区的密钥范围。 分区也被分成多个部分。 这种递归的划分成越来越小的密钥范围提供了并行性。 在最高级别上，平板电脑上的操作可以分配到不同的节点。 在较低的级别，不同的线程可以处理各个细分市场的操作。 大规模的重组操作可以分解为各个部分的操作，从而不需要在整个操作中保持对较大对象的全局锁定。

    TABLE FORMAT FOR MAP REDUCE SYSTEM
    4.
    发明申请
    TABLE FORMAT FOR MAP REDUCE SYSTEM 审中-公开
    地图减少系统的表格

    公开(公告)号：WO2014047218A3

    公开(公告)日：2014-07-31

    申请号：PCT/US2013060473

    申请日：2013-09-18

    Applicant: MAPR TECHNOLOGIES INC ,  SRIVAS MANDAYAM C ,  RAVINDRA PINDIKURA ,  SARADHI UPPALURI VIJAYA ,  HADKE AMIT ASHOKE ,  FRANTZ JASON ,  SANAPALA CHANDRA GURU KIRAN BABU

    Inventor： SRIVAS MANDAYAM C ,  RAVINDRA PINDIKURA ,  SARADHI UPPALURI VIJAYA ,  HADKE AMIT ASHOKE ,  FRANTZ JASON ,  SANAPALA CHANDRA GURU KIRAN BABU

    IPC: G06F17/30 ,  G06F7/00

    CPC classification number: G06F17/30138 ,  G06F17/3007 ,  G06F17/30076 ,  G06F17/30091 ,  G06F17/30174 ,  G06F17/30315 ,  G06F17/30339 ,  G06F17/30584

    Abstract: A key-value store provides column-oriented access to data in a distributed and fault tolerant manner. Data can be inserted into the data store and data can be retrieved either randomly or sequentially from the data store at high rates. Keys for a table are ordered and the entire table is divided into key ranges. Each key range is handled by a table which itself is divided into key ranges called a partition. Partitions are also divided into segments. Such recursive division into smaller and smaller key ranges provides parallelism. At the highest level, operations on tablets can be distributed to different nodes. At lower levels, different threads can handle operations on individual segments. Large-scale restructuring operations can be decomposed into operations on individual segments so that a global lock on larger objects does not need to be kept across the entire operation.

    Abstract translation: 键值存储器以分布式和容错的方式提供对列数据的数据访问。 可以将数据插入到数据存储器中，并且可以以高速率从数据存储器随机地或顺序地检索数据。 表的键被排序，整个表分为关键范围。 每个键范围由一个表分隔，该表自身分为称为分区的关键范围。 分区也分为几段。 这种递归分割成更小和更小的关键范围提供并行性。 在最高级别，平板电脑的操作可以分发到不同的节点。 在较低级别，不同的线程可以处理单个段的操作。 大规模重组操作可以分解为单个段的操作，因此在整个操作中不需要保留对较大对象的全局锁定。

Patent Agency Ranking