Hyper table
Click here to load reader
-
Upload
jignesh-parmar -
Category
Education
-
view
63 -
download
0
Transcript of Hyper table
![Page 1: Hyper table](https://reader038.fdocuments.net/reader038/viewer/2022100803/58ef51ec1a28abdd7a8b463d/html5/thumbnails/1.jpg)
Hypertable
Presented By:-kaushik v. Bhut
Jignesh M. Parmar
![Page 2: Hyper table](https://reader038.fdocuments.net/reader038/viewer/2022100803/58ef51ec1a28abdd7a8b463d/html5/thumbnails/2.jpg)
OverView
● Hypertable is a high performance, open source, massively scalable database modeled after Bigtable, Google's proprietary, massively scalable database.
==>Comparison to a Relational Database● Hypertable is similar to a relational database in that it
represents data as tables of information, with rows and columns, but that's about as far as the analogy goes. The following is a list of some of the main differences
![Page 3: Hyper table](https://reader038.fdocuments.net/reader038/viewer/2022100803/58ef51ec1a28abdd7a8b463d/html5/thumbnails/3.jpg)
cont....
● Row keys are UTF-8 strings● No support for data types, values are treated as
opaque byte sequences● No support for joins● No support for transactions
![Page 4: Hyper table](https://reader038.fdocuments.net/reader038/viewer/2022100803/58ef51ec1a28abdd7a8b463d/html5/thumbnails/4.jpg)
Physical Layout
● A relational database assumes that each column defined in the table schema will have a value for each row that is present in the table.
● NULL values are usually represented with a special marker (e.g. \N).
● The primary key and column identifier are implicitly associated with each cell based on its physical position within the layout.
![Page 5: Hyper table](https://reader038.fdocuments.net/reader038/viewer/2022100803/58ef51ec1a28abdd7a8b463d/html5/thumbnails/5.jpg)
Cont...
● The following diagram illustrates how a relational database table might be laid out on disk.
![Page 6: Hyper table](https://reader038.fdocuments.net/reader038/viewer/2022100803/58ef51ec1a28abdd7a8b463d/html5/thumbnails/6.jpg)
Cont...
● Hypertable (and Bigtable) takes its design from the Log Structured Merge Tree.
● It flattens out the table structure into a sorted list of key/value pairs, each one representing a cell in the table.
● The key includes the full row and column identifier, which means each cell is provided complete addressing information.
● Cells that are NULL are simply not included in the list which makes this design particularly well-suited for sparse data.
![Page 7: Hyper table](https://reader038.fdocuments.net/reader038/viewer/2022100803/58ef51ec1a28abdd7a8b463d/html5/thumbnails/7.jpg)
Cont...
● The following diagram illustrates how Hypertable stores table data on-disk.
![Page 8: Hyper table](https://reader038.fdocuments.net/reader038/viewer/2022100803/58ef51ec1a28abdd7a8b463d/html5/thumbnails/8.jpg)