000			01702nam a22002537a 4500
003			IIITD
005			20251112153219.0
008			251104b |||||||| |||| 00| 0 eng d
020			_a9798391723394
040			_aIIITD
082			_a005.74 _bSMI-B
100			_aSmith, James
245			_aBuild your own database from scratch : _bpersistence, indexing, concurrency _cby James Smith
260			_aNew York : _bJames Smith, _c©2023
300			_ai, 117 p. ; _c23 cm.
505			_tContents
505			_t00. Introduction Part I. Simple KV Store 01. Files vs Databases 02. Indexing 03. B-Tree: The Ideas 04. B-Tree: The Practice (Part I) 05. B-Tree: The Practice (Part II) 06. Persist to Disk 07. Free List: Reusing Pages
505			_tPart II. Mini Relational DB 08. Rows and Columns 09. Range Query 10. Secondary Index 11. Atomic Transactions 12. Concurrent Readers and Writers 13. Query Language: Parser 14. Query Language: Execution
505			_tPart ii. Mini relational DB
520			_aDatabases are not black boxes. Understand them by coding your own from scratch! A walk-through of a minimal persistent database implementation. The implementation is incremental. We start with a B-Tree, then add a new concept with each chapter, and eventually go from a simple KV to a mini relational DB. Covers three important topics: 1. Persistence. How not to lose or corrupt your data. Recovering from a crash. 2. Indexing. Efficiently querying and manipulating your data. (B-tree). 3. Concurrency. How to handle multiple (large number of) clients. And transactions.
650			_aRelational database
650			_aQuery language
942			_cBK _2ddc
999			_c209362 _d209362