Latest revision as of 19:57, 3 February 2021

Abstract

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.

Original document

The different versions of the original document can be found in:

• http://www.cs.sfu.ca/~ester/papers/ICDE-2010-MultiRelSkyline.final.pdf

• http://xplorestaging.ieee.org/ielx5/5443872/5447611/05447841.pdf?arnumber=5447841,

http://dx.doi.org/10.1109/icde.2010.5447841

• https://dblp.uni-trier.de/db/conf/icde/icde2010.html#JinMPEH10,

http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005447841,

http://doi.ieeecomputersociety.org/10.1109/ICDE.2010.5447841,

http://www.cs.sfu.ca/~ester/papers/ICDE-2010-MultiRelSkyline.final.pdf?origin=publication_detail,

https://academic.microsoft.com/#/detail/1988823103