Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
DC-Tree: An Algorithm for Skyline Query on Data Streams
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Extensive facility location problems on networks with equity measures
Discrete Applied Mathematics
The measure of Pareto optima applications to multi-objective metaheuristics
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
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
In-Place algorithms for computing (layers of) maxima
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Exact and approximate algorithms for the most connected vertex problem
ACM Transactions on Database Systems (TODS)
Worst-Case I/O-Efficient Skyline Algorithms
ACM Transactions on Database Systems (TODS)
I/O-efficient planar range skyline and attrition priority queues
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
This paper describes an efficient scheme for the dynamic maintenance of the set of maxima of a 2-d set of points. Using the fact that the maxima can be stored in a staircase structure, we use a technique in which we maintain approximations to the staircase structure. We first describe how to maintain the maxima in O(log n) time per insertion and deletion when there are n insertions and deletions. O(log n) is charged per change for reporting changes to the staircase structure which stores the maxima. O(n) space is used. We also show another scheme which requires a total of O(n log n + r) time when r maximal points are listed. We finally consider extensions to higher dimensions.