Efficient Data Structures for the Orthogonal Range Successor Problem

DOI10.1007/978-3-642-02882-3_11MaRDI QIDQ5323054zbMATH OpenOpenAlexFDO

Authors 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 structuresindexesrange searching

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Improved data structures for the orthogonal range successor problem
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Two-dimensional range successor in optimal time and almost linear space
• Compact and succinct data structures for multidimensional orthogonal range searching
• Space Efficient Data Structures for Dynamic Orthogonal Range Counting

Cites work

• Compressed representations of sequences and full-text indexes
• Finding Patterns in Given Intervals
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 1241835 (Why is no real title available?)
• scientific article; zbMATH DE number 2079421 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• scientific article; zbMATH DE number 6146456 (Why is no real title available?)
• Indexing Circular Patterns
• Orthogonal range searching in linear and almost-linear space
• Range Non-overlapping Indexing and Successive List Indexing
• Rank and select revisited and extended
• Using persistent data structures for adding range restrictions to searching problems

Cited in

(12)

• Geometric BWT: compressed text indexing via sparse suffixes and range searching
• Range selection and predecessor queries in data aware space and time
• Wavelet trees for all
• Succinct indices for range queries with applications to orthogonal range maxima
• New algorithms on wavelet trees and applications to information retrieval
• scientific article; zbMATH DE number 6146456 (Why is no real title available?)
• Space Efficient Data Structures for Dynamic Orthogonal Range Counting
• Cache-oblivious data structures for orthogonal range searching
• Algorithms - ESA 2003
• Improved data structures for the orthogonal range successor problem
• Compact and succinct data structures for multidimensional orthogonal range searching
• Two-dimensional range successor in optimal time and almost linear space

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5323054)