Jan Schneider on :
How is its performance or how does it differ featurewise from using native associative arrays in PHP?
|
Wednesday, September 14. 2005lchash 0.9.1 released
lchash is a little PHP extension that you can find at http://pecl.php.net/package/lchash which provides means of accessing and using native hash tables found in libC. The interface is really simple involving just 4 functions:
lchash_create() - initialize a new hash table lchash_destroy() - destroy a hash table lchash_insert() - insert key/value pair into the hash lchash_find() - retrieve a values based on key By using this mechanism you can create a very fast and effecient memory-based data store for a script's duration. Trackbacks
Trackback specific URI for this entry
Comments
Display comments as
(Linear | Threaded)
Ilia Alshanetsky on :
It is a bit slower slower then array, but about 30-40% more memory effecient.
Harry Fuecks on :
What do you see as use cases for this?
If I've understood the source right, this gives you one global hash table which will live as long as the current PHP request (or until you destroy it) and into which you can throw data with string keys and values (enter serialize if someone what's to put arrays / objects in there). Perhaps this would be good for application config data or perhaps l10n if you're doing it at runtime, when it's being read alot, vs. a global array / object. If you had a massive dictionary of data I guess it would be faster to search than a standard array but as you have to setup the hash in the first place on each request, surely it would be quicker overall to search a file, plus less memory used? Plus it seems you need to tell it how many elements it will be given before you start adding them, so you need to find out how much data you've got. (Not moaning BTW - just wondering) Ilia Alshanetsky on :
I see this tool as a very memory effecient way of storing data for a daemon process, which is where I use it. It is a tiny bit slower then arrays, but uses far less memory. This means I can store A LOT more data without turning to disk.
|
|
|||||||||||||||||||||||||||||||||||||||||||||||||