Java: Fastest structure to store and retrieve large number of strings

Question

I need to create a Java structure to store a large number of String. Then I basically need to add new strings and also check if some string is already present... The order of the strings is not important.

I don't know many Java datatypes but the typical List, Set and Map, so... what would be the fastest datatype for this scenario? May it be a TreeSet or is there any other I'm missing?

Hashing is usually quite fast.

Hovercraft Full Of Eels
– Hovercraft Full Of Eels

2013-05-13 00:19:26 +00:00
Commented May 13, 2013 at 0:19 — Hovercraft Full Of Eels
– Hovercraft Full Of Eels, Commented May 13, 2013 at 0:19

Jack · Accepted Answer · 2013-05-13 00:19:45Z

6

It depends on which kind of access you need.

sequential: LinkedList<String>
random: ArrayList<String>
check for presence: HashSet<String> (this is the one you are looking for according to your reqs)
check for presence and sorted traversal: TreeSet<String>

answered May 13, 2013 at 0:19

Jack

134k33 gold badges252 silver badges349 bronze badges

Sign up to request clarification or add additional context in comments.

2 Comments

MikO Over a year ago

Thanks @Jack, in fact, I don't need any kind of sorting, so I think I'll go for HashSet...

Hovercraft Full Of Eels Over a year ago

@MikO: HashSet is good if you have a lot of data. If your amount of data is small, then the cost of calculating the hash function adds some expense, but likely this is what you want.

Collectives™ on Stack Overflow

Java: Fastest structure to store and retrieve large number of strings

1 Answer 1

2 Comments

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

2 Comments

Your Answer

Sign up or log in

Post as a guest

Linked

Related