-
dbis
-
Publications
-
2013
-
Parallel Computation of Skyline Queries
VLDB 2012 Reviews
with these algorithms. Furthermore, these algorithms are missing in the related work. 3. In Section 3.1, please discuss how to set the number of working set items in each node. 4. In Figure 1, authors [...] pairs. While checking only a few (e.g., 2) dimensions of p and q, if p0 is smaller than q0 and p1 is larger than q1, one can immediately decide p and q are not dominating each other. On the other [...] me that shifter lists are more generally applicable. In particular, take frequent items (Section 7.1). If the CPU implementation uses a hash table, then the work for each element is only O(1). So why …