Discrete range searching primitive for the GPU and its applications

DOI10.1145/2133803.2345679MaRDI QIDQ5406285zbMATH OpenOpenAlexFDO

Authors Jyothish Soman, Kishore Kothapalli, P. J. Narayanan

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2133803.2345679

zbMATH Keywords

GPGPUrange searchingsuccinct representationtree queries

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Information storage and retrieval of data (68P20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parallel algorithms in computer science (68W10)

Recommendations

• Compact and succinct data structures for multidimensional orthogonal range searching
• Orthogonal range searching in linear and almost-linear space
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Succinct representations of binary trees for range minimum queries
• Fully-functional succinct trees

Cited in

(1)

• GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU

Describes a project that uses

Uses Software

• OpenCL
• CUDA
• GPU Quicksort

This page was built for publication: Discrete range searching primitive for the GPU and its applications

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