H Flashcards
(20 cards)
provides other means of processing than the tabular relations used in
relational databases.
NoSQL database
Provides a loose data structure that allows data to be
processed at the petabyte level.
Processing of large-scale data
Saves data relatively freely without a predefined schema
. Use of flexible schemas –
Supports scale-out, data replication, and distributed
storage using multiple servers composed of Pc-level commercial hardware.
Inexpensive cluster configuration
No query language like SQL in existing relational
databases is provided
. Simple CLI (Call Level Interface)
NoSQL loads data by automatically dividing data items into the cluster
environment
High Availability
While the relational DBMS focuses on ensuring
logical structure and ACID, NoSQL makes the application process some of the integrity
works instead of assigning them all to the DBMS
Allow as much integrity is needed
The methods of saving data are largely divided into column, value,
document, and chart, using a function that allows data storage and access using the key
values, without the fixed data schema for data modeling.
Schema-Less
NoSQL has a structure that allows expansion of the system’s scale and
performance and distribution of the I/O load more easily, so that large-scale data can be
created, updated, and queried, while not causing downtime for any clients and
application systems that access the system, even if the system fails partially.
Elasticity
NoSQL provides query language, related processing technology, and API that can
efficiently search and process data according to the characteristics of data even in a
system composed of tens or thousands of servers
Query
NoSQL has a structure in which memory-based caching technology is very
important, and which can provide a high-performance response speed even for largescale queries and be consistently applied to development and operation.
Caching
Partitioning allows a gradual node increase.
High scalability
There is no single point of failure, and data are available even though a
certain node is down because they are replicated.
High availability
The result should be quickly returned based on memory instead of
disk, which can be achieved by using the non-blocking write and low complexity
algorithm.
High performance
Each write operation needs to be atomic.
Atomicity
Strong consistency is not needed, but the resulting consistency is sufficient
(Read-Your-Writes).
Consistency
Data should be kept on a disk, not just in a volatile memory only
Persistence
When a node is added or deleted, data should be automatically loaded
without the need for data distribution or manual mediation, and there should be no
constraints, such as distributed file system or shared storage, or any need for special
hardware. Hardware should be operable in heterogeneous hardware.
Deployment
Data of various types such as key-value pairs, hierarchical data, and
graphs should be modeled conveniently.
Modeling flexibility
Multiple GET that obtains a set of values for the provided key from a
query, and queries that obtain data based on a specific range of keys, are needed.
Query flexibility
