Efficient Skyline Maintenance for Streaming Data with Partially-Ordered Domains
نویسندگان
چکیده
We address the problem of skyline query processing for a count-based window of continuous streaming data that involves both totallyand partially-ordered attribute domains. In this problem, a fixedsize buffer of the N most recent tuples is dynamically maintained and the key challenge is how to efficiently maintain the skyline of the sliding window of N tuples as new tuples arrive and old tuples expire. We identify the limitations of the state-of-the-art approach STARS, and propose two new approaches, STARS and SkyGrid, to address its drawbacks. STARS is an enhancement of STARS with three new optimization techniques, while SkyGrid is a simplification STARS that eliminates a key data structure used in STARS. While both new approaches outperform STARS significantly, the surprising result is that the best approach turns out to be the simplest approach, SkyGrid.
منابع مشابه
Randomized Multi-pass Streaming Skyline Algorithms
We consider external algorithms for skyline computation without pre-processing. Our goal is to develop an algorithm with a good worst case guarantee while performing well on average. Due to the nature of disks, it is desirable that such algorithms access the input as a stream (even if in multiple passes). Using the tools of randomness, proved to be useful in many applications, we present an eff...
متن کاملEfficient Skyline Evaluation over Partially Ordered Domains
Although there has been a considerable body of work on skyline evaluation in multidimensional data with totally ordered attribute domains, there are only a few methods that consider attributes with partially ordered domains. Existing work maps each partially ordered domain to a total order and then adapts algorithms for totallyordered domains to solve the problem. Nevertheless these methods eit...
متن کاملZINC: Efficient Indexing for Skyline Computation
We present a new indexing method named ZINC (for Z-order Indexing with Nested Code) that supports efficient skyline computation for data with both totally and partially ordered attribute domains. The key innovation in ZINC is based on combining the strengths of the ZB-tree, which is the state-of-the-art index method for computing skylines involving totally ordered domains, with a novel, nested ...
متن کاملC-SKY: Caching Skylines for Efficient Skyline Computations with Partially-Ordered Domains
The results of skyline queries performed on data sets with partially-ordered domains vary depending on users’ preference profiles specified for the partially-ordered domains. Existing work has addressed the issue of handling each individual query with some efficiency. However, processing large volumes of such queries for online applications with low response time is still very challenging. In t...
متن کاملA fast and progressive algorithm for skyline queries with totally- and partially-ordered domains
We devise a skyline algorithm that can efficiently mitigate the enormous overhead of processing millions of tuples on totallyand partially-ordered domains (henceforth, TODs and PODs). With massive datasets, existing techniques spend a significant amount of time on a dominance comparison because of both a large number of skyline points and the unprogressive method of skyline computing with PODs....
متن کامل