Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Can someone explain which indexed search would be faster, listing from fastest, to slowest in a table with 1 million rows.?
index: hexadecimal
index: decimal
index: unicode chars ∓ ∞
Most of this is determined by the length of the key. This means:
So, integer / decimal keys will perform pretty good. Unicode would be the poorest from your examples.
The difference between a hexaDECIMAL and a decimal is nothing: as long as it still fits in 4 bytes. If you exceed that, it will degrade in performance.