BerkeleyDB database
October 19, 2005 on 1:38 pm | In Java |If I was building a hypothetical database solution to provide fast sequential access to data, I would choose BerkeleyDB.
Technorati Tags: Java
Related Posts:
- Robust Java Exception Handling
- How to Format Dates for SQL in Java
- MSN toobar Suite Beta
- Boot Camp for Mac OS X on Intel-based Macs
2 Comments »
RSS feed for comments on this post.
Leave a comment
Sponsored Links:
Most Popular
How to Develop JSF Applications in NetBeans
Domain-Driven Design, the quest for software perfection
The ridicule of web applications
How to Improve Download Speeds of BitTorrent
Recent Posts
Delegates versus inner classes
Choosing the Best Tool for the Job
Refactoring by Renaming in Visual Studio .NET 2005
How to Parse Dates from Strings
Feeds:
Archives:
- August 2006
- July 2006
- June 2006
- May 2006
- April 2006
- March 2006
- February 2006
- December 2005
- November 2005
- October 2005
- September 2005
- August 2005
- July 2005
- June 2005
- May 2005
- April 2005
- March 2005
- February 2005
- January 2005
- December 2004
- November 2004
- October 2004
- July 2004
- May 2004
- April 2004
- March 2004
- February 2004
- January 2004
- November 2003
- October 2003
- September 2003
- August 2003
Blogroll
Powered by blog.mu with Pool theme design by Borja Fernandez.
So?
Comment by 0s — 24 December 2005 #
This is a hint for a certain developer who claims his database has outgrown MySQL. The design of his application is such that records are accessed chronologically. MySQL indexing implementation is not the best around (no clustered indexes) and this causes him problems as data access becomes painfully slow. BerkeleyDB is optimised for sequential access to data, which is exactly what is needed for his application.
Comment by Eddy — 24 December 2005 #