I know this may have been asked a zillion times before but I cannot seem to find the golden solution for my exact use case.
I only have one data structure, a map where the key is a string. The objects of the map are maps themselves but this time the values are simple objects/primitives such as string, int, double, etc. So a map of maps. The keys of the innermost map is constant, ie no entries are ever added/removed from the innermost map except when created. So it is kind of like a traditional table, albeit each row may have arbitrary columns.
I need this data structure to be persistent and replicated.
Here are my requirements:
The application in question never needs to store anything but the above data structure, ie it will not have a future uncovered need for other persistent data structures. Hence it sounds fair to optimize based on this particular data structure.
I've looked at Berkeley DB Java edition but it fails on requirement #6. I've looked at TokyoCabinet/KoyotoCabinet but it fails on requirement #1.
So what would you recommend?
Have you looked at Redis ? Its an in-memory "database" (key-value store) that, IMHO, meets all your needs.
Have a look at HazelCast
. It meets most of your requirements, except that it's distributed.
I think Chronicle Map is a good match for your case
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.