ACM Home Page
Please provide us with feedback. Feedback
Scalable skyline computation using object-based space partitioning
Full text PdfPdf (620 KB)
Source
International Conference on Management of Data archive
Proceedings of the 35th SIGMOD international conference on Management of data table of contents
Providence, Rhode Island, USA
SESSION: Research session 13: skyline query processing table of contents
Pages 483-494  
Year of Publication: 2009
ISBN:978-1-60558-551-2
Authors
Shiming Zhang  University of Hong Kong, Hong Kong, Hong Kong
Nikos Mamoulis  University of Hong Kong, Hong Kong, Hong Kong
David W. Cheung  University of Hong Kong, Hong Kong, Hong Kong
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 42,   Downloads (12 Months): 210,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1559845.1559897
What is a DOI?

ABSTRACT

The skyline operator returns from a set of multi-dimensional objects a subset of superior objects that are not dominated by others. This operation is considered very important in multi-objective analysis of large datasets. Although a large number of skyline methods have been proposed, the majority of them focuses on minimizing the I/O cost. However, in high dimensional spaces, the problem can easily become CPU-bound due to the large number of computations required for comparing objects with current skyline points while scanning the database. Based on this observation, we propose a dynamic indexing technique for skyline points that can be integrated into state-of-the-art sort-based skyline algorithms to boost their computational performance. The new indexing and dominance checking approach is supported by a theoretical analysis, while our experiments show that it scales well with the input size and dimensionality not only because unnecessary dominance checks are avoided but also because it allows efficient dominance checking with the help of bitwise operations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, 2001.
 
4
5
6
 
7
C. Y. Chan, H. V. Jagadish, K. L. Tan, A. K. H. Tung, and Z. Zhang. On high dimensional skylines. In EDBT, 2006.
 
8
9
 
10
J. Chomicki, P. Godfrey, J. Gryz, and D. Liang. Skyline with presorting. In ICDE, 2003.
 
11
 
12
 
13
 
14
 
15
16
 
17
X. Lin, Y. Yuan, Q. Zhang, and Y. Zhang. Selecting stars: The k most representative skyline operator. In ICDE, 2007.
 
18
19
 
20
 
21
22
 
23
 
24
25
 
26
 
27
28
 
29
P. Wu, C. Zhang, Y. Feng, B. Y. Zhao, D. Agrawal, and A. E. Abbadi. Parallelizing skyline queries for scalable distribution. In EDBT, 2006.
 
30
 
31

Collaborative Colleagues:
Shiming Zhang: colleagues
Nikos Mamoulis: colleagues
David W. Cheung: colleagues