Storage Media Independent AVL Library

Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there's just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there's something like that, we won't need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a 'storage-media'independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.

Downloads

Download source - 86 Kb


Comments

  • FOwQPz vi lk zRh UsSo SX

    Posted by LyqyRapiWU on 11/02/2012 03:43am

    tramadol online overnight buy tramadol pay cod - tramadol purchase cheap

    Reply
  • avl tree

    Posted by coolrawat1 on 09/01/2009 11:15am

    differnce between avl tree and complete binary 
    tree

    Reply
  • INTERESTED BUYER

    Posted by Legacy on 12/11/2003 12:00am

    Originally posted by: HELEN JOHN

    Dear sir/ma,
    Good day to you am using this opportunity to introduce my store to you we are glad to inform you that we are interested in some of your products on your site we like to order for these items for our store in Nigeria and we be glad if we can both develop a business ground together as we promise to build a strong business link with a international store like yours please kindly respond to this mail for us to know your intent so as for us to place our first order.

    Sales Rep.

    Reply
  • C++

    Posted by Legacy on 01/09/2003 12:00am

    Originally posted by: ILIA

    Magaria

    Reply
  • Damn Sexy!!!

    Posted by Legacy on 06/26/2001 12:00am

    Originally posted by: Chudaooo Lal Chaurasia

    Sexy....Man ...wat an invention...great simply the best...
    keep it man
    it was really very Sexy code,it helped me a lot!!!!!!!!
    thz a lot....W H Song!!!!!!

    Reply
  • Corrupted data?

    Posted by Legacy on 11/10/2000 12:00am

    Originally posted by: Alex N

    Wu Yuh,
    
    


    I ran the code below, and the last entries seem
    to be corrupted.

    char key[500], value[500];


    for(int i = 1; i<=400; i++)
    {
    sprintf(key, "k%d", i);
    sprintf(value, "val%d", i);
    AddEntry(key, value);
    }

    ListAll();


    Regards,

    Reply
Leave a Comment
  • Your email address will not be published. All fields are required.

Top White Papers and Webcasts

  • Microsoft® Office 365 is a top choice for enterprises that want a cloud-based suite of productivity/ collaboration applications. With Office 365, you get access to Microsoft™ Office solutions practically anytime, anywhere, on virtually any device. It's a great option for current Microsoft users who can now build on their experience with Microsoft™ solutions while enjoying the flexibility of a cloud-based delivery. But even organizations with no previous investment in Microsoft will find that …

  • Live Event Date: July 28, 2016 @ 1:00 p.m. ET / 10:00 a.m. PT Jepsen tests are third-party tests for distributed databases that validate vendors' guarantees about how they perform under various failure scenarios, especially network partitions. These have proven their value as tools in any distributed system tester's arsenal. When the creator of Jepsen, Kyle Kingsbury, started his Jepsen-for-Hire business last fall, VoltDB immediately got in line, and over the past two months, our solution was given the most …

Most Popular Programming Stories

More for Developers

RSS Feeds

Thanks for your registration, follow us on our social networks to keep up-to-date