- Bạn vui lòng tham khảo Thỏa Thuận Sử Dụng của Thư Viện Số
Tài liệu Thư viện số
Danh mục TaiLieu.VN
Performance of Fractal-Tree Databases
Insertion bottlenecks lie at the heart of database and file-system innovations, best practices, and system workarounds. Most databases and file systems are based on B-tree data structures, and suffer from the performance cliffs and unpredictable run times of B-trees. In this talk, we introduce the Fractal Tree data structure and explain how it works and how it provides dramatically improved performance in both theory and in practice. Although...
52 p dtu 14/10/2012 250 3
Từ khóa: Performance of fractal tree databases, information technology, B-trees are Fast at Sequential Inserts, Algorithmic Performance Model, Fractal Tree Inserts (and Deletes), Inserts into Prototype Fractal Tree, Michael A. Bender