{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:04:33Z","timestamp":1648757073195},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T00:00:00Z","timestamp":1587254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T00:00:00Z","timestamp":1587254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s11704-019-8437-1","type":"journal-article","created":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T15:02:41Z","timestamp":1587308561000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Guaranteeing the response deadline for general aggregation trees"],"prefix":"10.1007","volume":"14","author":[{"given":"Jiangfan","family":"Li","sequence":"first","affiliation":[]},{"given":"Chendie","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Junxu","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Deke","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,19]]},"reference":[{"issue":"4","key":"8437_CR1","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1109\/TPDS.2014.2316829","volume":"26","author":"D Guo","year":"2015","unstructured":"Guo D, Xie J, Zhou X, Zhu X, Wei W, Luo X. Exploiting efficient and scalable shuffle transfers in future data center networks. IEEE Transactions on Parallel and Distributed Systems, 2015, 26(4): 997\u20131009","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"12","key":"8437_CR2","doi-asserted-by":"publisher","first-page":"2767","DOI":"10.1109\/TKDE.2012.222","volume":"25","author":"Y Yuan","year":"2013","unstructured":"Yuan Y, Wang G, Chen L, Wang H. Efficient keyword search on uncertain graph data. IEEE Transactions on Knowledge and Data Engineering, 2013, 25(12): 2767\u20132779","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"8437_CR3","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00778-014-0373-y","volume":"24","author":"Y Yuan","year":"2015","unstructured":"Yuan Y, Wang G, Chen L, Wang H. Graph similarity search on large uncertain graph databases. The International Journal on Very Large Data Bases, 2015, 24(2): 271\u2013296","journal-title":"The International Journal on Very Large Data Bases"},{"issue":"12","key":"8437_CR4","doi-asserted-by":"publisher","first-page":"1902","DOI":"10.14778\/2367502.2367533","volume":"5","author":"S Agarwal","year":"2012","unstructured":"Agarwal S, Iyer A P, Panda A, Madden S, Mozafari B, Stoica I. Blink and it\u2019s done: interactive queries on very large data. Proceedings of the VLDB Endowment, 2012, 5(12): 1902\u20131905","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"3\u20134","key":"8437_CR5","first-page":"103","volume":"4","author":"T Abe","year":"2012","unstructured":"Abe T, Ueda T, Abe K, Ishibashi H, Matsuura T. Aggregation skip graph: a skip graph extension for efficient aggregation query over P2P networks. International Journal on Advances in Internet Technology, 2012, 4(3\u20134): 103\u2013110","journal-title":"International Journal on Advances in Internet Technology"},{"key":"8437_CR6","unstructured":"Ananthanarayanan G, Hung M C, Ren X, Stoica I, Wierman A, Yu M. GRASS: trimming stragglers in approximation analytics. In: Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation. 2014, 289\u2013302"},{"issue":"12","key":"8437_CR7","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1002\/cpe.1791","volume":"24","author":"Z Ding","year":"2012","unstructured":"Ding Z, Guo D, Liu X, Luo X, Chen G. A mapreduce-supported network structure for data centers. Concurrency and Computation: Practice and Experience, 2012, 24(12): 1271\u20131295","journal-title":"Concurrency and Computation: Practice and Experience"},{"issue":"9","key":"8437_CR8","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1093\/aje\/kwu085","volume":"179","author":"A I Naimi","year":"2014","unstructured":"Naimi A I, Daniel W. Big data: a revolution that will transform how we live, work, and think. American Journal of Epidemiology. 2014, 179(9): 1143\u20131144","journal-title":"American Journal of Epidemiology"},{"key":"8437_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00778-015-0381-6","volume":"24","author":"Y Yuan","year":"2015","unstructured":"Yuan Y, Wang G, Yu X J, Chen L. Efficient distributed subgraph similarity matching. The International Journal on Very Large Data Bases, 2015, 24: 369\u2013394","journal-title":"The International Journal on Very Large Data Bases"},{"key":"8437_CR10","doi-asserted-by":"crossref","unstructured":"Kumar G, Ananthanarayanan G, Ratnasamy S, Stoica I. Hold\u2019 em or fold\u2019 em?: aggregation queries under performance variations. In: Proceedings of the 11th European Conference on Computer Systems. 2016","DOI":"10.1145\/2901318.2901351"},{"issue":"2","key":"8437_CR11","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/2408776.2408794","volume":"56","author":"J Dean","year":"2013","unstructured":"Dean J, Barroso L A. The tail at scale. Communications of the ACM, 2013, 56(2): 74\u201380","journal-title":"Communications of the ACM"},{"issue":"10","key":"8437_CR12","doi-asserted-by":"publisher","first-page":"2367","DOI":"10.1109\/TKDE.2012.215","volume":"25","author":"D Guo","year":"2013","unstructured":"Guo D, Li M. Set reconciliation via counting bloom filters. IEEE Transactions on Knowledge and Data Engineering, 2013, 25(10): 2367\u20132380","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"8437_CR13","doi-asserted-by":"publisher","DOI":"10.1002\/0471722162","volume-title":"Order Statistics","author":"H A David","year":"2003","unstructured":"David H A. Order Statistics; 3rd ed. USA: Wiley, 2003","edition":"3rd ed."},{"issue":"6","key":"8437_CR14","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/TPDS.2010.161","volume":"22","author":"D Guo","year":"2010","unstructured":"Guo D, Wu J, Liu Y, Jin H, Chen H, Chen T. Quasi-kautz digraphs for peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems, 2010, 22(6): 1042\u20131055","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"8437_CR15","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1109\/COMST.2018.2889329","volume":"21","author":"L Luo","year":"2019","unstructured":"Luo L, Guo D, Ma R T B, Rottenstreich O, Luo X. Optimizing bloom filter: challenges, solutions, and comparisons. IEEE Communications Surveys and Tutorials, 2019, 21(2): 1912\u20131949","journal-title":"IEEE Communications Surveys and Tutorials"},{"key":"8437_CR16","unstructured":"Dean J, Ghemawat S. Mapreduce: simplified data processing on large clusters. In: Proceedings of the 6th Symposium on Operating Systems Design and Implementation. 2004"},{"key":"8437_CR17","unstructured":"Zaharia M, Konwinski A, Joseph A D, Katz R, Stoica I. Improving mapreduce performance in heterogeneous environments. In: Proceedings of USENIX Conference on Operating Systems Design and Implementation. 2008, 29\u201342"},{"key":"8437_CR18","doi-asserted-by":"crossref","unstructured":"Shvachko K, Kuang H, Radia S, Chansler R. The hadoop distributed file system. In: Proceedings of IEEE Symposium on Mass Storage Systems and Technologies. 2010, 1\u201310","DOI":"10.1109\/MSST.2010.5496972"},{"issue":"10","key":"8437_CR19","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/1562764.1562783","volume":"52","author":"K Asanovic","year":"2009","unstructured":"Asanovic K, Bod\u00edk R, Demmel J, Keaveny T, Keutzer K, Kubiatowicz J, Morgan N, Patterson D, Sen K, Wawrzynek J, Wessel D, Yelick K A. A view of the parallel computing landscape. Communications of the ACM, 2009, 52(10): 56\u201367","journal-title":"Communications of the ACM"},{"issue":"12","key":"8437_CR20","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1002\/cpe.1791","volume":"24","author":"Z Ding","year":"2012","unstructured":"Ding Z, Guo D, Xue L, Luo X, Chen G. A mapreduce-supported network structure for data centers. Concurrency and Computation Practice and Experience, 2012, 24(12): 1271\u20131295","journal-title":"Concurrency and Computation Practice and Experience"},{"issue":"6","key":"8437_CR21","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1109\/TKDE.2016.2518692","volume":"28","author":"Y Yuan","year":"2016","unstructured":"Yuan Y, Lian X, Chen L, Sun Y, Wang G. RSkNN: kNN search on road networks by incorporating social influence. IEEE Transactions on Knowledge and Data Engineering, 2016, 28(6): 1575\u20131588","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"4","key":"8437_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5194\/isprsannals-II-4-W2-1-2015","volume":"2","author":"S Liao","year":"2015","unstructured":"Liao S, Chen L, Li J, Xiong W, Wu Q. A spatiotemporal aggregation query method using multi-thread parallel technique based on regional division. ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences, 2015, 2(4): 1","journal-title":"ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences"},{"key":"8437_CR23","unstructured":"Tao Y, Kollios G, Considine J, Li F, Papadias D. Spatio-temporal aggregation using sketches. In: Proceedings of International Conference on Data Engineering. 2004, 214\u2013225"},{"key":"8437_CR24","doi-asserted-by":"crossref","unstructured":"Zhang Z, Hui J, Xie X, Pan H, Feng X. An online approximate aggregation query processing method based on hadoop. In: Proceedings of International Conference on Computer Supported Cooperative Work in Design. 2016, 117\u2013122","DOI":"10.1109\/CSCWD.2016.7565974"},{"issue":"6","key":"8437_CR25","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1109\/TKDE.2017.2656079","volume":"29","author":"Y Yuan","year":"2017","unstructured":"Yuan Y, Lian X, Chen L, Yu J, Wang G, Sun Y. Keyword search over distributed graphs. IEEE Transactions on Knowledge and Data Engineering, 2017, 29(6): 1212\u20131225","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"8437_CR26","doi-asserted-by":"crossref","unstructured":"Zhang D, Chan C Y, Tan K L. Processing spatial keyword query as a top-k aggregation query. In: Proceedings of International ACM SIGIR Conference on Research and Development in Information Retrieval. 2014, 355\u2013364","DOI":"10.1145\/2600428.2609562"},{"key":"8437_CR27","doi-asserted-by":"crossref","unstructured":"Rogge-Solti A, Weske M. Prediction of remaining service execution time using stochastic petri nets with arbitrary firing delays. In: Proceedings of International Conference on Service-Oriented Computing. 2013, 389\u2013403","DOI":"10.1007\/978-3-642-45005-1_27"},{"issue":"12","key":"8437_CR28","doi-asserted-by":"publisher","first-page":"3930","DOI":"10.1109\/JSEN.2017.2701552","volume":"17","author":"B Alinia","year":"2017","unstructured":"Alinia B, Hajiesmaili M H, Khonsari A, Crespi N. Maximum-quality tree construction for deadline-constrained aggregation in WSNs. IEEE Sensors Journal, 2017, 17(12): 3930\u20133943","journal-title":"IEEE Sensors Journal"},{"key":"8437_CR29","unstructured":"Xu Y, Musgrave Z, Noble B, Bailey M. Bobtail: avoiding long tails in the cloud. In: Proceedings of USENIX Conference on Networked Systems Design and Implementation. 2013, 329\u2013342"},{"key":"8437_CR30","doi-asserted-by":"crossref","unstructured":"Alizadeh M, Greenberg A G, Maltz D A, Padhye J, Patel P, Prabhakar B, Sengupta S, Sridharan M. Data center TCP (DCTCP). In: Proceedings of the ACM Special Interest Group on Data Communication. 2010, 63\u201374","DOI":"10.1145\/1851275.1851192"},{"key":"8437_CR31","unstructured":"Ananthanarayanan G, Ghodsi A, Warfield A, Borthakur D, Kandula S, Shenker S, Stoica I. Pacman: coordinated memory caching for parallel jobs. In: Proceedings of the 9th USENIX Symposium on Networked Systems Design and Implementation. 2012, 267\u2013280"},{"key":"8437_CR32","doi-asserted-by":"crossref","unstructured":"Isard M, Prabhakaran V, Currey J, Wieder U, Talwar K, Goldberg A. Quincy: fair scheduling for distributed computing clusters. In: Proceeds of IEEE International Conference on Recent Trends in Information Systems. 2009, 261\u2013276","DOI":"10.1145\/1629575.1629601"},{"key":"8437_CR33","doi-asserted-by":"crossref","unstructured":"Kavulya S, Tan J, Gandhi R, Narasimhan P. An analysis of traces from a production mapreduce cluster. In: Proceedings of IEEE\/ACM International Conference on Cluster, Cloud and Grid Computing. 2010, 94\u2013103","DOI":"10.1109\/CCGRID.2010.112"},{"key":"8437_CR34","doi-asserted-by":"crossref","unstructured":"Wilson C, Ballani H, Karagiannis T, Rowstron A I T. Better never than late: meeting deadlines in datacenter networks. In: Proceedings of the ACM Special Interest Group on Data Communication. 2011, 50\u201361","DOI":"10.1145\/2043164.2018443"},{"issue":"11","key":"8437_CR35","doi-asserted-by":"publisher","first-page":"3114","DOI":"10.1109\/TPDS.2017.2708120","volume":"28","author":"W Xiao","year":"2017","unstructured":"Xiao W, Bao W, Zhu X, Liu L. Cost-aware big data processing across geo-distributed datacenters. IEEE Transactions on Parallel and Distributed Systems, 2017, 28(11): 3114\u20133127","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"8437_CR36","doi-asserted-by":"crossref","unstructured":"Tang G, Wu K, Brunner R. Rethinking cdn design with distributed time-varying traffic demands. In: Proceedings of International Conference on Computer Communications. 2017, 1\u20139","DOI":"10.1109\/INFOCOM.2017.8057028"},{"issue":"1","key":"8437_CR37","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/TNET.2018.2881169","volume":"27","author":"G Tang","year":"2019","unstructured":"Tang G, Wang H, Wu K, Guo D. Tapping the knowledge of dynamic traffic demands for optimal CDN design. IEEE\/ACM Transactions on Networking, 2019, 27(1): 98\u2013111","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"1\u20132","key":"8437_CR38","doi-asserted-by":"publisher","first-page":"330","DOI":"10.14778\/1920841.1920886","volume":"3","author":"S Melnik","year":"2010","unstructured":"Melnik S, Gubarev A, Long J J, Romer G, Shivakumar S, Tolton M, Vassilakis T. Dremel: interactive analysis of web-scale datasets. Proceedings of the VLDB Endowment, 2010, 3(1\u20132): 330\u2013339","journal-title":"Proceedings of the VLDB Endowment"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-019-8437-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-019-8437-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-019-8437-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T21:17:43Z","timestamp":1642627063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-019-8437-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,19]]},"references-count":38,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["8437"],"URL":"https:\/\/doi.org\/10.1007\/s11704-019-8437-1","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,19]]},"assertion":[{"value":"18 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"146504"}}