A system facilitating low-latency random access capabilities together with high-throughput analytical access capabilities in connection with a request for processing the stored data, the system comprising: a database table distributing data partitioned into a plurality of horizontal tablets, each horizontal tablet in the plurality of horizontal tablets storing the data in a plurality of rows; the database table including a plurality of columns arranged according to a pre-defined schema; a column in the plurality of columns including a primary key column that stores a key uniquely identifying each row in the plurality of rows by mapping each row to exclusively a single tablet in the plurality of tablets, wherein each tablet in the plurality of tablets comprises: a plurality of DiskRowSets for storing the data, each DiskRowSet in the plurality of DiskRowSets including: a base data module existing in disk and storing a subset of rows in the plurality of rows according to a column-organized representation based upon writing each column in the plurality of columns as a single contiguous block, a Bloom filter of the set of keys included in the primary key column for detecting membership of the set of keys in the each DiskRowSet, a delta store module existing in memory and maintaining a mapping for mutating the subset of rows included in the each DiskRowSet, and a single MemRowSet existing in memory and implemented as a concurrent Binary tree (B-tree), the single MemRowSet receiving new data to be inserted into the database table, buffering the new data as a recently-inserted row, and flushing the recently-inserted row to a DiskRowSet in the plurality of DiskRowSets. a database table distributing data partitioned into a plurality of horizontal tablets, each horizontal tablet in the plurality of horizontal tablets storing the data in a plurality of rows; the database table including a plurality of columns arranged according to a pre-defined schema; a column in the plurality of columns including a primary key column that stores a key uniquely identifying each row in the plurality of rows by mapping each row to exclusively a single tablet in the plurality of tablets, wherein each tablet in the plurality of tablets comprises: a plurality of DiskRowSets for storing the data, each DiskRowSet in the plurality of DiskRowSets including: a base data module existing in disk and storing a subset of rows in the plurality of rows according to a column-organized representation based upon writing each column in the plurality of columns as a single contiguous block, a Bloom filter of the set of keys included in the primary key column for detecting membership of the set of keys in the each DiskRowSet, a delta store module existing in memory and maintaining a mapping for mutating the subset of rows included in the each DiskRowSet, and a single MemRowSet existing in memory and implemented as a concurrent Binary tree (B-tree), the single MemRowSet receiving new data to be inserted into the database table, buffering the new data as a recently-inserted row, and flushing the recently-inserted row to a DiskRowSet in the plurality of DiskRowSets. a plurality of DiskRowSets for storing the data, each DiskRowSet in the plurality of DiskRowSets including: a base data module existing in disk and storing a subset of rows in the plurality of rows according to a column-organized representation based upon writing each column in the plurality of columns as a single contiguous block, a Bloom filter of the set of keys included in the primary key column for detecting membership of the set of keys in the each DiskRowSet, a delta store module existing in memory and maintaining a mapping for mutating the subset of rows included in the each DiskRowSet, and a single MemRowSet existing in memory and implemented as a concurrent Binary tree (B-tree), the single MemRowSet receiving new data to be inserted into the database table, buffering the new data as a recently-inserted row, and flushing the recently-inserted row to a DiskRowSet in the plurality of DiskRowSets. a base data module existing in disk and storing a subset of rows in the plurality of rows according to a column-organized representation based upon writing each column in the plurality of columns as a single contiguous block, a Bloom filter of the set of keys included in the primary key column for detecting membership of the set of keys in the each DiskRowSet, a delta store module existing in memory and maintaining a mapping for mutating the subset of rows included in the each DiskRowSet, and a single MemRowSet existing in memory and implemented as a concurrent Binary tree (B-tree), the single MemRowSet receiving new data to be inserted into the database table, buffering the new data as a recently-inserted row, and flushing the recently-inserted row to a DiskRowSet in the plurality of DiskRowSets.