Range partitioning within sublinear time in the external memory model

DOI10.1007/978-3-030-57602-8_29MaRDI QIDQ2039680zbMATH OpenOpenAlexFDO

Authors Baoling Ning, Jianzhong Li, Shouxu Jiang

Publication date 5 July 2021

Full work available at URL https://doi.org/10.1007/978-3-030-57602-8_29

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects of data analysis and big data (68T09) Analysis of algorithms (68W40)

Recommendations

• Range partitioning within sublinear time: algorithms and lower bounds
• External Sampling
• Sublinear algorithms in the external memory model
• Algorithms and data structures for external memory
• scientific article; zbMATH DE number 1792107

Cites work

• External Sampling
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
• Sampling algorithms: lower bounds and applications
• Tree size reduction with keeping distinguishability

Cited in

(5)

• Maintaining range trees is secondary memory. Part II: Lower bounds
• Range partitioning within sublinear time: algorithms and lower bounds
• Variable sized partitions for range query algorithms
• Sublinear algorithms in the external memory model
• Maximizing Range Sum in External Memory

This page was built for publication: Range partitioning within sublinear time in the external memory model

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