The input/output complexity of sorting and related problems
Communications of the ACM
Worst-case data structures for the priority queue with attrition
Information Processing Letters
A new approach to the dynamic maintenance of maximal points in a plane
Discrete & Computational Geometry
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
Dynamic Maintenance of Maxima of 2-d Point Sets
SIAM Journal on Computing
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Proceedings of the 17th International Conference on Data Engineering
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Query Processing Techniques for Multiversion Access Methods
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Maintaining Maxima under Boundary Updates
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Lower bounds for intersection searching and fractional cascading in higher dimension
Journal of Computer and System Sciences - STOC 2001
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Maintaining Sliding Window Skylines on Data Streams
IEEE Transactions on Knowledge and Data Engineering
Continuous Skyline Queries for Moving Objects
IEEE Transactions on Knowledge and Data Engineering
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient skyline computation over low-cardinality domains
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Privacy skyline: privacy with multidimensional adversarial knowledge
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Efficient sort-based skyline evaluation
ACM Transactions on Database Systems (TODS)
Processing spatial skyline queries in both vector spaces and spatial network databases
ACM Transactions on Database Systems (TODS)
Randomized multi-pass streaming skyline algorithms
Proceedings of the VLDB Endowment
Data structures for range minimum queries in multidimensional arrays
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On finding skylines in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dynamic planar range maxima queries
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
I/O-efficient data structures for colored range and prefix reporting
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Range aggregate maximal points in the plane
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Hi-index | 0.00 |
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.