Approximate colored range and point enclosure queries

DOI10.1016/j.jda.2007.10.001zbMath1160.68352OpenAlexW2051856167MaRDI QIDQ1018093

Benyun Shi, Ying Kit Lai, Chung Keung Poon

Publication date: 13 May 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2007.10.001

zbMATH Keywords

sketchesapproximate data structurescolored point enclosure queriescolored range queries

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Approximation algorithms (68W25)

Related Items

Dynamic range majority data structures, Colored range queries and document retrieval, Counting Colours in Compressed Strings, Range majorities and minorities in arrays, Array Range Queries, Data structures for categorical path counting queries

Cites Work

• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• Universal classes of hash functions
• Two-dimensional substring indexing.
• Symmetric binary B-trees: Data structure and maintenance algorithms
• A new approach to rectangle intersections part I
• New Data Structures for Orthogonal Range Queries
• Adding range restriction capability to dynamic data structures
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• Algorithms and Computation
• Algorithms and Data Structures
• LATIN 2004: Theoretical Informatics