theCEED.com - Research your Interests!!
  • MEMBERSHIP PROFILE
  • bar
  • No member information.
  • login_button
  • sign_up_button
no_image

MIT OpenCourseWare : Advanced Data Structures

About the ceed

Site address : http://web.mit.edu/

* This literary work will be deleted in case the original author requires.
Recommend : 0 I Total List : 22 I 2015-05-28
favorite
7. Memory Hierarchy Models 2015.05.28 18:01:13
Nickname : 81. theceed Recommend : 0 View : 237 btn_recommend.png declaration

Please enter reasons of report.

declaration

 

 

MIT 6.851 Advanced Data Structures, Spring 2012
View the complete course: http://ocw.mit.edu/6-851S12
Instructor: Erik Demaine

Cache-efficient structures. B-trees are good at data transferred in blocks between cache and main memory, main memory and disk, and so on, achieving O(logB N) insert/delete/predecessor/successor for N items and memory block transfers of size B.

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu 

list
Comments

name

write a comment
TOTAL  0 Comments
* No comments. Please write comments