Long Beach, CA, USA
Mar. 1, 2010 to Mar. 6, 2010
Michael D. Morse , University of Michigan, USA
Jignesh M. Patel , University of Wisconsin-Madison, USA
Martin Ester , Simon Fraser University, Canada
Zengjian Hu , Simon Fraser University, Canada
When a database system is extended with the skyline operator, it is important to determine the most efficient way to execute a skyline query across tables with join operations. This paper describes a framework for evaluating skylines in the presence of equijoins, including: (1) the development of algorithms to answer such queries over large input tables in a non-blocking, pipeline fashion, which significantly speeds up the entire query evaluation time. These algorithms are built on top of the traditional relational Nested-Loop and the Sort-Merge join algorithms, which allows easy implementation of these methods in existing relational systems; (2) a novel method for estimating the skyline selectivity of the joined table; (3) evaluation of skyline computation based on the estimation method and the proposed evaluation techniques; and (4) a systematic experimental evaluation to validate our skyline evaluation framework.
Michael D. Morse, Jignesh M. Patel, Martin Ester, Zengjian Hu, "Evaluating skylines in the presence of equijoins", ICDE, 2010, 2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013 IEEE 29th International Conference on Data Engineering (ICDE) 2010, pp. 249-260, doi:10.1109/ICDE.2010.5447841