{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T03:01:35Z","timestamp":1771210895941,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20513"],"award-info":[{"award-number":["U21A20513"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Taishan Scholars Program of Shandong Province","award":["tsqn202211091"],"award-info":[{"award-number":["tsqn202211091"]}]},{"DOI":"10.13039\/501100007129","name":"Shandong Provincial Natural Science Foundation","doi-asserted-by":"crossref","award":["ZR2023QF059"],"award-info":[{"award-number":["ZR2023QF059"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007129","name":"Shandong Provincial Natural Science Foundation","doi-asserted-by":"crossref","award":["ZR2023MF101"],"award-info":[{"award-number":["ZR2023MF101"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In many practical applications, skyline query is an important operation to return the pareto optimal tuples, which provides a candidate set for the optimum. On massive data, skyline often reports too many results, the users will be overwhelmed and be difficult to find the desired information easily. This paper devises <jats:italic>P<\/jats:italic>-skyline to reduce the size of the returned results. Given the approximation factor, <jats:italic>P<\/jats:italic>-skyline only generates the prominent skyline results by the definition of <jats:italic>p<\/jats:italic>-dominance. To the best of our knowledge, this paper is the first work to study <jats:italic>P<\/jats:italic>-skyline problem. This paper first proposes a baseline algorithm, which requires one full table scan to compute the results. It is found that baseline algorithm incurs a relatively high execution cost on massive data. Then, PSTP algorithm is proposed, which consists of two stages: candidate acquisition and refinement. On the presorted table, PSTP utilizes selective retrieval and selective checking to process <jats:italic>P<\/jats:italic>-skyline with much lower I\/O cost and computation cost. The extensive experimental results, conducted on synthetic and real-life data sets, show that PSTP can compute <jats:italic>P<\/jats:italic>-skyline on massive data efficiently.<\/jats:p>","DOI":"10.1007\/s41019-024-00259-6","type":"journal-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T07:05:29Z","timestamp":1733727929000},"page":"117-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Computing Prominent Skyline on Massive Data"],"prefix":"10.1007","volume":"10","author":[{"given":"Xiaolong","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5477-9249","authenticated-orcid":false,"given":"Xixian","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinbao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"259_CR1","doi-asserted-by":"publisher","first-page":"9269","DOI":"10.1109\/TKDE.2022.3222415","volume":"35","author":"Y Zhang","year":"2023","unstructured":"Zhang Y et al (2023) Efficient and secure skyline queries over vertical data federation. IEEE Trans Knowl Data Eng 35:9269\u20139280","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"259_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2022.102164","volume":"114","author":"C Bourahla","year":"2023","unstructured":"Bourahla C, Maamri R, Brahimi S (2023) Skyline recomputation in big data. Inf Syst 114:102164","journal-title":"Inf Syst"},{"key":"259_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00778-006-0029-7","volume":"16","author":"P Godfrey","year":"2007","unstructured":"Godfrey P, Shipley R, Gryz J (2007) Algorithms and analyses for maximal vector computation. VLDB J 16:5\u201328","journal-title":"VLDB J"},{"key":"259_CR4","doi-asserted-by":"publisher","first-page":"2521","DOI":"10.1109\/TKDE.2012.203","volume":"25","author":"X Han","year":"2013","unstructured":"Han X, Li J, Yang D, Wang J (2013) Efficient skyline computation on big data. IEEE Trans on Knowl Data Eng 25:2521\u20132535","journal-title":"IEEE Trans on Knowl Data Eng"},{"key":"259_CR5","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1109\/TIFS.2022.3224666","volume":"18","author":"Z Wang","year":"2023","unstructured":"Wang Z, Zhang L, Ding X, Choo KR, Jin H (2023) A dynamic-efficient structure for secure and verifiable location-based skyline queries. IEEE Trans Inf Forensics Secur 18:920\u2013935","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"259_CR6","doi-asserted-by":"crossref","unstructured":"Mouratidis K, Li K, Tang B (2021) Marrying top-k with skyline queries: Relaxing the preference input while producing output of controllable size. ACM, pp 1317\u20131330","DOI":"10.1145\/3448016.3457299"},{"key":"259_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1061318.1061320","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias D, Tao Y, Fu G, Seeger B (2005) Progressive skyline computation in database systems. ACM Trans Database Syst 30:41\u201382","journal-title":"ACM Trans Database Syst"},{"key":"259_CR8","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1109\/TKDE.2019.2904967","volume":"32","author":"K Zhang","year":"2020","unstructured":"Zhang K, Gao H, Han X, Cai Z, Li J (2020) Modeling and computing probabilistic skyline on incomplete data. IEEE Trans Knowl Data Eng 32:1405\u20131418","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"259_CR9","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 (2013) Skyline queries, front and back. SIGMOD Rec 42:6\u201318","journal-title":"SIGMOD Rec"},{"key":"259_CR10","first-page":"78","volume-title":"Skyline Cardinality for Relational Processing","author":"P Godfrey","year":"2004","unstructured":"Godfrey P (2004) Skyline Cardinality for Relational Processing, vol 2942. Springer, Berlin, pp 78\u201397"},{"key":"259_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.is.2013.05.005","volume":"39","author":"J Lee","year":"2014","unstructured":"Lee J, Hwang S-W (2014) Scalable skyline computation using a balanced pivot selection technique. Inf Syst 39:1\u201321","journal-title":"Inf Syst"},{"key":"259_CR12","doi-asserted-by":"crossref","unstructured":"Lin X, Yuan Y, Zhang Q, Zhang Y (2007) Selecting stars: The k most representative skyline operator. pp 86\u201395","DOI":"10.1109\/ICDE.2007.367854"},{"key":"259_CR13","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s00778-014-0352-3","volume":"23","author":"M Magnani","year":"2014","unstructured":"Magnani M, Assent I, Mortensen ML (2014) Taking the big picture: representative skylines based on significance and diversity. VLDB J 23:795\u2013815","journal-title":"VLDB J"},{"key":"259_CR14","doi-asserted-by":"crossref","unstructured":"Sarma AD, Lall A, Nanongkai D, Lipton RJ, Xu JJ (2011) Representative skylines using threshold-based preference distributions. IEEE Computer Society, pp 387\u2013398","DOI":"10.1109\/ICDE.2011.5767873"},{"key":"259_CR15","doi-asserted-by":"crossref","unstructured":"Tao Y, Ding L, Lin X, Pei J (2009) Distance-based representative skyline. ICDE \u201909, pp 892\u2013903","DOI":"10.1109\/ICDE.2009.84"},{"key":"259_CR16","doi-asserted-by":"crossref","unstructured":"Chan C-Y, Jagadish HV, Tan K-L, Tung AKH, Zhang Z (2006) On high dimensional skylines. EDBT\u201906, pp 478\u2013495","DOI":"10.1007\/11687238_30"},{"key":"259_CR17","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10115-018-1256-0","volume":"60","author":"X Han","year":"2019","unstructured":"Han X, Wang B, Li J, Gao H (2019) Ranking the big sky: efficient top-k skyline computation on massive data. Knowl Inf Syst 60:415\u2013446","journal-title":"Knowl Inf Syst"},{"key":"259_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.is.2008.04.004","volume":"34","author":"J Lee","year":"2009","unstructured":"Lee J, You G-W, Hwang S-W (2009) Personalized top-k skyline queries in high-dimensional space. Inf Syst 34:45\u201361","journal-title":"Inf Syst"},{"key":"259_CR19","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.datak.2010.03.008","volume":"69","author":"A Vlachou","year":"2010","unstructured":"Vlachou A, Vazirgiannis M (2010) Ranking the sky: discovering the importance of skyline points through subspace dominance relationships. Data Knowl Eng 69:943\u2013964","journal-title":"Data Knowl Eng"},{"key":"259_CR20","doi-asserted-by":"crossref","unstructured":"Chan CY, Jagadish HV, Tan K, Tung AKH, Zhang Z (2006) Finding k-dominant skylines in high dimensional space. ACM, pp 503\u2013514","DOI":"10.1145\/1142473.1142530"},{"key":"259_CR21","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2006.11.003","volume":"371","author":"V Koltun","year":"2007","unstructured":"Koltun V, Papadimitriou CH (2007) Approximately dominating representatives. Theor Comput Sci 371:148\u2013154","journal-title":"Theor Comput Sci"},{"key":"259_CR22","doi-asserted-by":"crossref","unstructured":"Xia T, Zhang D, Tao Y (2008) On skylining with flexible dominance relation. pp 1397\u20131399","DOI":"10.1109\/ICDE.2008.4497568"},{"key":"259_CR23","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s00778-014-0352-3","volume":"23","author":"M Magnani","year":"2014","unstructured":"Magnani M, Assent I, Mortensen ML (2014) Taking the big picture: representative skylines based on significance and diversity. VLDB J 23:795\u2013815","journal-title":"VLDB J"},{"key":"259_CR24","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.knosys.2015.07.007","volume":"89","author":"Y Gao","year":"2015","unstructured":"Gao Y, Liu Q, Chen L, Chen G, Li Q (2015) Efficient algorithms for finding the most desirable skyline objects. Knowl-Based Syst 89:250\u2013264","journal-title":"Knowl-Based Syst"},{"key":"259_CR25","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.tcs.2005.09.022","volume":"348","author":"S Vassilvitskii","year":"2005","unstructured":"Vassilvitskii S, Yannakakis M (2005) Efficiently computing succinct trade-off curves. Theor Comput Sci 348:334\u2013356","journal-title":"Theor Comput Sci"},{"key":"259_CR26","doi-asserted-by":"crossref","unstructured":"Chomicki J, Godfrey P, Gryz J, Liang D (2003) Skyline with presorting. pp 717\u2013719","DOI":"10.1109\/ICDE.2003.1260846"},{"key":"259_CR27","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1007\/s10115-018-1310-y","volume":"60","author":"X Han","year":"2019","unstructured":"Han X, Li X, Wang B, Gao H (2019) PRS: efficient range skyline computation on massive data via presorting. Knowl Inf Syst 60:1511\u20131548","journal-title":"Knowl Inf Syst"},{"key":"259_CR28","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"RL Graham","year":"1994","unstructured":"Graham RL, Knuth DE, Patashnik O (1994) Concrete Mathematics: A Foundation for Computer Science, 2nd edn. Addison-Wesley, Boston","edition":"2"},{"key":"259_CR29","first-page":"314","volume-title":"Curse of Dimensionality","author":"E Keogh","year":"2017","unstructured":"Keogh E, Mueen A (2017) Curse of Dimensionality. Springer, Boston, pp 314\u2013315"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-024-00259-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-024-00259-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-024-00259-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T04:17:19Z","timestamp":1740802639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-024-00259-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["259"],"URL":"https:\/\/doi.org\/10.1007\/s41019-024-00259-6","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"14 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors. Results are gotten through simulation and tested number of times to take final value.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}]}}