Addition B-tree flashcards.
parent
3f1b3ec054
commit
23635c0326
|
@ -720,7 +720,7 @@
|
|||
"_journal/2024-08/2024-08-07.md": "119c052f4109a3e098d825b771af89de",
|
||||
"_journal/2024-08-09.md": "2ce3e0c468f51750d8ad86a19bcc3264",
|
||||
"_journal/2024-08/2024-08-08.md": "b8211a4c576ff594217e2e9cae9396c0",
|
||||
"data-structures/b-tree.md": "229b32beb004364b213d2ef86c69c98f",
|
||||
"data-structures/b-tree.md": "b6085d090b65e457e29d6d36cf4b226a",
|
||||
"data-structures/binary-tree.md": "67b0b5b9688faa205983993fe507079a"
|
||||
},
|
||||
"fields_dict": {
|
||||
|
|
|
@ -170,6 +170,30 @@ Reference: Donald Ervin Knuth, _Art of Computer Programming, 3: Sorting and Sear
|
|||
<!--ID: 1723211542105-->
|
||||
END%%
|
||||
|
||||
%%ANKI
|
||||
Basic
|
||||
Why is a B-tree named the way it is?
|
||||
Back: There is no definitive answer.
|
||||
Reference: Donald Ervin Knuth, _Art of Computer Programming, 3: Sorting and Searching_, 2. ed., 34. (Reading, Mass: Addison-Wesley, 1995).
|
||||
<!--ID: 1723289256280-->
|
||||
END%%
|
||||
|
||||
%%ANKI
|
||||
Basic
|
||||
What was the motivation behind the development of the B-tree?
|
||||
Back: To find a data structure for efficient search that minimizes disk accesses.
|
||||
Reference: Donald Ervin Knuth, _Art of Computer Programming, 3: Sorting and Searching_, 2. ed., 34. (Reading, Mass: Addison-Wesley, 1995).
|
||||
<!--ID: 1723289256283-->
|
||||
END%%
|
||||
|
||||
%%ANKI
|
||||
Basic
|
||||
How is the order of a B-tree typically determined?
|
||||
Back: By choosing a value that best aligns with the size of a memory block.
|
||||
Reference: Donald Ervin Knuth, _Art of Computer Programming, 3: Sorting and Searching_, 2. ed., 34. (Reading, Mass: Addison-Wesley, 1995).
|
||||
<!--ID: 1723289256285-->
|
||||
END%%
|
||||
|
||||
## Bibliography
|
||||
|
||||
* Donald Ervin Knuth, _Art of Computer Programming, 3: Sorting and Searching_, 2. ed., 34. (Reading, Mass: Addison-Wesley, 1995).
|
||||
|
|
Loading…
Reference in New Issue