BigTable is a distributed data storage system designed by Google

BigTable is a distributed data storage system designed by Google to handle a database of data that is not relational. The BigTable database is a sparse, distributed, and persistent storage multidimensional sorted map. BigTable is designed to reliably process PE-level data and can be deployed on thousands of machines. BigTable has achieved the following goals: versatility, scalability, high performance, and high availability. In many ways, BigTable is similar to a database: It uses a number of implementation strategies for the database. Parallel databases and memory databases are already scalable and high-performance, but BigTable provides a completely different excuse for these systems. BigTable does not support a complete relational data model; In contrast, BigTable provides customers with a simple data model that allows customers to dynamically control the distribution and format of data (for BigTable, the data is unformatted, in the terminology of the database field, The data has no schema, the user defines the schema themselves, and the user can speculate on the location dependencies of the underlying stored data. The following table of data is the name of the row and column, and the name can be any string. BigTable will store data as strings, but the bigtable itself does not parse these strings, and client programs often serialize various structured or semi-structured data into these strings. By carefully selecting the pattern of the data, customers can control the location dependencies of the data. Finally, it is possible to control whether the data is stored in memory or on the hard disk through BigTable mode parameters. Features: 1, suitable for large-scale mass data, PB-class data 2, distributed, concurrent data processing, highly efficient 3, easy to expand, support dynamic scaling 4, suitable for low-cost equipment 5, applicable to read operations, not suitable for write operation 6, not applicable to traditional relational database
BigTable is not a relational database, but it uses a lot of relational database terminology, such as table, row, column, and so on. It is easy for readers to go astray, and it is difficult to understand the concept of relational database. Essentially, BigTable is a key value (key-value) mapping. It is a sparse, distributed, persistent, multidimensional sort map. The keys for bigtable are three-dimensional, row keys (row key), column keys (columns key), and timestamp (timestamp). The row and column keys are strings, the timestamp is 64-bit, and the value is a string.   You can use (Row:string,column:string,time:int64)->string to represent a key value record table{//... "AAAAA": {//Line "A:foo": {//One column: "Y",//One version 4: "M"}, "A:bar": {//a column 15: "D",}, "B:": {//A column 6: "W" 3: "O" 1: "W"}},//...}
Essentially, BigTable is a key-value mapping.