scientific article; zbMATH DE number 1947378

MaRDI QIDQ4411342zbMATH OpenFDO

Authors

Publication date 8 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610017.htm

Mathematics Subject Classification ID

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

Recommendations

• Efficient range searching for categorical and plain data
• Near-optimal range reporting structures for categorical data
• Significant-presence range queries in categorical data.
• Efficient data structures for range searching on a grid
• Colored Range Searching in Linear Space

Cited in

(10)

• Conditional lower bounds for dynamic geometric measure problems
• Conditional lower bounds for dynamic geometric measure problems
• Efficient range searching for categorical and plain data
• A new framework for addressing temporal range queries and some preliminary results
• Data structures for categorical path counting queries
• Approximate colored range and point enclosure queries
• Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
• Near-optimal range reporting structures for categorical data
• Indexing factors with gaps
• Colored spanning graphs for set visualization

This page was built for publication:

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