ngaut

29 ms·

1. 301.▲
   PGM-index: a fully-dynamic learned index with provable worst-case bounds [pdf](vldb.org)

   2 points by ngaut 6y ago|0 comments
2. 302.▲
   High-Speed Order-Preserving Encoder (Hope)(github.com)

   2 points by ngaut 6y ago|0 comments
3. 303.▲
   Simulating Clock Skew in K8s Without Affecting Other Containers on the Node(pingcap.com)

   6 points by ngaut 7y ago|0 comments
4. 304.▲
   An open source emulator for Cloud Spanner(github.com)

   5 points by ngaut 7y ago|0 comments
5. 305.▲
   A Peek into the Future Database: A Unified Infrastructure to Adapt Intelligently(pingcap.com)

   3 points by ngaut 7y ago|0 comments
6. 306.▲
   Dropbox's Exabyte Storage System (2016) [video](facebook.com)

   1 points by ngaut 7y ago|0 comments
7. 307.▲
   Density: Super Fast Compression Library(github.com)

   2 points by ngaut 7y ago|0 comments
8. 308.▲
   Simdjson 0.3: Faster JSON parser(lemire.me)

   258 points by ngaut 7y ago|63 comments
9. 309.▲
   Reinforcement Learning in Go(github.com)

   3 points by ngaut 7y ago|0 comments
10. 310.▲
    Zone Append: A New Way of Writing to Zoned Storage [pdf](usenix.org)

    1 points by ngaut 7y ago|0 comments
11. 311.▲
    CRaft: An Erasure-Coding-Supported Version of Raft for Reducing Storage Cost(usenix.org)

    3 points by ngaut 7y ago|0 comments
12. 312.▲
    TCP ≈ RDMA: CPU-Efficient Remote Storage Access with I10(github.com)

    2 points by ngaut 7y ago|0 comments
13. 313.▲
    by ngaut 7y ago

    Paper link: https://arxiv.org/abs/2003.10554
14. 314.▲
    Elle: An open source transactional consistency checker for black-box databases(github.com)

    4 points by ngaut 7y ago|1 comments
15. 315.▲
    Quickly Find Rust Program Bottlenecks Online Using a Go Tool(pingcap.com)

    3 points by ngaut 7y ago|0 comments
16. 316.▲
    Analyzing 500B Rows Using Akumuli(akumuli.org)

    1 points by ngaut 7y ago|0 comments
17. 317.▲
    3.5 Musketeers to Reshape Data Lake(medium.com)

    1 points by ngaut 7y ago|0 comments
18. 318.▲
    Run Your First Chaos Experiment in 10 Minutes(pingcap.com)

    4 points by ngaut 7y ago|0 comments
19. 319.▲
    Making Your Code Faster by Taming Branches(infoq.com)

    1 points by ngaut 7y ago|0 comments
20. 320.▲
    Avoiding cache line overlap by replacing a 256-bit store with two 128-bit stores(lemire.me)

    2 points by ngaut 7y ago|0 comments
21. 321.▲
    RecSplit: Minimal Perfect Hashing via Recursive Splitting (2019)(arxiv.org)

    4 points by ngaut 7y ago|0 comments
22. 322.▲
    Improving Database Query Performance WithAutomatic Fusion(dl.acm.org)

    1 points by ngaut 7y ago|0 comments
23. 323.▲
    Loop-Adaptive Execution in Weld [pdf](homepages.cwi.nl)

    1 points by ngaut 7y ago|0 comments
24. 324.▲
    Order-Preserving Key Compression for In-Memory Search Trees(arxiv.org)

    1 points by ngaut 7y ago|0 comments
25. 325.▲
    Halo: Wholly Adaptive LLVM Optimizer(github.com)

    4 points by ngaut 7y ago|0 comments
26. 326.▲
    Memory-Efficient Search Trees for Database Management Systems [pdf](reports-archive.adm.cs.cmu.edu)

    251 points by ngaut 7y ago|59 comments
27. 327.▲
    Fast Float Parsing in Practice(lemire.me)

    1 points by ngaut 7y ago|0 comments
28. 328.▲
    Building an elastic query engine on disaggregated storage(blog.acolyer.org)

    2 points by ngaut 7y ago|0 comments
29. 329.▲
    Morel: A Functional Language for Data(blog.hydromatic.net)

    78 points by ngaut 7y ago|11 comments
30. 330.▲
    Early Impressions of Go from a Rust Programmer(pingcap.com)

    4 points by ngaut 7y ago|0 comments