Algorithm-Engineered Compressed Indexes

• Project/Area Number: 25K21150
• Research Category: Grant-in-Aid for Early-Career Scientists
• Allocation Type: Multi-year Fund
• Review Section: Basic Section 60010:Theory of informatics-related
• Research Institution: University of Yamanashi
• Principal Investigator: Koeppl Dominik 山梨大学, 大学院総合研究部, 特任准教授 (50897395)
• Project Period (FY): 2025-04-01 – 2028-03-31
• Project Status: Granted (Fiscal Year 2025)
• Budget Amount: ¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000); Fiscal Year 2027: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000); Fiscal Year 2026: ¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000); Fiscal Year 2025: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
• Keywords: Matrix Compression / Pattern Matching / Algorithm Engineering / Substring Compression / Generalized Pattern

Outline of Research at the Start

The primary goal of this research is to develop efficient, practical construction methods for compressed data structures, which are often limited to theoretical advancements without adequate real-world applications. While many data structures exist, their practical utility is hampered by inefficiencies in their construction and capabilities (e.g., the types of supported queries). This project will focus on improving the speed and efficiency of constructing these structures, particularly for tasks such as graph traversal, generalized pattern matching, and substring compression.