ACM Home Page
Please provide us with feedback. Feedback
Angle-based space partitioning for efficient parallel skyline computation
Full text PdfPdf (414 KB)
Source
International Conference on Management of Data archive
Proceedings of the 2008 ACM SIGMOD international conference on Management of data table of contents
Vancouver, Canada
SESSION: Research Session 6: Skylines table of contents
Pages 227-238  
Year of Publication: 2008
ISBN:978-1-60558-102-6
Authors
Akrivi Vlachou  Athens University of Economics and Business, Athens, Greece
Christos Doulkeridis  Athens University of Economics and Business, Athens, Greece
Yannis Kotidis  Athens University of Economics and Business, Athens, Greece
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): 11,   Downloads (12 Months): 199,   Citation Count: 3
Additional Information:

abstract   references   cited by   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/1376616.1376642
What is a DOI?

ABSTRACT

Recently, skyline queries have attracted much attention in the database research community. Space partitioning techniques, such as recursive division of the data space, have been used for skyline query processing in centralized, parallel and distributed settings. Unfortunately, such grid-based partitioning is not suitable in the case of a parallel skyline query, where allpartitions are examined at the same time, since many data partitions do not contribute to the overall skyline set, resulting in a lot of redundant processing.

In this paper we propose a novel angle-based space partitioning scheme using the hyperspherical coordinates of the data points. We demonstrate both formally as well as through an exhaustive set of experiments that this new scheme is very suitable for skyline query processing in a parallel share-nothing architecture. The intuition of our partitioning technique is that the skyline points are equally spread to all partitions. We also show that partitioning the data according to the hyperspherical coordinates manages to increase the average pruning power of points within a partition. Our novel partitioning scheme alleviates most of the problems of traditional grid partitioning techniques, thus managing to reduce the response time and share the computational workload more fairly. As demonstrated by our experimental study, our technique outperforms grid partitioning in all cases, thus becoming an efficient and scalable solution for skyline query processing in parallel environments.


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
W.-T. Balke, U. Güntzer, and J. X. Zheng. Efficient distributed skylining for web information systems. In Proc. of Int. Conf. on Extending Database Technology (EDBT), pages 256--273, 2004.
 
2
 
3
 
4
J. Chomicki, P. Godfrey, J. Gryz, and D. Liang. Skyline with presorting. In Proc. of Int. Conf. on Data Engineering (ICDE), pages 717--719, 2003.
 
5
 
6
Y. Gao, G. Chen, L. Chen, and C. Chen. Parallelizing progressive computation for skyline queries in multi-disk environment. In Proc. Int. Conf. of Database and Expert Systems Applications (DEXA), pages 697--706, 2006.
7
 
8
 
9
 
10
11
 
12
13
14
15
16
 
17
 
18
A. Vlachou, C. Doulkeridis, Y. Kotidis, and M. Vazirgiannis. SKYPEER: Efficient subspace skyline computation over distributed data. In Proc. of Conf. on Data Engineering (ICDE), pages 416--425, 2007.
 
19
S.Wang, B. C. Ooi, A. K. H. Tung, and L. Xu. Efficient skyline query processing on peer-to-peer networks. In Proc. of Int. Conf. on Data Engineering (ICDE), pages 1126--1135, 2007.
 
20
 
21
P. Wu, C. Zhang, Y. Feng, B. Y. Zhao, D. Agrawal, and A. E. Abbadi. Parallelizing skyline queries for scalable distribution. In Proc. of Conf. on Extending Database Technology (EDBT), pages 112--130, 2006.


Collaborative Colleagues:
Akrivi Vlachou: colleagues
Christos Doulkeridis: colleagues
Yannis Kotidis: colleagues