Hbase main server components include all except
libase Memstore
In column-oriented stores, data is stored on a basis
Column Family
In Hbase, Columns are named and specified in table definition
Fales
Hßase Tables are divided by row key range into
horizontally - regions
Columnar databases are preferable for OLTP systems.
False
Cassandra allows to define composite Primary Keys.
True - Correct
Pre-join projection is equivalent to as in traditional relational syste
Materialized view
In a column-database a row is being uniquely identified by
Row-key
In Cassandra, the determines how many copies of the data will be ma tamed across multiple nodes
Replication factor
The column store has to perform 10 to insert a new value
as many disk blocks
The row store needs to perform 10 to insert a new value
Single
In a columnar database, the columns are stored together on disk, achieving a higher compression ratio
is an expensive operation.
False
A column-database used to store versions of each cells
Multiple
NoSQL databases are designed to expand
horizontally
Horizontal scaling approach tends to be cheaper as the number of operations and the size of the data
increases.
True
distributes different data across multiple servers
Sharding
Limitations of RDBMS are
Scalability/Database design complexity
Full-form of ‘CRUD’ is
Create-Read-Update-Delete
Key-value pair data storages include all except
Network Attached Storage
Cassandra has properties of both and
Google Bigtable / Amazon Dynamo
A Riak convergent replicated data type (CRDT) includes
Maps/Sets/Counters
A Key-value store does not support Secondary Indexes
FALSO
The RDBMS ‘table’ equivalent terminology in Riak is
bucket
In MongoDB, there is a similar feature of ‘like’ expression as like RDB
False
The MATCH clause is roughly equivalent to the clause in SQL and the RET N clause to a clause.
Where, Select
______ is a syntax for retrieving specific elements from an XML document
Xpath
MongoDß read/write performance can be tuned with the help of Stored Proc dures
False
An RDBMS equivalent component for a “document identifier” in a Document database:
Foreign Key-value
An RDBMS equivalent component for a “document” in a Document database:
Row
Document databases split a document into its constituent name/value pai for indexing purpose
False
An RDBMS equivalent component for a “collection” in a Document database:
Tables
JSON documents are built up of
Both the optio
Only Nodes have properties in Graph database
False
The major components of a Graph include all except
JSON
Cypher query language is associated with
Neo4j
Neo4j architecture is a self-driven and independent architecture because of
Both the options
Graph databases are generally built for use with
OLTP
Hbase Data blocks metadata ïnformatïon are being maintained by
NameNodes
Hbase Region assignment operation is being handled by
Hbase Master
In case of a Strict consistency, a read will always return the most recent data value
VERDADERO
Sorted Column store would provide higher compression ratio by representi ig each column as
compared to the preceding one
Delta
Some of the common Read Consistency level in Cassandra include all except___
ONE ITWOITHREE
Some of the common Write Consistency level in Cassandra include all except___
ONEITNOITHREE -- Wrong
The equivalent Hbase structure of an in-memory tree in Log-structured ME. ‘ge Trees is
Memstor
are replicated to allow failover in MongoDß
Shards
Read overhead in a Columnar database can be partly reduced by Multicolumn projection and____
Caching
In Cassandra, if the replication factor is 3, the coordinator will send ‘eplicas of the data item to the
next nodes on the ring.
2 (n-1)
Wiredtiger storage engine is a part of
MongoDB
Kudu can be accessed via all except
Mapreduce
The equivalent Hbase structure of an on-disk trees in Log-structured Me e Trees is
StoreTable
In case of an Eventual consistency, reads may not return the most recen value, but reads will not
return values “out of sequence.”
Pales
Transactional integrity is relevant in case of batch-centric Hadoop-bas analytics on warehoused data.
False --
Riak demonstrates dual nature of
key/value store and a document database
Cassandra’s Gossip Protocol can take care of the heartbeat lost due to in a widely distributed system.
Both node failure and network issue
The process through which the on-disk tree files periodically merged to create larger consolidated
stores is called
Compaction
In Riak, consistency model is implemented
Eventual
Like most relational databases, Kudu also offers secondary indexes and uniqueness constraints.
False
Hbase DDL Operations (create, delete tables) are maintained by
Hbase Master
Cassandra lightweight transactions (LWT) supports pattern
Compare-and-set
