{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:17:44Z","timestamp":1740169064984,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602129","61872106","61832003","61772157"],"award-info":[{"award-number":["61602129","61872106","61832003","61772157"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2873719","type":"journal-article","created":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T19:11:32Z","timestamp":1538680292000},"page":"58521-58531","source":"Crossref","is-referenced-by-count":3,"title":["Finding k-Dominant G-Skyline Groups on High Dimensional Data"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7923-1594","authenticated-orcid":false,"given":"Kaiqi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Xixian","family":"Han","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1430-3179","authenticated-orcid":false,"given":"Jinbao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1145\/1559845.1559897","article-title":"Scalable skyline computation using object-based space partitioning","author":"zhang","year":"2009","journal-title":"Proc SIGMOD"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739067"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32055-7_16"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398585"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.119"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.11.014"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132950"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2777994"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588565"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/1559845.1559905","article-title":"Quality and efficiency in high dimensional nearest neighbor search","author":"tao","year":"2009","journal-title":"Proc SIGMOD"},{"key":"ref4","first-page":"275","article-title":"Shooting stars in the sky: An online algorithm for skyline queries","author":"kossmann","year":"2002","journal-title":"Proc VLDB"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/0204007"},{"key":"ref3","first-page":"301","article-title":"Efficient progressive skyline computation","author":"tan","year":"2001","journal-title":"Proc VLDB"},{"key":"ref6","first-page":"279","article-title":"Approaching the skyline in Z order","author":"lee","year":"2007","journal-title":"Proc VLDB"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061320"},{"key":"ref8","first-page":"229","article-title":"Maximal vector computation in large data sets","author":"godfrey","year":"2005","journal-title":"Proc VLDB"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260846"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831363"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1412331.1412343"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914855"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989428"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142530"},{"key":"ref21","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proc VLDB"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516448"},{"key":"ref23","first-page":"478","article-title":"On high dimensional skylines","author":"chan","year":"2006","journal-title":"Proc EDBT"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367854"},{"key":"ref25","first-page":"483","article-title":"Efficient processing of top-k dominating queries on multi-dimensional data","author":"yiu","year":"2007","journal-title":"Proc VLDB"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08481680.pdf?arnumber=8481680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T17:18:33Z","timestamp":1643217513000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8481680\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2873719","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}