Range minimum query indexes in higher dimensions

DOI10.1007/978-3-319-19929-0_13MaRDI QIDQ2942253zbMATH OpenOpenAlexFDO

Authors Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein

Publication date 20 August 2015

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-19929-0_13

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• Data structures for range minimum queries in multidimensional arrays
• On space efficient two dimensional range minimum data structures
• On space efficient two dimensional range minimum data structures
• Two-Dimensional Range Minimum Queries
• Two Dimensional Range Minimum Queries and Fibonacci Lattices

Cites work

• A unifying look at data structures
• Data structures for range minimum queries in multidimensional arrays
• Fast Algorithms for Finding Nearest Common Ancestors
• On Cartesian Trees and Range Minimum Queries
• On space efficient two dimensional range minimum data structures
• Orthogonal Range Reporting in Three and Higher Dimensions
• Range LCP
• Space-efficient preprocessing schemes for range minimum queries on static arrays
• Succinct data structures for flexible text retrieval systems
• THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
• Two Dimensional Range Minimum Queries and Fibonacci Lattices
• Two-Dimensional Range Minimum Queries

Cited in

(7)

• Multidimensional segment trees can do range updates in poly-logarithmic time
• Improved range minimum queries
• Array range queries
• Range extremum queries
• Two dimensional range minimum queries and Fibonacci lattices
• Data structures for range minimum queries in multidimensional arrays
• Reordering columns for smaller indexes

This page was built for publication: Range minimum query indexes in higher dimensions

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