|
OpenFT 0.2.1.6:
* Fixed a bug where full parents could trigger an assertion failure.
* Index tokens database by array index instead of by pointer
(should improve space efficiency, especially on 64-bit platforms).
* Clean up the database properly. Not only does this avoid leaving
huge temporary files lying around, but potentially allows the db to be
shutdown and restarted at will.
* Avoid unaligned memory accesses, which cause problems on some
RISC platforms.
* Don't die on malformed URLs.
OpenFT 0.2.1.5:
* Major search database rethink: shares are keyed by host plus a
unique identifier instead of by hash. Hopefully this will improve
space efficiency (and reduce I/O), and also eliminate the (non-)handling
of duplicate hashes that existed previously.
* New tokenization API.
* Removed support for hidden searches due to new improved hashing algorithm.
* New searching functionality: exclusion tokens and quoted queries.
* Moved local shares into search database. This should reduce CPU usage
with a large number of shares.
* Improved documentation about search node configuration.
* Fixed two bugs in stats initialization.
* Added Bloom filter support, which is currently unused but may eventually
be used to optimize query routing.
* Temporarily backed out of cleaning up the database environment on exit,
because it would try to sync the entire database to disk. This will be
fixed properly later when individual children are tracked within
ft_search_db.c.
* Implemented automatic compressed stream handling for unbounded
data (currently search queries and forwarded search results). This
reduces bandwidth usage significantly, sometimes by as much as 50%.
* Increased maximum packet size, although this is currently unused for
compatibility reasons.
OpenFT 0.2.1.4:
* Fixed a signedness bug that could cause problems with non-ASCII characters
on some platforms.
* Fixed a packet handling bug that could cause an infinite loop.
* Minor networking tweaks.
* Fixed clipping of the nodes cache.
|
