{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T05:57:05Z","timestamp":1712987825668},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T00:00:00Z","timestamp":1470268800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"The Small and Medium Business Administration\/The Sookmyung Women\u2019s University Entrepreneurship Center","award":["SEC-14-RESEARCH-003"],"award-info":[{"award-number":["SEC-14-RESEARCH-003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s11227-016-1826-4","type":"journal-article","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T17:16:43Z","timestamp":1470331003000},"page":"4262-4275","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adaptive convex skyline: a threshold-based project partitioned layer-based index for efficient-processing top-k queries in entrepreneurship applications"],"prefix":"10.1007","volume":"72","author":[{"given":"Yunsik","family":"Son","sequence":"first","affiliation":[]},{"given":"Sun-Young","family":"Ihm","sequence":"additional","affiliation":[]},{"given":"Aziz","family":"Nasridinov","sequence":"additional","affiliation":[]},{"given":"Young-Ho","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,4]]},"reference":[{"issue":"4","key":"1826_CR1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"B Barber","year":"1996","unstructured":"Barber B, Dobkin DP, Huhdanpaa H (1996) The quickhull algorithm for convex hulls. ACM Trans Math Softw (TOMS) 22(4):469\u2013483","journal-title":"ACM Trans Math Softw (TOMS)"},{"key":"1826_CR2","unstructured":"Borzsonyi S, Kossmann D, Stocker K (2011) The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering (ICDE), pp 421\u2013430"},{"key":"1826_CR3","doi-asserted-by":"crossref","unstructured":"Chang YC, Bergman L, Castelli V, Li CS, Lo ML, Smith JR (2000) The onion technique: indexing for linear optimization queries. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp 391\u2013402","DOI":"10.1145\/335191.335433"},{"key":"1826_CR4","doi-asserted-by":"crossref","unstructured":"Heo JS, Cho J, Whang KY (2010) The hybrid-layer index: a synergic approach to answering top-k queries in arbitrary subspaces. In: Proceedings of the 26th International Conference on Data Engineering (ICDE), pp 445\u2013448","DOI":"10.1109\/ICDE.2010.5447908"},{"key":"1826_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.datak.2012.07.001","volume":"83","author":"JS Heo","year":"2013","unstructured":"Heo JS, Cho J, Whang KY (2013) Subspace top-k query processing using the hybrid-layer index with a tight bound. Data Knowled Eng 83:1\u201319","journal-title":"Data Knowled Eng"},{"issue":"19","key":"1826_CR6","doi-asserted-by":"crossref","first-page":"3286","DOI":"10.1016\/j.ins.2009.05.016","volume":"179","author":"JS Heo","year":"2009","unstructured":"Heo JS, Whang KY, Kim MS, Kim YR, Song IY (2009) The partitioned-layer index: answering monotone top-k queries using the convex skyline and partitioning-merging technique. Inf Sci 179(19):3286\u20133308","journal-title":"Inf Sci"},{"key":"1826_CR7","doi-asserted-by":"crossref","unstructured":"Fagin R, Lotem A, Naor M (2001) Optimal aggregation algorithms for middleware. In: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp 102\u2013113","DOI":"10.1145\/375551.375567"},{"key":"1826_CR8","doi-asserted-by":"crossref","unstructured":"Lee J, Cho H, Hwang SW (2012) Efficient dual-resolution layer indexing for top-k queries. In: Proceedings of the 2012 IEEE 28th International Conference on Data Engineering (ICDE), pp 1085\u20131095","DOI":"10.1109\/ICDE.2012.73"},{"issue":"12","key":"1826_CR9","doi-asserted-by":"crossref","first-page":"3103","DOI":"10.1109\/TKDE.2013.149","volume":"26","author":"J Lee","year":"2014","unstructured":"Lee J, Cho H, Lee S, Hwang SW (2014) Toward scalable indexing for top-k queries. IEEE Trans Knowl Data Eng (TKDE) 26(12):3103\u20133116","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"key":"1826_CR10","doi-asserted-by":"crossref","unstructured":"Li C, Chang KCC, Ilyas IF (2006) Supporting ad-hoc ranking aggregates. In: Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data (SIGMOD), pp 61\u201372","DOI":"10.1145\/1142473.1142481"},{"key":"1826_CR11","doi-asserted-by":"crossref","unstructured":"Li C, Chang KCC, Ilyas IF, Song S (2005) RankSQL: query algebra and optimization for relational top-k queries. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of data (SIGMOD), pp 131\u2013142","DOI":"10.1145\/1066157.1066173"},{"key":"1826_CR12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.knosys.2014.01.022","volume":"61","author":"SY Ihm","year":"2015","unstructured":"Ihm SY, Lee KE, Nasridinov A, Heo JS, Park YH (2015) Approximate convex skyline: a partitioned layer-based index for efficient processing top-k queries. Knowl Based Syst 61:13\u201328","journal-title":"Knowl Based Syst"},{"key":"1826_CR13","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1097\/00007611-199708000-00008","volume":"90","author":"JP Willem","year":"1997","unstructured":"Willem JP, Saunders JT, Hunt DE, Schorling JB (1997) Prevalence of coronary heart disease risk factors among rural blacks: a community-based study. South Med J 90:814\u2013820","journal-title":"South Med J"},{"key":"1826_CR14","unstructured":"Xin D, Chen C, Han J (2006) Towards robust indexing for ranked queries. In: Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB), pp 235\u2013246"},{"issue":"5","key":"1826_CR15","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1109\/TKDE.2010.240","volume":"23","author":"L Zou","year":"2011","unstructured":"Zou L, Chen L (2011) Pareto-based dominant graph: an efficient indexing structure to answer top-K queries. IEEE Trans Knowl Data Eng (TKDE) 23(5):727\u2013741","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1826-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-016-1826-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1826-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T19:58:05Z","timestamp":1498334285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-016-1826-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,4]]},"references-count":15,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1826"],"URL":"https:\/\/doi.org\/10.1007\/s11227-016-1826-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,4]]}}}