https://wrp-wrp.github.io/Recent content in Home on rprp's blogHugoen-usMon, 16 Feb 2026 13:43:00 +0800https://wrp-wrp.github.io/posts/2025-final/Mon, 16 Feb 2026 13:43:00 +0800https://wrp-wrp.github.io/posts/2025-final/Summary for rp&rsquo;s 2025https://wrp-wrp.github.io/posts/wasmvectoranns/Mon, 22 Dec 2025 15:41:00 +0800https://wrp-wrp.github.io/posts/wasmvectoranns/在端侧 ANNS 的内存约束下，量化索引 + 图搜索 + 小规模精排，走 diskann 路线看起来足够了。https://wrp-wrp.github.io/archive/Tue, 02 Dec 2025 12:00:00 +0800https://wrp-wrp.github.io/archive/<p>All posts grouped by year. Use the <a href="https://wrp-wrp.github.io/tags/">tag cloud</a> to filter by topic.</p>https://wrp-wrp.github.io/chat/Tue, 02 Dec 2025 12:00:00 +0800https://wrp-wrp.github.io/chat/<p>This is a message board.</p>https://wrp-wrp.github.io/resume/Thu, 27 Nov 2025 00:00:00 +0000https://wrp-wrp.github.io/resume/<h1 class="heading" id="wrp-wrp"> wrp-wrp <a class="anchor" href="#wrp-wrp">#</a> </h1> <p><strong>Undergraduate Student, CS (Turing Class) @ HUST</strong><br> <a href="https://github.com/wrp-wrp">GitHub</a> | <a href="mailto:rprp@hust.edu.cn">Email</a></p> <hr> <h2 class="heading" id="education"> Education <a class="anchor" href="#education">#</a> </h2> <p><strong>Huazhong University of Science and Technology (HUST)</strong><br> <em>B.Eng. in Computer Science and Technology (Turing Class)</em><br> <em>Sept. 2023 – Present</em></p> <h2 class="heading" id="research-interests"> Research Interests <a class="anchor" href="#research-interests">#</a> </h2> <p>Vector Search, Cloud Storage, Database Systems.</p> <h2 class="heading" id="research-experience"> Research Experience <a class="anchor" href="#research-experience">#</a> </h2> <p><strong>Research Intern</strong> | <em>Database Group (Prof. Shuhao Zhang), HUST</em><br> <em>Nov. 2024 – Present</em></p> <ul> <li>Investigating <strong>ANNS in streaming scenarios</strong>, including recall degradation caused by data distribution shifts.</li> <li>Contributed to <strong>CandorBench</strong>, a benchmark paper on streaming vector search (5th Author, accepted to <strong>SIGMOD</strong>).</li> <li>Worked on graph-based ANNS optimization to address high update overhead and connectivity issues.</li> <li>Developed high-performance C++ systems for vector stream processing.</li> </ul> <p><strong>Research Intern</strong> | <em>Prof. Yao Wan&rsquo;s Lab, HUST</em><br> <em>Jan. 2024 – Mar. 2024</em></p>https://wrp-wrp.github.io/posts/networkreview/Thu, 20 Nov 2025 12:01:45 +0800https://wrp-wrp.github.io/posts/networkreview/从网络分层到协议与性能指标，整理计算机网络的核心概念、公式和易混淆点。https://wrp-wrp.github.io/about/Wed, 19 Nov 2025 00:00:00 +0800https://wrp-wrp.github.io/about/<h2 class="heading" id="rprp-wrp-wrp"> rprp (wrp-wrp) <a class="anchor" href="#rprp-wrp-wrp">#</a> </h2> <p>Hi, I&rsquo;m an undergraduate student in the <strong>Turing Class</strong> (CS Honors Program) at <strong>Huazhong University of Science and Technology (HUST)</strong>.</p> <p>My current research interests lie in <strong>Vector Search</strong> and <strong>Cloud Storage</strong>. I am a Research Assistant in the Database Group at HUST, working under Prof. Shuhao Zhang.</p> <h3 class="heading" id="research--engineering"> Research &amp; Engineering <a class="anchor" href="#research--engineering">#</a> </h3> <ul> <li><strong>Vector Search</strong>: Investigating ANNS in streaming scenarios, including recall degradation under distribution shifts and graph-based optimization algorithms.</li> <li><strong>Cloud Storage</strong>: Exploring storage systems and data management problems for modern cloud workloads.</li> <li><strong>System Building</strong>: I enjoy building high-performance systems using <strong>C++</strong> (6+ years of experience).</li> <li><strong>Publications</strong>: Contributed to <strong>CandorBench</strong>, a benchmark paper on streaming vector search, accepted to <strong>SIGMOD</strong>.</li> </ul> <h3 class="heading" id="competitive-programming"> Competitive Programming <a class="anchor" href="#competitive-programming">#</a> </h3> <p>I have a strong background in algorithms and competitive programming:</p>