I hope my question is not too vague but I'm looking for more info about checkpointing in Java. I have to generate a big searchtree of which i'd like to be able to resume calculation after the program got interrupted (for example after a sudden reboot etc). Therefore I need checkpointing. I find very few documentation about that and I get the impression a lot of developement has stopped in the mid-90s. So far I've found a library called Padmig, but I hope alternatives are available? Can anyone point me into the right direction with some info about checkpointing for java?
What you describe sounds a lot like object prevalence. In Java there is a library called prevayler that been around since 2002. I haven't used it before, but when it came our there was a lot of fuzz about it and had quite a few interesting concepts.