Maximizing Range Sum in External Memory
From MaRDI portal
Publication:5012499
DOI10.1145/2629477zbMATH Open1474.68088OpenAlexW1991757391MaRDI QIDQ5012499FDOQ5012499
Authors: Dong-Wan Choi, Chin-Wan Chung, Yufei Tao
Publication date: 25 November 2021
Published in: ACM Transactions on Database Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2629477
Recommendations
- Approximate Range Searching in External Memory
- Approximate range searching in external memory
- On (dynamic) range minimum queries in external memory
- On the range maximum-sum segment query problem
- Algorithms and Computation
- Efficient external memory structures for range-aggregate queries
- Range partitioning within sublinear time in the external memory model
- Efficient algorithms for the maximum sum problems
- Efficient algorithms for \(k\) maximum sums
- Algorithms and Computation
Information storage and retrieval of data (68P20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Database theory (68P15)
This page was built for publication: Maximizing Range Sum in External Memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012499)