Several bugs were found and corrected during the beta testing period, most notably having to do with indexing.
Go directly to the download page.
HyperGraphDB is a general purpose, free open-source data storage mechanism. Geared toward modern applications with complex and evolving domain models, it is suitable for semantic web, artificial intelligence, social networking or regular object-oriented business applications.
This release contains numerous bug fixes and improvements over the previous 1.1 release. A fairly complete list of changes can be found at the Changes for HyperGraphDB, Release 1.2 wiki page.
- Introduction of a new HyperNode interface together with several implementations, including subgraphs and access to remote database peers. The ideas behind are documented in the blog post HyperNodes Are Contexts.
- Introduction of a new interface HGTypeSchema and generalized mappings between arbitrary URIs and HyperGraphDB types.
- Implementation of storage based on the BerkeleyDB Java Edition (many thanks to Alain Picard and Sebastian Graf!). This version of BerkeleyDB doesn't require native libraries, which makes it easier to deploy and, in addition, performs better for smaller datasets (under 2-3 million atoms).
- Implementation of parametarized pre-compiled queries for improved query performance. This is documented in the Variables in HyperGraphDB Queries blog post.
Key Features of HyperGraphDB include:
- Powerful data modeling and knowledge representation.
- Graph-oriented storage.
- N-ary, higher order relationships (edges) between graph nodes.
- Graph traversals and relational-style queries.
- Customizable indexing.
- Customizable storage management.
- Extensible, dynamic DB schema through custom typing.
- Out of the box Java OO database.
- Fully transactional and multi-threaded, MVCC/STM.
- P2P framework for data distribution.
Many thanks to all who supported the project and actively participated in testing and development!