TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

TurboPFor: Fastest Integer Compression

2 pointsby powturboover 10 years ago

1 comment

powturboover 10 years ago
* Fastest Integer Compression - 100% C, without inline assembly - Fastest "Variable Byte" implementation - Novel "Variable Simple" faster than simple16 and more compact than simple64 - Scalar "Binary Packing" with bulk decoding as fast as SIMD FastPFor in realistic (No "pure cache") scenarios - Binary Packing with Direct/Random Access without decompressing entire blocks - Access any single binary packed entry with zero decompression - Novel "TurboPFor" (Patched Frame-of-Reference) scheme with direct access or bulk decoding - Several times faster than other libraries - Usage as easy as memcpy - Instant access to compressed frequency and position data in inverted index with zero decoding