ABSTRACT
We study the static and dynamic planar range skyline reporting problem in the external memory model with block size B, under a linear space budget. The problem asks for an O(n/B) space data structure that stores n points in the plane, and supports reporting the k maximal input points (a.k.a.skyline) among the points that lie within a given query rectangle Q = [α1[α2] × [β1β2. When Q is 3-sided, i.e. one of its edges is grounded, two variants arise: top-open for β2 = ∞ and left-open for α1 = - ∞ (symmetrically bottom-open and right-open) queries.
We present optimal static data structures for top-open queries, for the cases where the universe is R2, a U × U grid, and rank space [O(n)]2. We also show that left-open queries are harder, as they require Ω((n/B)ε + k/B) I/Os for ε > 0, when only linear space is allowed. We show that the lower bound is tight, by a structure that supports 4-sided queries in matching complexities. Interestingly, these lower and upper bounds coincide with those of the planar orthogonal range reporting problem, i.e., the skyline requirement does not alter the problem difficulty at all!
Finally, we present the first dynamic linear space data structure that supports top-open queries in O(log2Bε n + k/B1 ε > and updates in O(log2Bε n) worst case I/Os, for ε ∈ [0, 1]. This also yields a linear space data structure for 4-sided queries with optimal query I/Os and O(log(n/B)) amortized update I/Os. We consider of independent interest the main component of our dynamic structures, a new real-time I/O-efficient and catenable variant of the fundamental structure priority queue with attrition by Sundar.
- A. Aggarwal and S. Vitter, Jeffrey. The input/output complexity of sorting and related problems. CACM, 31(9):1116--1127, 1988. Google Scholar
Digital Library
- L. Arge. The buffer tree: A technique for designing batched external data structures. Algorithmica, 37(1):1--24, 2003.Google Scholar
Digital Library
- L. Arge, V. Samoladas, and J. S. Vitter. On two-dimensional indexability and optimal range search indexing. In PODS, pages 346--357, 1999. Google Scholar
Digital Library
- I. Bartolini, P. Ciaccia, and M. Patella. Efficient sort-based skyline evaluation. TODS, 33(4), 2008. Google Scholar
Digital Library
- B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion B-tree. VLDB J., 5(4):264--275, 1996. Google Scholar
Digital Library
- S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, pages 421--430, 2001. Google Scholar
Digital Library
- G. Brodal and K. Tsakalidis. Dynamic planar range maxima queries. In ICALP, pages 256--267, 2011. Google Scholar
Digital Library
- B. Chazelle and D. Liu. Lower bounds for intersection searching and fractional cascading in higher dimension. JCSS, 68(2):269 -- 284, 2004. Google Scholar
Digital Library
- B.-C. Chen, R. Ramakrishnan, and K. LeFevre. Privacy skyline: Privacy with multidimensional adversarial knowledge. In VLDB, pages 770--781, 2007. Google Scholar
Digital Library
- J. Chomicki, P. Godfrey, J. Gryz, and D. Liang. Skyline with presorting: Theory and optimizations. In Intelligent Information Systems, pages 595--604, 2005.Google Scholar
- F. d'Amore, P. G. Franciosa, R. Giaccio, and M. Talamo. Maintaining maxima under boundary updates. In Italian Conference on Algorithms and Complexity, pages 100--109, 1997. Google Scholar
Digital Library
- A. Das, P. Gupta, A. Kalavagattu, J. Agarwal, K. Srinathan, and K. Kothapalli. Range aggregate maximal points in the plane. In WALCOM: Algorithms and Computation, volume 7157, pages 52--63, 2012. Google Scholar
Digital Library
- J. V. den Bercken and B. Seeger. Query processing techniques for multiversion access methods. In VLDB, pages 168--179, 1996. Google Scholar
Digital Library
- J. V. den Bercken, B. Seeger, and P. Widmayer. A generic approach to bulk loading multidimensional index structures. In VLDB, pages 406--415, 1997. Google Scholar
Digital Library
- G. N. Frederickson and S. Rodger. A new approach to the dynamic maintenance of maximal points in a plane. Discrete & Computational Geometry, 5:365--374, 1990.Google Scholar
Digital Library
- M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. JCSS, 47(3):424--436, 1993. Google Scholar
Digital Library
- A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD, pages 47--57, 1984. Google Scholar
Digital Library
- J. M. Hellerstein, E. Koutsoupias, D. P. Miranker, C. H. Papadimitriou, and V. Samoladas. On a model of indexability and its bounds for range queries. JACM, 49(1):35--55, 2002. Google Scholar
Digital Library
- Z. Huang, H. Lu, B. C. Ooi, and A. K. H. Tung. Continuous skyline queries for moving objects. TKDE, 18(12):1645--1658, 2006. Google Scholar
Digital Library
- R. Janardan. On the dynamic maintenance of maximal points in the plane. IPL, 40(2):59 -- 64, 1991.Google Scholar
Cross Ref
- A. K. Kalavagattu, A. S. Das, K. Kothapalli, and K. Srinathan. On finding skyline points for range queries in plane. In CCCG, 2011.Google Scholar
- H. Kaplan and R. E. Tarjan. Purely functional, real-time deques with catenation. JACM, 46(5):577--603, 1999. Google Scholar
Digital Library
- S. Kapoor. Dynamic maintenance of maxima of 2-d point sets. SIAM J. of Comp., 29:1858--1877, 2000. Google Scholar
Digital Library
- D. Kossmann, F. Ramsak, and S. Rost. Shooting stars in the sky: An online algorithm for skyline queries. In VLDB, pages 275--286, 2002. Google Scholar
Digital Library
- K. G. Larsen and R. Pagh. I/O-efficient data structures for colored range and prefix reporting. In SODA, pages 583--592, 2012. Google Scholar
Digital Library
- M. D. Morse, J. M. Patel, and H. V. Jagadish. Efficient skyline computation over low-cardinality domains. In VLDB, pages 267--278, 2007. Google Scholar
Digital Library
- M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. JCSS, 23(2):166 -- 204, 1981.Google Scholar
Cross Ref
- D. Papadias, Y. Tao, G. Fu, and B. Seeger. Progressive skyline computation in database systems. TODS, 30(1):41--82, 2005. Google Scholar
Digital Library
- A. D. Sarma, A. Lall, D. Nanongkai, and J. Xu. Randomized multi-pass streaming skyline algorithms. PVLDB, 2(1):85--96, 2009. Google Scholar
Digital Library
- M. Sharifzadeh, C. Shahabi, and L. Kazemi. Processing spatial skyline queries in both vector spaces and spatial network databases. TODS, 34(3), 2009. Google Scholar
Digital Library
- C. Sheng and Y. Tao. On finding skylines in external memory. In PODS, pages 107--116, 2011. Google Scholar
Digital Library
- R. Sundar. Worst-case data structures for the priority queue with attrition. IPL, 31:69--75, 1989. Google Scholar
Digital Library
- Y. Tao and D. Papadias. Maintaining sliding window skylines on data streams. TKDE, 18(3):377--391, 2006. Google Scholar
Digital Library
- J. S. Vitter. Algorithms and data structures for external memory. Found. Trends Theor. Comput. Sci., 2(4):305--474, 2008. Google Scholar
Digital Library
- P. Wu, D. Agrawal, Ö. Egecioglu, and A. E. Abbadi. Deltasky: Optimal maintenance of skyline deletions without exclusive dominance region generation. In ICDE, pages 486--495, 2007.Google Scholar
Cross Ref
- H. Yuan and M. J. Atallah. Data structures for range minimum queries in multidimensional arrays. In SODA, pages 150--160, 2010. Google Scholar
Digital Library
Index Terms
I/O-efficient planar range skyline and attrition priority queues
Recommendations
Melding priority queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) amortized time, where n is an upper bound on the number of elements in the priority queue, can be converted into a priority queue data ...
A general technique for implementation of efficient priority queues
ISTCS '95: Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)Abstract: This paper presents a very general technique for the implementation of mergeable priority queues. The amortized running time is O(log n) for DELETEMIN and DELETE, and /spl Theta/(1) for all other standard operations. In particular, the ...
On RAM Priority Queues
Priority queues are some of the most fundamental data structures. For example, they are used directly for task scheduling in operating systems. Moreover, they are essential to greedy algorithms. We study the complexity of integer priority queue ...






Comments