You may also enjoy
K-D-tree
1 minute read
A k-dimensional or k-d tree is a binary tree used to subdivide a collection of records into ranges for k diļ¬erent attributes in each record.
B-tree
2 minute read
In the 1980s B-trees were applied to database management systems, with an emphasis on how to ensure consistent B-tree access patterns to support concurrency ...
Sorting
1 minute read
Sorting is always an important topic in computer science. Theoretically, comparison sorts cannot perform better than O(n lgn) in the best case, better perfor...
File Management
2 minute read
File Structure