Group skyline computation

DOI10.1016/J.INS.2011.11.014MaRDI QIDQ454943zbMATH OpenOpenAlexFDO

Authors Hyeonseung Im, Sungwoo Park

Publication date 2 October 2012

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2011.11.014

zbMATH Keywords

dynamic algorithmskyline computation

Mathematics Subject Classification ID

Database theory (68P15) General topics in the theory of data (68P01)

Recommendations

• Efficient processing of skyline group queries over a data stream
• Parallel skyline queries
• Skyline Computation with Noisy Comparisons

Cites work

• Optimal aggregation algorithms for middleware.

Cited in

(10)

• Faster output-sensitive skyline computation algorithm
• Parallel skyline queries
• Skyline groups are ideals. An efficient algorithm for enumerating skyline groups
• Efficient computation of G-skyline groups on massive data
• Privacy aware parallel computation of skyline sets queries from distributed databases
• Efficient processing of the skyline-CL query
• Effective approach for an extended P-skyline query
• Efficient processing of skyline-join queries over multiple data sources
• Dominant skyline query processing over multiple time series
• Skycube materialization using the topmost skyline or functional dependencies

This page was built for publication: Group skyline computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454943)