{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:35:01Z","timestamp":1743064501020,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_16","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"223-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups"],"prefix":"10.1007","author":[{"given":"Simon","family":"Coumes","sequence":"first","affiliation":[]},{"given":"Tassadit","family":"Bouadi","sequence":"additional","affiliation":[]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Termier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Abdo, M.: Efficient generation of the ideals of a poset in gray code order, part ii. Theor. Comput. Sci. 502, 30\u201345 (2013), generation of Combinatorial Structures","DOI":"10.1016\/j.tcs.2012.02.008"},{"key":"16_CR2","unstructured":"Chang, Y., Garg, V.K.: Quicklex: a fast algorithm for consistent global states enumeration of distributed computations. In: Anceaume, E., Cachin, C., Potop-Butucaru, M.G. (eds.) 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14\u201317, 2015, Rennes, France. LIPIcs, vol. 46, pp. 25:1\u201325:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2536669.2536671","volume":"42","author":"J Chomicki","year":"2013","unstructured":"Chomicki, J., Ciaccia, P., Meneghetti, N.: Skyline queries, front and back. ACM SIGMOD Rec. 42(3), 6\u201318 (2013)","journal-title":"ACM SIGMOD Rec."},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0166-218X(00)00258-4","volume":"110","author":"M Habib","year":"2001","unstructured":"Habib, M., Medina, R., Nourine, L., Steiner, G.: Efficient algorithms on distributive lattices. Discrete Appl. Math. 110(2), 169\u2013187 (2001)","journal-title":"Discrete Appl. Math."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1006\/jagm.1997.0863","volume":"25","author":"M Habib","year":"1997","unstructured":"Habib, M., Nourine, L., Steiner, G.: Gray codes for the ideals of interval orders. J. Algorithms 25, 52\u201366 (1997)","journal-title":"J. Algorithms"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.ins.2011.11.014","volume":"188","author":"H Im","year":"2012","unstructured":"Im, H., Park, S.: Group skyline computation. Inf. Sci. 188, 151\u2013169 (2012)","journal-title":"Inf. Sci."},{"issue":"3","key":"16_CR7","first-page":"521","volume":"31","author":"Z Yang","year":"2018","unstructured":"Yang, Z., Xiao, G., Li, K., Li, K., et al.: Progressive approaches for pareto optimal groups computation. IEEE Trans. Knowl. Data Eng. 31(3), 521\u2013534 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"13","key":"16_CR8","doi-asserted-by":"publisher","first-page":"2086","DOI":"10.14778\/2831360.2831363","volume":"8","author":"J Liu","year":"2015","unstructured":"Liu, J., Xiong, L., Pei, J., Luo, J., Zhang, H.: Finding pareto optimal groups: group-based skyline. Proc. VLDB Endowment 8(13), 2086\u20132097 (2015)","journal-title":"Proc. VLDB Endowment"},{"key":"16_CR9","unstructured":"Liu, J., Xiong, L., Pei, J., Luo, J., Zhang, H., Yu, W.: Group-based skyline for pareto optimal groups. IEEE Trans. Knowl. Data Eng. (2019)"},{"key":"16_CR10","unstructured":"Medina, R., Nourine, L.: Algorithme efficace de g\u00e9n\u00e9ration des ideaux d\u2019un ensemble ordonn\u00e9. C.R. Acad. Sci. Paris S\u00e9r. I Math. 319, 1115\u20131120 (1994)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-30559-0_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Nakano","year":"2004","unstructured":"Nakano, S., Uno, T.: Constant time generation of trees with specified diameter. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 33\u201345. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30559-0_3"},{"key":"16_CR12","unstructured":"Squire, M.: Enumerating the ideals of a poset. Preprint available electronically at (1995). http:\/\/citeseer.ist.psu.edu\/465417.html"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0167-6377(86)90071-4","volume":"5","author":"G Steiner","year":"1986","unstructured":"Steiner, G.: An algorithm for generating the ideals of a partial order. Oper. Res. Lett. 5, 317\u2013320 (1986)","journal-title":"Oper. Res. Lett."},{"key":"16_CR14","unstructured":"Uno, T.: Two general methods to reduce delay and change of enumeration algorithms. NII Technical report (2003)"},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1109\/TKDE.2017.2777994","volume":"30","author":"C Wang","year":"2017","unstructured":"Wang, C., Wang, C., Guo, G., Ye, X., Philip, S.Y.: Efficient computation of g-skyline groups. IEEE Trans. Knowl. Data Eng. 30(4), 674\u2013688 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s11083-013-9292-6","volume":"31","author":"M Wild","year":"2014","unstructured":"Wild, M.: Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. Order 31(1), 121\u2013135 (2014)","journal-title":"Order"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Yang, Z., Zhou, X., Li, K., Xiao, G., Gao, Y., Li, K.: Efficient processing of top k group skyline queries. Knowl.-Based Syst. 182, 104795 (2019)","DOI":"10.1016\/j.knosys.2019.06.003"},{"issue":"4","key":"16_CR18","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1109\/TKDE.2013.119","volume":"26","author":"N Zhang","year":"2013","unstructured":"Zhang, N., Li, C., Hassan, N., Rajasekaran, S., Das, G.: On skyline groups. IEEE Trans. Knowl. Data Eng. 26(4), 942\u2013956 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"16_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3397503","volume":"14","author":"X Zhou","year":"2020","unstructured":"Zhou, X., Li, K., Yang, Z., Gao, Y., Li, K.: Efficient approaches to k representative g-skyline queries. ACM Trans. Knowl. Discov. Data (TKDD) 14(5), 1\u201327 (2020)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:11:32Z","timestamp":1625008292000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"107","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}