Persistent data structures in Java -


i need persistent storage in java (possibly large) data structures, such as:

  • dense , sparse matrices of integers, doubles, booleans
  • directed graphs labeled nodes , edges
  • binary trees
  • maps: string->string, string->integer (with fast retrieval of keys largest values)
  • sets of integers or strings

i don't mind if there separate storage each data structure, long storages have similar, consistent interfaces.

i need able efficiently modify data structures "remotely", is, without fetching entire structure ram, modifying it, , storing back. example operations: put key-value in map, remove node tree, modify node's label in graph, add value set.

it nice if these storages accessed other programming languages, notably python. i'm thinking of restful service in backend , client apis in java , python.

motivation: need process large collection of documents , perform various analyses on them. want explore various approaches , create fast prototypes (for reason need simple, easy-to-use apis).

i guess i'm not first person needing such functionality , hate reinvent wheel here. brings me question: which open-source solutions allow easy-to-use persistence of data structures in java?

thanks in advance!

have thought using mongodb? seem perfect looking , picking lot of steam. it's high-performance, schema-free document-oriented database , love fact it's based on json! check out!

here nice java tutorial.


Comments

Popular posts from this blog

c# - SharpSVN - How to get the previous revision? -

c++ - Is it possible to compile a VST on linux? -

url - Querystring manipulation of email Address in PHP -