The input/output complexity of sorting and related problems
Communications of the ACM
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient topological sorting of planar DAGs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Linear work suffix array construction
Journal of the ACM (JACM)
Fundamental parallel algorithms for private-cache chip multiprocessors
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Space Efficient String Mining under Frequency Constraints
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
| Hi-index | 0.00 |
We study the one-dimensional range minimum query (RMQ) problem in the external memory model. We provide the first space-optimal solution to the batched static version of the problem. On an instance with N elements and Q queries, our solution takes Θ(sort(N+Q)) = Θ($N+Q \over B$ logM /B$N+Q \over B$) I/O complexity and O(N+Q) space, where M is the size of the main memory and B is the block size. This is a factor of O(logM /BN) improvement in space complexity over the previous solutions. We also show that an instance of the batched dynamic RMQ problem with N updates and Q queries can be solved in O ($N+Q \over B$ $\log^{2}_{M /B}$$N+Q \over B$) I/O complexity and O(N+Q) space.