Image de couverture de livre

Dynamic r-index: An Updatable Self-Index in LCP-bounded Time

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Nishimoto, Takaaki, Tabei, Yasuo
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Dynamic Grammar-Compressed Self-Index in $δ$-Optimal Space
par: Nishimoto, Takaaki, et autres
Publié: (2026)

Dynamic Suffix Array in Optimal Compressed Space
par: Nishimoto, Takaaki, et autres
Publié: (2024)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
par: Tabei, Yasuo
Publié: (2025)

FlexFlood: Efficiently Updatable Learned Multi-dimensional Index
par: Hidaka, Fuma, et autres
Publié: (2024)

r*-indexing
par: Gagie, Travis
Publié: (2025)

Computing the LCP Array of a Labeled Graph
par: Alanko, Jarno, et autres
Publié: (2024)

Space-time Trade-offs for the LCP Array of Wheeler DFAs
par: Cotumaccio, Nicola, et autres
Publié: (2023)

Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast
par: Ayad, Lorraine A. K., et autres
Publié: (2023)

Deterministic Retrieval at Scale: Optimal-Space LCP Indexing and 308x Energy Reduction on Modern GPUs
par: Byriukov, Stanislav
Publié: (2026)

RLZ-r and LZ-End-r: Enhancing Move-r
par: Dinklage, Patrick, et autres
Publié: (2025)

Packing $K_r$s in bounded degree graphs
par: McKay, Michael, et autres
Publié: (2022)

Improved Time-Space Tradeoffs for 3SUM-Indexing
par: Dinur, Itai, et autres
Publié: (2025)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time
par: Bille, Philip, et autres
Publié: (2022)

Implementation Of Dynamic De Bruijn Graphs Via Learned Index
par: Nigrelli, Riccardo
Publié: (2024)

Parallel Dynamic Spatial Indexes
par: Men, Ziyang, et autres
Publié: (2026)

Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
par: Kosolobov, Dmitry, et autres
Publié: (2021)

Querying in Constant Expected Time with Learned Indexes
par: Croquevielle, Luis, et autres
Publié: (2024)

Dynamic Treewidth in Logarithmic Time
par: Korhonen, Tuukka
Publié: (2025)

DialSort: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and Substrate-Aware Analysis
par: Narvaez, Alexander
Publié: (2026)

Fast and Small Subsampled R-indexes
par: Cobas, Dustin, et autres
Publié: (2024)

A Dynamic, Self-balancing k-d Tree
par: Brown, Russell A.
Publié: (2025)

A $2$-branching construction for the $χ\leq 2r$ bound
par: Date, Vinicius Tikara Venturi, et autres
Publié: (2026)

String Indexing with Compressed Patterns
par: Bille, Philip, et autres
Publié: (2019)

Dynamic Longest Common Substring in Polylogarithmic Time
par: Charalampopoulos, Panagiotis, et autres
Publié: (2020)

BD-Index: Scalable Biharmonic Distance Queries on Large Graphs via Divide-and-Conquer Indexing
par: Pan, Yueyang, et autres
Publié: (2025)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
par: Bernstein, Aaron, et autres
Publié: (2025)

Fully Dynamic Exact Edge Connectivity in Sublinear Time
par: Goranci, Gramoz, et autres
Publié: (2023)

Better Indexing for Rectangular Pattern Matching
par: Gawrychowski, Paweł, et autres
Publié: (2025)

Compressed Index with Construction in Compressed Space
par: Kosolobov, Dmitry
Publié: (2026)

Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time
par: Meierhans, Simon, et autres
Publié: (2025)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
par: Jin, Wenyu, et autres
Publié: (2024)

Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
par: Buchem, Moritz, et autres
Publié: (2024)

Space-Efficient k-Mismatch Text Indexes
par: Kociumaka, Tomasz, et autres
Publié: (2025)

Indexing Tries within Entropy-Bounded Space
par: Carfagna, Lorenzo, et autres
Publié: (2025)

Text Indexing and Pattern Matching with Ephemeral Edits
par: Pissis, Solon P.
Publié: (2025)

Height-bounded Lempel-Ziv encodings
par: Bannai, Hideo, et autres
Publié: (2024)

Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
par: Duyster, Anouk, et autres
Publié: (2025)

Fully Dynamic Set Cover: Worst-Case Recourse and Update Time
par: Bhattacharya, Sayan, et autres
Publié: (2025)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
par: Goranci, Gramoz, et autres
Publié: (2025)

Longest Common Extension of a Dynamic String in Parallel Constant Time
par: Albert, Daniel
Publié: (2026)