Memory table - TTL mechanism ?

[GuillaumeBrook]

Hello there,

I'm not sure to correctly understand memory table.

1. Does memory table are faster than a basic array to put / get data ? I could just create a singleton class with an array as a property and use it as a basic instance cache.

2. Does putting the same data in an array and in a memory table use the same space in RAM ? Or maybe the data are compressed and de-compressed when using the get function ?

3. Is there a TTL of these tables ? For example, if I add a data with a TTL of 3600, the I try to get it in 3601 seconds, I would expect that the memory has been released and the result is null. Does a mechanism like that exists ?

Thank you in advance

[henrywood]

I think you can use this package:

https://github.com/easy-swoole/cache

I have done so successfully.

It is based on Swoole table and has a TTL mechanism