{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T17:40:17Z","timestamp":1677778817608},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T00:00:00Z","timestamp":1609891200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T00:00:00Z","timestamp":1609891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"crossref","award":["2016-0-00406"],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2018R1A5A7023490"],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2023,3]]},"abstract":"Abstract<\/jats:title>Cloud computing, which is distributed, stored and managed, is drawing attention as data generation and storage volumes increase. In addition, research on green computing, which increases energy efficiency, is also widely studied. An index is constructed to retrieve huge dataset efficiently, and the layer-based indexing methods are widely used for efficient query processing. These methods construct a list of layers, so that only one layer is required for information retrieval instead of the entire dataset. The existing layer-based methods construct the layers using a convex hull algorithm. However, the execution time of this method is very high, especially in large, high-dimensional datasets. Furthermore, if the total number of layers increases, the query processing time also increases, resulting in efficient, but slow, query processing. In this paper, we propose an unbalanced-hierarchical layer method, which hierarchically divides the dimensions of input data to increase the total number of layers and reduce the index building time. We demonstrate that the proposed procedure significantly increases the total number of layers and reduces the index building time, compared to existing methods through the various experiments.<\/jats:p>","DOI":"10.1007\/s00607-020-00871-0","type":"journal-article","created":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T12:03:35Z","timestamp":1609934615000},"page":"595-616","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["UB-H: an unbalanced-hierarchical layer binary-wise construction method for high-dimensional data"],"prefix":"10.1007","volume":"105","author":[{"given":"Sun-Young","family":"Ihm","sequence":"first","affiliation":[]},{"given":"So-Hyun","family":"Park","sequence":"additional","affiliation":[]},{"given":"Young-Ho","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,6]]},"reference":[{"key":"871_CR1","doi-asserted-by":"crossref","unstructured":"Liu J, Yang J, Xiong L, Pei J (2017) Secure Skyline Queries on Cloud Platform. In: Proceedings of 2017 IEEE 33rd international conference on data engineering (ICDE), San Diego, CA, USA, pp 19\u201322, IEEE","DOI":"10.1109\/ICDE.2017.117"},{"key":"871_CR2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2956827","author":"H Gao","year":"2019","unstructured":"Gao H, Xu Y, Yin Y, Zhang W, Li R, Wang X (2019) Context-aware QoS prediction with neural collaborative filtering for internet-of-things services. IEEE Int Things J. https:\/\/doi.org\/10.1109\/JIOT.2019.2956827","journal-title":"IEEE Int Things J"},{"key":"871_CR3","doi-asserted-by":"publisher","first-page":"83682","DOI":"10.1109\/ACCESS.2019.2923459","volume":"7","author":"Y Yin","year":"2019","unstructured":"Yin Y, Xia J, Li Y, Xu Y, Xu W, Yu L (2019) Group-wise itinerary planning in temporary mobile social network. IEEE ACCESS 7:83682\u201383693","journal-title":"IEEE ACCESS"},{"key":"871_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.14257\/ijast.2016.89.05","volume":"89","author":"M Kaur","year":"2016","unstructured":"Kaur M, Mahajan M (2016) An improved security mechanism for protecting data in mobile cloud environment. Int J Adv Sci Technol 89:37\u201344","journal-title":"Int J Adv Sci Technol"},{"issue":"8","key":"871_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.14257\/ijca.2015.8.8.23","volume":"8","author":"S Im","year":"2015","unstructured":"Im S, Hwang H, Ouyang J (2015) SolidStream: NGS encoding utility with high speed and high efficiency considering transmission bandwidth of cloud environments. Int J Control Autom 8(8):223\u2013232","journal-title":"Int J Control Autom"},{"issue":"11","key":"871_CR6","doi-asserted-by":"publisher","first-page":"421","DOI":"10.14257\/ijca.2016.9.11.36","volume":"9","author":"H Yuan","year":"2016","unstructured":"Yuan H, Li C, Du M (2016) Research on fuzzy clustering method for cloud computing task scheduling. Int J Control Autom 9(11):421\u2013428","journal-title":"Int J Control Autom"},{"issue":"6","key":"871_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14257\/ijdta.2017.10.6.01","volume":"10","author":"A Bachhav","year":"2017","unstructured":"Bachhav A, Kharat V, Shelar M (2017) Query optimization for databases in cloud environment: a survey. Int J Database Theory Appl 10(6):1\u201312","journal-title":"Int J Database Theory Appl"},{"issue":"1","key":"871_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MITP.2008.10","volume":"10","author":"S Murugesan","year":"2008","unstructured":"Murugesan S (2008) Harnessing green IT: principles and practices. IEEE IT Prof 10(1):24\u201333","journal-title":"IEEE IT Prof"},{"key":"871_CR9","first-page":"1601","volume":"11","author":"A Bifet","year":"2010","unstructured":"Bifet A, Holmes G, Kirkby R, Pfahringer B (2010) MOA: massive online analysis, a framework for stream classification and clustering. J Mach Learn Res 11:1601\u20131604","journal-title":"J Mach Learn Res"},{"key":"871_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1166\/jcies.2012.1001","volume":"1","author":"K Raza","year":"2012","unstructured":"Raza K, Patle VK, Arya S (2012) A review on green computing for eco-friendly and sustainable IT. J Comput Intell Electr Syst 1:1\u201314","journal-title":"J Comput Intell Electr Syst"},{"key":"871_CR11","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s11227-013-1028-2","volume":"69","author":"SY Ihm","year":"2014","unstructured":"Ihm SY, Nasridinov A, Lee JH, Park YH (2014) Efficient duality-based subsequent matching on time-series data in green computing. J Supercomput 69:1039\u20131053","journal-title":"J Supercomput"},{"key":"871_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cag.2012.02.012","volume":"36","author":"A Stein","year":"2012","unstructured":"Stein A, Geva E, EL-Sana J (2012) CudaHull: fast parallel 3D convex hull on the GPU. Comput Graph 36:265\u2013271","journal-title":"Comput Graph"},{"key":"871_CR13","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1109\/TNNLS.2017.2648038","volume":"29","author":"S Ding","year":"2018","unstructured":"Ding S, Nie X (2018) A fast algorithm of convex hull vertices selection for online classification. IEEE Trans Neural Netw Learn Syst 29:792\u2013806","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"871_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2017\/9309181","volume":"2017","author":"SY Ihm","year":"2017","unstructured":"Ihm SY, Hur JH, Park YH (2017) An indexing method to construct unbalanced layers for high-dimensional data in mobile environments. Wirel Commun Mob Comput 2017:1\u201313","journal-title":"Wirel Commun Mob Comput"},{"key":"871_CR15","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.ejor.2010.10.007","volume":"210","author":"AA Ramli","year":"2011","unstructured":"Ramli AA, Watada J, Pedrycz W (2011) Real-time fuzzy regression analysis: a convex hull approach. Eur J Oper Res 210:606\u2013617","journal-title":"Eur J Oper Res"},{"key":"871_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ifacol.2015.08.119","volume":"48","author":"A Ruano","year":"2015","unstructured":"Ruano A, Khosravani HR, Ferreira PM (2015) A randomized approximation convex hull algorithm for high dimensions. ifac-papersonline 48:123\u2013128","journal-title":"ifac-papersonline"},{"key":"871_CR17","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), Dallas, Texas, USA, 15\u201318 May, ACM, pp 391\u2013402","DOI":"10.1145\/335191.335433"},{"key":"871_CR18","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), Long Beach, CA, USA, 1\u20136 March; IEEE, pp 445\u2013448","DOI":"10.1109\/ICDE.2010.5447908"},{"key":"871_CR19","doi-asserted-by":"publisher","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 Knowl Eng 83:1\u201319","journal-title":"Data Knowl Eng"},{"key":"871_CR20","first-page":"1","volume":"2014","author":"SY Ihm","year":"2014","unstructured":"Ihm SY, Nasridinov A, Park YH (2014) An efficient index building algorithm for selection of aggregator nodes in wireless sensor networks. Int J Distrib Sens Netw 2014:1\u20138","journal-title":"Int J Distrib Sens Netw"},{"key":"871_CR21","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.neucom.2011.09.011","volume":"77","author":"R Liu","year":"2012","unstructured":"Liu R, Fang B, Tang UU, Wen J, Qian J (2012) A fast convex hull algorithm with maximum inscribed circle affine transformation. Neurocomputing 77:212\u2013221","journal-title":"Neurocomputing"},{"key":"871_CR22","doi-asserted-by":"crossref","unstructured":"Xie M, Wong RC, Li J, Long C, Lall A (2018) Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality. In: Proceedings of the 2018 international conference on management of data, pp 959\u2013974, Houston, TX, USA, 10\u201315 June, ACM","DOI":"10.1145\/3183713.3196903"},{"key":"871_CR23","doi-asserted-by":"crossref","unstructured":"Peng P, Wong RC (2014) Geometry approach for k-regret query. In: Proceedings of the IEEE 30th international conference on data engineering, Chicago, IL, USA, 31 March\u20134 April, IEEE","DOI":"10.1109\/ICDE.2014.6816699"},{"issue":"8","key":"871_CR24","doi-asserted-by":"publisher","first-page":"866","DOI":"10.14778\/3204028.3204031","volume":"11","author":"K Mouratidis","year":"2018","unstructured":"Mouratidis K, Tang B (2018) Exact processing of uncertain top-k queries in multi-criteria settings. Proc VLDB Endow 11(8):866\u2013879","journal-title":"Proc VLDB Endow"},{"issue":"4","key":"871_CR25","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1721654.1721672","volume":"53","author":"M Armbrust","year":"2010","unstructured":"Armbrust M, Fox A, Griffith R, Joseph A, Katz R, Konwinski A, Lee G, Patterson D, Rabkin A, Stoica I, Zaharia M (2010) A view of cloud computing. Commun ACM 53(4):50\u201358","journal-title":"Commun ACM"},{"issue":"2","key":"871_CR26","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1049\/iet-net.2015.0034","volume":"5","author":"S Sarkar","year":"2016","unstructured":"Sarkar S, Misra S (2016) Theoretical modelling of fog computing: a green computing paradigm to support IoT applications. IET Netw 5(2):23\u201329","journal-title":"IET Netw"},{"key":"871_CR27","unstructured":"Kochhar N, Garg A (2011) Eco-Friendly Computing: Green Computing. Int J Comput Bus Res, 2(2)"},{"issue":"3","key":"871_CR28","first-page":"455","volume":"6","author":"TR Soomro","year":"2012","unstructured":"Soomro TR, Sarwar M (2012) Green computing: from current to future trends. Int J Hum Soc Sci 6(3):455\u2013458","journal-title":"Int J Hum Soc Sci"},{"issue":"5","key":"871_CR29","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1080\/17445760903492078","volume":"25","author":"Z Cao","year":"2010","unstructured":"Cao Z, Easterling DR, Watson LT, Li D, Cameron KW, Feng WC (2010) Power saving experiments for large-scale global optimization. Int J Parallel Emerg Distrib Syst 25(5):381\u2013400","journal-title":"Int J Parallel Emerg Distrib Syst"},{"key":"871_CR30","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"B Barber","year":"1996","unstructured":"Barber B, Dobkin P, Huhdanpaa H (1996) The quickhull algorithm for convex hulls. ACM Trans Math Softw 22:469\u2013483","journal-title":"ACM Trans Math Softw"},{"key":"871_CR31","unstructured":"Klee V (1966) Convex polytopes and linear programming. In: Proceedings of the IBM scientific computing symposium: combinatorial problems, pp 123\u2013158"},{"key":"871_CR32","unstructured":"Liu X, Wang T, Jia W, Liu A, Chi K (2019) Quick convex hull-based rendezvous planning for delay-harsh mobile data gathering in disjoint sensor networks. IEEE Trans Syst Man Cybern Syst, pp 1\u201311"},{"key":"871_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cam.2019.06.014","volume":"364","author":"H Ferrada","year":"2020","unstructured":"Ferrada H, Navarro CA, Hitschfeld N (2020) A filtering technique for fast Convex Hull construction in R2. J Comput Appl Math 364:1\u201312","journal-title":"J Comput Appl Math"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-020-00871-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-020-00871-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-020-00871-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T17:05:23Z","timestamp":1677776723000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-020-00871-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,6]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["871"],"URL":"https:\/\/doi.org\/10.1007\/s00607-020-00871-0","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,6]]},"assertion":[{"value":"12 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}
