Ok, so I'm working on this project, which requires me to do a search in the memory key store in the table. The business rules that I work with also indicate that this table should be read from memory on each individual node, and the table should be stored in several queries.
So the obvious solution is to use APC with apc_fetch (); and apc_store ();
The problem is that the table will consist of thousands and thousands of key pairs and will be the size of a couple megabytes (the machines on which it will work are a memory behemoth)
So, I have some performance issues if APC serializes the user cache at boot.
If this is not so, then it should not be so large, and then it will be in fact a more optimal solution.
However, if there wasn’t a better alternative to writing a custom extension in C that performed a binary search in a sorted file of structures stored on disk?
Or (hopefully) writes that the user extension is simply not worth it.
Victories, losses, quick thoughts?
Thank you in advance
source share