Berkeley DB & XML
Berkeley DB
Berkeley DB, the most widely-used embedded data management software in the world, is open source and runs on all major operating systems, including embedded Linux, Linux, MacOS X, QNX, UNIX, VxWorks and Windows.
Berkeley DB delivers the core data management functionality, power, scalability and flexibility of enterprise relational databases but without the overhead of a query processing layer. Combined with the stability and lower support cost of open source code, Berkeley DB offers many advantages, including:
 | Zero administration cost eliminates the need for a DBA; |
 | |
| Smaller footprint (less than 500Kb); |
| |
| Simplicity of integration into an application; |
| |
| More speed and higher performance; |
| |
| Less complexity and more reliability. |
Berkeley DB is distributed under an open source license that permits its use in open source applications at no charge. Proprietary vendors can purchase a proprietary license for Berkeley DB from Sleepycat Software.
Berkeley DB XML
Berkeley DB XML is an application-specific native XML data manager built on Berkeley DB, the world´s most widely deployed data management engine. Berkeley DB XML provides fast, reliable, scalable and cost-effective storage and retrieval for native XML data and semi-structured data.
Berkeley DB XML is supplied as a library that links directly into the application´s address space. This provides superior performance by eliminating bottlenecks that occur in client-server systems.
Berkeley DB XML stores XML documents in collections. A single application may operate on many collections at the same time. A single application may also combine data from different collections easily. Berkeley DB and Berkeley DB XML can seamlessly work together to store XML and non-XML data with full support for transactions and recovery.
Berkeley DB XML enables fast look up by allowing individual collections to be indexed differently. This allows Berkeley DB XML to speed up the common queries over particular collections. Each collection supports multiple indexes. A wide variety of available indexing schemes support different XPath queries efficiently.
Berkeley DB XML´s Query Processor implements XPath 1.0. A cost-based query optimizer considers the indices that exist, the data volume that a query is likely to produce and the cost of computation and disk I/O to select a query plan with the lowest run-time cost.