Summary of 2021
#
Recent posts
K-D-tree
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
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
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
File Structure