« Unsorted Retrieval in JE (Repost from 11/10/05 Sleepycat blog) | Main | JE and Jave 5 Locks (Repost from 10/25/05on Sleepycat blog) »

Database.preload() Improvements in JE 2.1 (Repost from 12/14/05 on Sleepycat blog)

[The following is a repost of the 12/14/05 Sleepycat blog entry.]

In Unsorted Retrieval in JE I mentioned that JE 2.1 would use a new Sorted LSN Tree Walker technology to improve performance for Database.truncate() and Database.remove(). I also suggested that JE might also eventually use this for improving Database.preload()
performance. The changes that make preload use this technique were just
checked in so it will in fact be released in JE 2.1. The performance
improvement for a cold-cache preload (i.e. cold OS file system cache)
is on the order of about 50% for a database that was created in random
order (YMMV). Database.preload() will also allow optionally loading LN's (the data portion of the B+Tree). Finally, Database.preload()
will return stats about the number and type of nodes that were loaded
as well as whether the operation completed successfully or was
terminated due to filling the cache or exceeding the user-designated
time limit.

Post a comment

(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)

About This Entry

This page contains a single entry from the blog posted on September 22, 2006 1:44 PM.

The previous post in this blog was Unsorted Retrieval in JE (Repost from 11/10/05 Sleepycat blog).

The next post in this blog is JE and Jave 5 Locks (Repost from 10/25/05on Sleepycat blog).

Many more can be found on the main index page or by looking through the archives.

Top Tags

Powered by
Movable Type and Oracle