TABLE FORMAT FOR MAP REDUCE SYSTEM

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 int...

Full description

Saved in:
Bibliographic Details
Main Authors SRIVAS Mandayam C, RAVINDRA Pindikura, FRANTZ Jason, SARADHI Uppaluri Vijaya, HADKE Amit Ashoke, SANAPALA Chandra Guru Kiran Babu
Format Patent
LanguageEnglish
Published 09.02.2017
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary: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.
Bibliography:Application Number: US201615298440