知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

7 records (took 0.015 seconds)

    Table format for map reduce system
    2.
    发明授权
    Table format for map reduce system 有权

    公开(公告)号：US09336215B2

    公开(公告)日：2016-05-10

    申请号：US14028427

    申请日：2013-09-16

    Applicant: MapR Technologies, Inc.

    Inventor： Mandayam C. Srivas ,  Pindikura Ravindra ,  Uppaluri Vijaya Saradhi ,  Amit Ashoke Hadke ,  Jason Frantz ,  Chandra Guru Kiran Babu Sanapala

    IPC: G06F17/30

    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.

    Table format for map reduce system
    3.
    发明授权
    Table format for map reduce system 有权

    公开(公告)号：US10289689B2

    公开(公告)日：2019-05-14

    申请号：US15298440

    申请日：2016-10-20

    Applicant: MapR Technologies, Inc.

    Inventor： Mandayam C. Srivas ,  Pindikura Ravindra ,  Uppaluri Vijaya Saradhi ,  Amit Ashoke Hadke ,  Jason Frantz ,  Chandra Guru Kiran Babu Sanapala

    IPC: G06F17/30

    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.

    Map-reduce ready distributed file system
    4.
    发明授权
    Map-reduce ready distributed file system 有权

    公开(公告)号：US10146793B2

    公开(公告)日：2018-12-04

    申请号：US15668666

    申请日：2017-08-03

    Applicant: MapR Technologies, Inc.

    Inventor： Mandayam C. Srivas ,  Pindikura Ravindra ,  Uppaluri Vijaya Saradhi ,  Arvind Arun Pande ,  Chandra Guru Kiran Babu Sanapala ,  Lohit Vijaya Renu ,  Vivekanand Vellanki ,  Sathya Kavacheri ,  Amit Ashoke Hadke

    IPC: G06F17/30

    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. 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. Also addressed is the use of distributed transactions in a map-reduce system; the use of local and distributed snapshots; replication, including techniques for reconciling the divergence of replicated data after a crash; and mirroring.

    Table format for map reduce system
    7.
    发明授权
    Table format for map reduce system 有权
    地图缩小系统的表格格式

    公开(公告)号：US09501483B2

    公开(公告)日：2016-11-22

    申请号：US14028427

    申请日：2013-09-16

    Applicant: MapR Technologies, Inc.

    Inventor： Mandayam C. Srivas ,  Pindikura Ravindra ,  Uppaluri Vijaya Saradhi ,  Amit Ashoke Hadke ,  Jason Frantz ,  Chandra Guru Kiran Babu Sanapala

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

Patent Agency Ranking