Foundations of Data Systems - 3. Internals of storage engines

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

This is about how data engines lay out data on disk and different data engines are optimized for different workloads.

In order to efficiently find the value for a particular key from a storage engine, need a different data structure: an index - the general idea behind them is to keep some additional metadata on the side, which acts as a signpost and helps you to locate the data you want.

A range of indexing structures will be reviewed:

1. Log-structured storage
1.1 Hash Indexes: use hash indexes for key-value data
Limitations:
The hash table must fit in memory.
Range queries are not efficient.

1.2 SSTables and LSM-Trees
elminate the limitations with Hash index by sorting the keys
2. B-tree storage

more traditional solutions.

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏2 回帖

关键词：Foundations foundation Internal Engines Systems

Thanks for your sharing

已点赞~

为你点赞！

Thanks for sharing

为您点赞！！！

where is the book download linkage?