optimized searching - need desperate help
Hi I have a table with phonenums upto 1 million and I have to search through these to find the name and time is of essense. I have currently stored these as VARCHAR and I get response time as 0.64-0.84 secs with 500,000 phones in the table.
Should I store them as BIGINT or some other datatype and if so how does mysql differentiate between the searches. Isnt there an optimized searching that we can do? like binary search on something like this would be killer fast, I would like response times in .05-.1 sec range.
Hope someone can clear how mysql optimizes searches and how I can store these value to optimize it from my side.
Plus I wanted to add that this searching would be happening very often. Imagine being in a telephone switch and recieving calls every so often.
Also is there a way of telling mysql to keep the data sorted by some field all the time?
Thanks.
Ankur
Edited 1 time(s). Last edit at 07/02/2005 09:17AM by Ankur Saxena.
Subject
Views
Written By
Posted
optimized searching - need desperate help
2639
July 02, 2005 09:14AM
1927
July 02, 2005 01:22PM
2161
July 02, 2005 03:38PM
1656
July 02, 2005 04:03PM
2017
July 02, 2005 04:45PM
2131
July 02, 2005 07:10PM
Sorry, you can't reply to this topic. It has been closed.
Content reproduced on this site is the property of the respective copyright holders.
It is not reviewed in advance by Oracle and does not necessarily represent the opinion
of Oracle or any other party.