ABSTRACT
In the top-K range reporting problem, the dataset contains N points in the real domain ℜ, each of which is associated with a real-valued score. Given an interval x1,x2 in ℜ and an integer K≤ N, a query returns the K points in x1,x2 having the smallest scores. We want to store the dataset in a structure so that queries can be answered efficiently. In the external memory model, the state of the art is a static structure that consumes O(N/B) space, answers a query in O(logB N + K/B) time, and can be constructed in O(N + (N log N / B) log M/B (N/B)) time, where B is the size of a disk block, and M the size of memory. We present a fully-dynamic structure that retains the same space and query bounds, and can be updated in O(log2B N) amortized time per insertion and deletion. Our structure can be constructed in O((N/B) log M/B (N/B)) time.
- P. Afshani, G. S. Brodal, and N. Zeh. Ordered and unordered top-k range reporting in large data sets. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 390--400, 2011. Google Scholar
Digital Library
- A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM (CACM), 31(9):1116--1127, 1988. Google Scholar
Digital Library
- L. Arge, V. Samoladas, and J. S. Vitter. On two-dimensional indexability and optimal range search indexing. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 346--357, 1999. Google Scholar
Digital Library
- L. Arge and J. S. Vitter. Optimal dynamic interval management in external memory (extended abstract). In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 560--569, 1996. Google Scholar
Digital Library
- G. S. Brodal, R. Fagerberg, M. Greve, and A. Lopez-Ortiz. Online sorted range reporting. In International Symposium on Algorithms and Computation (ISAAC), pages 173--182, 2009. Google Scholar
Digital Library
- G. N. Frederickson. An optimal algorithm for selection in a min-heap. Information and Computation, 104(2):197--214, 1993. Google Scholar
Digital Library
- G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in x y and matrices with sorted columns. Journal of Computer and System Sciences (JCSS), 24(2):197--208, 1982.Google Scholar
- H.-P. Hung, K.-T. Chuang, and M.-S. Chen. Efficient process of top-k range-sum queries over multiple streams with minimized global error. IEEE Transactions on Knowledge and Data Engineering (TKDE), 19(10):1404--1419, 2007. Google Scholar
Digital Library
- Z. W. Luo, T. W. Ling, C.-H. Ang, S. Y. Lee, and B. Cui. Range top/bottom k queries in olap sparse data cubes. In Proceedings of International Conference on Database and Expert Systems Applications (DEXA), pages 678--687, 2001. Google Scholar
Digital Library
- E. M. McCreight. Priority search trees. SIAM Journal of Computing, 14(2):257--276, 1985.Google Scholar
Cross Ref
- J. Yang and J. Widom. Incremental computation and maintenance of temporal aggregates. The VLDB Journal, 12(3):262--283, 2003. Google Scholar
Digital Library
Index Terms
Dynamic top-k range reporting in external memory
Recommendations
External memory range reporting on a grid
ISAAC'07: Proceedings of the 18th international conference on Algorithms and computationIn this paper we present external memory data structures for orthogonal range reporting queries on a grid. Our data structure for twodimensional orthogonal range reporting queries uses O((N/B) log2 N) blocks of space of size B and supports queries in ...
Adaptive and Approximate Orthogonal Range Counting
We present three new results on one of the most basic problems in geometric data structures, 2-D orthogonal range counting. All the results are in the w-bit word RAM model.
—It is well known that there are linear-space data structures for 2-D orthogonal ...
Approximate Range Searching in External Memory
Algorithms and ComputationAbstractIn this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in ℝd and can report all points inside a query range Q by accessing O(logBN + ...






Comments