Hey,

I'm planning on using execution plans generated by our DBMS as designs
for BDB queries. Does BDB provide any sort of disk-based data
structures to support this?

For example, when Oracle sorts a large result set, a portion of the
sort structure (i.e. list) is on disk and only a subset remains in
memory. Similarly for aggregations performed by GROUP BY constructs.

For large databases I need to be carefull not to consume all available
memory during such operations.

Any suggestions?

Thanks.
-Mitch

Berkeley DB supports fairly standard caching, that is, if the current
working set won't fit into memory, it's paged to the backing physical
files, using LRU-style algorithms.

Berkeley DB also supports setting priorities on specific tables, so
pages from tables are considered more or less valuable as part of
selecting which pages will be paged out of memory.

Regards,
--keith

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Keith Bostic bostic (AT) sleepycat (DOT) com
Sleepycat Software Inc. keithbosticim (Yahoo IM)
118 Tower Rd. +1-781-259-3139
Lincoln, MA 01773 http://www.sleepycat.com