I have a HTML list of about 500 items and a "filter" box above it. I started by using jQuery to filter the list when I typed a letter (timing code added later): $('#filter').keyup( function() { var jqStart = (new Date).getTime(); var search = $(this).val().toLowerCase(); var $list = $('ul.ablist > li'); $list.each( function() { if ( $(this).text().toLowerCase().indexOf(search) === -1 ) $(this).hide(); else $(this).show(); } ); console.log('Time: ' + ((new Date).getTime() - jqStart)); } ); However, there was a couple of seconds delay after typing each letter (particularly the first letter). So I thought it may be slightly quicker if I used plain Javascript (I read recently that jQuery's each function is particularly slow). Here's my JS equivalent: document.getElementById('filter').addEventListener( 'keyup', function () { var jsStart = (new Date).getTime()...
The easiest way is to use the binary keyword in your query use:
ReplyDeleteSELECT /*fields*/ FROM table WHERE /* where clause */ BINARY password = "userpassword"
OR
use the strcmp in your PHP code:
You can use this also if you store hashed or encrypted password which I recommend.
I guess you are storing passwords in clear. That's not only pretty insecure, it's also unnecessary in most situations. My advice is to store passwords in two columns, e.g.:
ReplyDeletepassword_salt VARCHAR(16)
password_hash VARCHAR(40)
Before storing a new password, take the password provided by the user ($clear_password), create a random string ($salt) and use both to create a hash (sha1sum($salt . $clear_password). Store both the salt and the hash and discard the clear password.
To validate a password, retrieve the stored salt for the given user, generate the hash and see if it matches with the hash in DB.
This technique is called salted passwords.