PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Spyratos N., Sugibuchi T., Simonenko E., Meghini C. Computing the skyline of a relational table based on a query lattice. In: ICFCA2012 - Formal Concept Analysis 2012. Contributions to the 10th International Conference on Formal Concept Analysis (Leuwen, Belgio, 6 - 10 May 2012). Proceedings, pp. 145 - 160. Florent Domenach, Dmitry I. Ignatov, Jonas Poelmans (eds.). (CEUR Workshop Proceedings, vol. 876). UniversitÓ di Leuwen - CEUR, 2012.
 
 
Abstract
(English)
We propose a novel approach to computing the skyline set of a relational table R, with respect to preferences expressed over one or more numerical attributes. Our approach is based on what we call the query lattice of R, and our basic algorithm constructs the skyline set as the union of the answers to a subset of queries from that lattice - hence without directly accessing the table R. Therefore, in contrast to all existing techniques, our approach is independent of how the table R is implemented or how its tuples are indexed. We demonstrate the general- ity of our approach by computing the skyline set of the join of two tables based on the product of their individual query lattices - therefore without performing the join. The paper presents basic concepts and algorithms leaving experimentation and performance evaluation to a forthcoming paper.
URL: http://ceur-ws.org/Vol-876/paper11.pdf
Subject Formal Concept Analysis
Skyline
H.2.4 Information systems. Systems


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional