Efficient Data Structures for the Orthogonal Range Successor Problem

DOI10.1007/978-3-642-02882-3_11zbMath1248.68175OpenAlexW1484947629MaRDI QIDQ5323054

Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_11

zbMATH Keywords

algorithmsdata structuresrange searchingindexes

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (4)

Range selection and predecessor queries in data aware space and time ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Wavelet trees for all ⋮ Geometric BWT: compressed text indexing via sparse suffixes and range searching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orthogonal range searching in linear and almost-linear space
• Rank and select revisited and extended
• Compressed representations of sequences and full-text indexes
• Finding Patterns in Given Intervals
• Range Non-overlapping Indexing and Successive List Indexing
• Using persistent data structures for adding range restrictions to searching problems
• Indexing Circular Patterns

This page was built for publication: Efficient Data Structures for the Orthogonal Range Successor Problem