Hi PECL community,
I'm Yorick de Wid, a student from The Hague University, kernel hacker, OpenBSD enthusiast and PHP fan from The Netherlands. I'm doing research on datastorage and datastructures, specifically binary (memory) trees. For a recent project I needed to process large amount of data in a sort amount of time, and however the PHP implementation worked I decided to go with an extension for better performance instead. The Atree extension allows PHP developers to quickly store data in memory regardless of their datatype or size. Atree is an in-memory search tree based on a radix tree but avoids the wasted space of internal nodes. The Atree extension implements the ART algorithm as described in this paper: http://www-db.in.tum.de/~leis/papers/ART.pdf The source code for the PHP extension can be found here (as well as an PHP example and some tests): https://github.com/yorickdewid/php-atree As far as I know the extension conforms the PECL standards and code style. There is no license yet, but the extension will be available under the New BSD-3 clause if that is no problem. Documentation will be directly available as soon as the extension is released as stable. Thanks in advance, Yorick
