Efficient data structure for searching numbers and strings

Question

I have a scenario where in strings and numbers are combined into a single entity. I need to search based on the string or the number. How do I go about with the data structure for this? I thought of coming up with a hashing for strings and search tree approach for numbers. Can you please comment on my choice and also suggest better structures if any?

Thanks!

Could you elaborate on your "single entity" and give examples? — JoshD
– JoshD, Commented Oct 22, 2010 at 18:53
I think that depends very much of the number of strings and numbers you have. Usually, using the standard std::map or tr1::unordered_map do the trick without creating any ad-hoc structures. — Diego Sevilla
– Diego Sevilla, Commented Oct 22, 2010 at 18:54
by single entity, I mean, they'll be available as objects or as a part of structure. Please note that I can have millions of entries and hence, I need an optimised answer... — 1s2a3n4j5e6e7v
– 1s2a3n4j5e6e7v, Commented Oct 22, 2010 at 18:55

activout.se · Accepted Answer · 2010-10-22 19:03:18Z

1

Use two std::maps, one from std::string to a pointer and the other from number to a pointer. The pointers go to your "single entity". See how far you can scale this (millions of entries...) before trying to optimize further.

answered Oct 22, 2010 at 19:03

activout.se

6,1164 gold badges30 silver badges37 bronze badges

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

Collectives™ on Stack Overflow

Efficient data structure for searching numbers and strings

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related