Parallel skyline queries

Afrati, FN; Koutris, P; Suciu, D; Ullman, JD

dc.contributor.author	Afrati, FN	en
dc.contributor.author	Koutris, P	en
dc.contributor.author	Suciu, D	en
dc.contributor.author	Ullman, JD	en
dc.date.accessioned	2014-03-01T02:53:59Z
dc.date.available	2014-03-01T02:53:59Z
dc.date.issued	2012	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/36514
dc.subject	Database theory	en
dc.subject	Parallel computation	en
dc.subject	Skyline queries	en
dc.subject.other	3-dimension	en
dc.subject.other	Data base theory	en
dc.subject.other	Data sets	en
dc.subject.other	Load-balanced	en
dc.subject.other	Parallel Computation	en
dc.subject.other	Skyline query	en
dc.subject.other	Algorithms	en
dc.subject.other	Computation theory	en
dc.subject.other	Database systems	en
dc.subject.other	Parallel architectures	en
dc.subject.other	Mathematical models	en
dc.title	Parallel skyline queries	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/2274576.2274605	en
heal.identifier.secondary	http://dx.doi.org/10.1145/2274576.2274605	en
heal.publicationDate	2012	en
heal.abstract	In this paper, we design and analyze parallel algorithms for skyline queries. The skyline of a multidimensional set consists of the points for which no other point exists that is at least as good along every dimension. As a framework for parallel computation, we use both the MP model proposed in (Koutris and Suciu, PODS 2011), which requires that the data is perfectly load-balanced, and a variation of the model in (Afrati and Ullman, EDBT 2010), the GMP model, which demands weaker load balancing constraints. In addition to load balancing, we want to minimize the number of blocking steps, where all processors must wait and synchronize. We propose a 2-step algorithm in the MP model for any dimension of the dataset, as well a 1-step algorithm for the case of 2 and 3 dimensions. Moreover, we present a 1-step algorithm in the GMP model for any number of dimensions. Copyright 2012 ACM.	en
heal.journalName	ACM International Conference Proceeding Series	en
dc.identifier.doi	10.1145/2274576.2274605	en
dc.identifier.spage	274	en
dc.identifier.epage	284	en