Skyline groups are ideals. An efficient algorithm for enumerating skyline groups

DOI10.1007/978-3-030-79987-8_16OpenAlexW3177171976MaRDI QIDQ2115858

Tassadit Bouadi, Simon Coumes, Alexandre Termier, Lhouari Nourine

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_16

zbMATH Keywords

skyline queriesideal enumerationtime delay complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Uses Software

• QuickLex

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient generation of the ideals of a poset in Gray code order. II
• Group skyline computation
• An algorithm to generate the ideals of a partial order
• Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.
• Gray Codes for the Ideals of Interval Orders
• Graph-Theoretic Concepts in Computer Science
• Efficient algorithms on distributive lattices

This page was built for publication: Skyline groups are ideals. An efficient algorithm for enumerating skyline groups