This week's book giveaway is in the OO, Patterns, UML and Refactoring forum. We're giving away four copies of Refactoring for Software Design Smells: Managing Technical Debt and have Girish Suryanarayana, Ganesh Samarthyam & Tushar Sharma on-line! See this thread for details.
Which is the most optimal, performance efficient data structure available in java for concurrent read and writes with and without hashing, such that concurrent reads always return concurrent writes?
The problem with this question is that it sounds very much like a homework assignment, and we're very sensitive about being asked to do other people's homework for them. Maybe you could discuss some of the possible architectures you have in mind, and which one you think would be best.
Tanujasri Bhatkal wrote:Which is the most optimal, performance efficient data structure available in java for concurrent read and writes with and without hashing, such that concurrent reads always return concurrent writes?
I'm afraid your question doesn't have any meaning without some context. The fact is that concurrent reads can't always return concurrent writes because they're concurrent (unless you have some sort of queuing system that prioritises writes over reads, which seems a bizarre thing to do). The best you can hope for is some guarantee of consistency; and that, again, will depend very much on context.
As Greg says, some idea of what you've researched would be helpful.
Isn't it funny how there's always time and money enough to do it WRONG?
Articles by Winston can be found here
I’ve looked at a lot of different solutions, and in my humble opinion Aspose is the way to go. Here’s the link: http://aspose.com
subject: Optimal Data Structure for Concurrent Reads and Writes