{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T11:26:41Z","timestamp":1748950001613},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,8]]},"abstract":"<jats:p>Analysis of big data has become an important problem for many business and scientific applications, among which clustering and visualizing clusters in big data raise some unique challenges. This demonstration presents the CloudVista prototype system to address the problems with big data caused by using existing data reduction approaches. It promotes a whole-big-data visualization approach that preserves the details of clustering structure. The prototype system has several merits. (1) Its visualization model is naturally parallel, which guarantees the scalability. (2) The visual frame structure minimizes the data transferred between the cloud and the client. (3) The RandGen algorithm is used to achieve a good balance between interactivity and batch processing. (4) This approach is also designed to minimize the financial cost of interactive exploration in the cloud. The demonstration will highlight the problems with existing approaches and show the advantages of the CloudVista approach. The viewers will have the chance to play with the CloudVista prototype system and compare the visualization results generated with different approaches.<\/jats:p>","DOI":"10.14778\/2367502.2367529","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1886-1889","source":"Crossref","is-referenced-by-count":20,"title":["CloudVista"],"prefix":"10.14778","volume":"5","author":[{"given":"Huiqi","family":"Xu","sequence":"first","affiliation":[{"name":"Wright State University, Dayton, Ohio"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Li","sequence":"additional","affiliation":[{"name":"Wright State University, Dayton, Ohio"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shumin","family":"Guo","sequence":"additional","affiliation":[{"name":"Wright State University, Dayton, Ohio"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keke","family":"Chen","sequence":"additional","affiliation":[{"name":"Wright State University, Dayton, Ohio"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.ivs.9500076"},{"key":"e_1_2_1_2_1","first-page":"332","volume-title":"SSDBM","author":"Chen K.","year":"2011","unstructured":"K. Chen , H. Xu , F. Tian , and S. Guo . Cloudvista: Visual cluster exploration for extreme scale data in the cloud . In SSDBM , pages 332 -- 350 , 2011 . K. Chen, H. Xu, F. Tian, and S. Guo. Cloudvista: Visual cluster exploration for extreme scale data in the cloud. In SSDBM, pages 332--350, 2011."},{"key":"e_1_2_1_3_1","first-page":"137","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . Mapreduce: Simplified data processing on large clusters . In OSDI , pages 137 -- 150 , 2004 . J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137--150, 2004."},{"key":"e_1_2_1_4_1","first-page":"155","volume-title":"IEEE CLOUD","author":"Tian F.","year":"2011","unstructured":"F. Tian and K. Chen . Towards optimal resource provisioning for running mapreduce programs in public clouds . In IEEE CLOUD , pages 155 -- 162 , 2011 . 10.1109\/CLOUD.2011.14 F. Tian and K. Chen. Towards optimal resource provisioning for running mapreduce programs in public clouds. In IEEE CLOUD, pages 155--162, 2011. 10.1109\/CLOUD.2011.14"},{"key":"e_1_2_1_5_1","first-page":"103","volume-title":"SIGMOD","author":"Zhang T.","year":"1996","unstructured":"T. Zhang , R. Ramakrishnan , and M. Livny . BIRCH: An efficient data clustering method for very large databases . In SIGMOD , pages 103 -- 114 , 1996 . 10.1145\/233269.233324 T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An efficient data clustering method for very large databases. In SIGMOD, pages 103--114, 1996. 10.1145\/233269.233324"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2367502.2367529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:56:59Z","timestamp":1672225019000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2367502.2367529"}},"subtitle":["interactive and economical visual cluster analysis for big data in the cloud"],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":5,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["10.14778\/2367502.2367529"],"URL":"https:\/\/doi.org\/10.14778\/2367502.2367529","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}