Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing

DOI10.1137/110836377zbMath1305.68066arXiv1306.0406OpenAlexW2039208882MaRDI QIDQ2929702

Tsvi Kopelowitz, Noa Lewenstein, Roberto Grossi, Gianni Franceschini, Amihood Amir, Moshe Lewenstein

Publication date: 14 November 2014

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.0406

zbMATH Keywords

stringssearch treessuffix treetext indexingsuffix sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (7)

The property suffix tree with dynamic properties ⋮ Alphabet-Dependent String Searching with Wexponential Search Trees ⋮ Cross-document pattern matching ⋮ Towards a real time algorithm for parameterized longest common prefix computation ⋮ Engineering parallel string sorting ⋮ The Online House Numbering Problem: Min-Max Online List Labeling ⋮ Orthogonal Range Searching for Text Indexing

This page was built for publication: Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing