Ordered and unordered top-K range reporting in large data sets

MaRDI QIDQ5365050zbMATH OpenFDO

Authors Peyman Afshani, Gerth Stølting Brodal, Norbert Zeh

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133067

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Online sorted range reporting
• Lower bounds for sorted geometric queries in the I/O model
• I/O-efficient range minima queries
• Asymptotically optimal encodings of range data structures for selection and top-k queries
• External memory three-sided range reporting and top-\(k\) queries with sublogarithmic updates

Cited in

(9)

• Optimal deterministic shallow cuttings for 3-d dominance ranges
• I/O-efficient data structures for non-overlapping indexing
• Colored top-\(K\) range-aggregate queries
• Indexes for document retrieval with relevance
• Lower bounds for sorted geometric queries in the I/O model
• Indexing for summary queries, theory and practice
• Online sorted range reporting
• Orthogonal point location and rectangle stabbing queries in 3-d
• Permuting and batched geometric lower bounds in the I/O model

This page was built for publication: Ordered and unordered top-\(K\) range reporting in large data sets

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