{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:49:52Z","timestamp":1742964592560,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_18","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"199-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Turing Machines with\u00a0Two-Level Memory: A Deep Look into\u00a0the\u00a0Input\/Output Complexity"],"prefix":"10.1007","author":[{"given":"Hengzhao","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyu","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianpeng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Alpern, B., Chandra, A., Snir, M.: A model for hierarchical memory. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 305\u2013314 (1987)","DOI":"10.1145\/28395.28428"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","DOI":"10.1145\/48529.48535"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/971701.50212","volume":"17","author":"W Alexander","year":"1988","unstructured":"Alexander, W., Copeland, G.: Process and dataflow control in distributed data-intensive systems. ACM SIGMOD Rec. 17(3), 90\u201398 (1988)","journal-title":"ACM SIGMOD Rec."},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BF01185206","volume":"12","author":"B Alpern","year":"1994","unstructured":"Alpern, B., Carter, L., Feig, E., Selker, T.: The uniform memory hierarchy model of computation. Algorithmica 12(2), 72\u2013109 (1994)","journal-title":"Algorithmica"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Armen, C.: Bounds on the separation of two parallel disk models. In: Proceedings of the Fourth Workshop on I\/O in Parallel and Distributed Systems: Part of the Federated Computing Research Conference, pp. 122\u2013127 (1996)","DOI":"10.1145\/236017.236044"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Copeland, G., Alexander, W., Boughter, E., Keller, T.: Data placement in bubba. In: Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, pp. 99\u2013108 (1988)","DOI":"10.1145\/971701.50213"},{"key":"18_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity, vol. 4. Springer, Cham (2013)"},{"issue":"10","key":"18_CR8","doi-asserted-by":"publisher","first-page":"5217","DOI":"10.1093\/nar\/gkaa265","volume":"48","author":"RL Elworth","year":"2020","unstructured":"Elworth, R.L., et al.: To petabytes and beyond: recent advances in probabilistic and signal processing algorithms and their application to metagenomics. Nucleic Acids Res. 48(10), 5217\u20135234 (2020)","journal-title":"Nucleic Acids Res."},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.tcs.2020.07.026","volume":"838","author":"X Gao","year":"2020","unstructured":"Gao, X., Li, J., Miao, D., Liu, X.: Recognizing the tractability in big data computing. Theor. Comput. Sci. 838, 195\u2013207 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2008.122","volume":"41","author":"I Gorton","year":"2008","unstructured":"Gorton, I., Greenfield, P., Szalay, A., Williams, R.: Data-intensive computing in the 21st century. Computer 41(4), 30\u201332 (2008)","journal-title":"Computer"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Johnston, W.E.: High-speed, wide area, data intensive computing: a ten year retrospective. In: Proceedings the Seventh International Symposium on High Performance Distributed Computing (Cat. No. 98TB100244), pp. 280\u2013291. IEEE (1998)","DOI":"10.1109\/HPDC.1998.709982"},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MC.2009.26","volume":"42","author":"RT Kouzes","year":"2009","unstructured":"Kouzes, R.T., Anderson, G.A., Elbert, S.T., Gorton, I., Gracio, D.K.: The changing paradigm of data-intensive computing. Computer 42(1), 26\u201334 (2009)","journal-title":"Computer"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Ma, H., Li, J., Gao, X., Gao, T.: Turing machines with two-level memory: a deep look into the input\/output complexity (2022). https:\/\/arxiv.org\/abs\/2208.09803","DOI":"10.1007\/978-3-031-22105-7_18"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-36574-5_3","volume-title":"Algorithms for Memory Hierarchies","author":"A Maheshwari","year":"2003","unstructured":"Maheshwari, A., Zeh, N.: A survey of techniques for designing I\/O-efficient algorithms. In: Meyer, U., Sanders, P., Sibeyn, J. (eds.) Algorithms for Memory Hierarchies. LNCS, vol. 2625, pp. 36\u201361. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36574-5_3"},{"issue":"4","key":"18_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"P O\u2019Neil","year":"1996","unstructured":"O\u2019Neil, P., Cheng, E., Gawlick, D., O\u2019Neil, E.: The log-structured merge-tree (LSM-tree). Acta Informatica 33(4), 351\u2013385 (1996). https:\/\/doi.org\/10.1007\/s002360050048","journal-title":"Acta Informatica"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Pagh, R., Silvestri, F.: The input\/output complexity of triangle enumeration. In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 224\u2013233 (2014)","DOI":"10.1145\/2594538.2594552"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Pagh, R., St\u00f6ckel, M.: The input\/output complexity of sparse matrix multiplication. In: Schulz, A.S., Wagner, D. (eds) European Symposium on Algorithms, vol. 8737, pp. 750\u2013761. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_62","DOI":"10.1007\/978-3-662-44777-2_62"},{"issue":"12","key":"18_CR18","doi-asserted-by":"publisher","first-page":"3162","DOI":"10.14778\/3476311.3476391","volume":"14","author":"I Pandis","year":"2021","unstructured":"Pandis, I.: The evolution of amazon redshift. Proc. VLDB Endowment 14(12), 3162\u20133174 (2021)","journal-title":"Proc. VLDB Endowment"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Raju, B., et al.: Big data, machine learning, and artificial intelligence: a field guide for neurosurgeons. J. Neurosurg. 1(aop), 1\u201311 (2020)","DOI":"10.3171\/2020.5.JNS201288"},{"key":"18_CR20","volume-title":"UNIX Disk Access Patterns","author":"C Ruemmler","year":"1992","unstructured":"Ruemmler, C., Wilkes, J.: UNIX Disk Access Patterns. Hewlett-Packard Laboratories, Palo Alto (1992)"},{"issue":"3","key":"18_CR21","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1177\/109434209801200305","volume":"12","author":"H Simitci","year":"1998","unstructured":"Simitci, H., Reed, D.A.: A comparison of logical and physical parallel I\/O patterns. Int. J. High Perform. Comput. Appl. 12(3), 364\u2013380 (1998)","journal-title":"Int. J. High Perform. Comput. Appl."},{"issue":"2","key":"18_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01530929","volume":"3","author":"JD Ullman","year":"1991","unstructured":"Ullman, J.D., Yannakakis, M.: The input\/output complexity of transitive closure. Ann. Math. Artif. Intell. 3(2), 331\u2013360 (1991)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"18_CR23","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"JS Vitter","year":"2001","unstructured":"Vitter, J.S.: External memory algorithms and data structures: dealing with massive data. ACM Comput. Surv. (CsUR) 33(2), 209\u2013271 (2001)","journal-title":"ACM Comput. Surv. (CsUR)"},{"issue":"12","key":"18_CR24","first-page":"1660","volume":"26","author":"YQ Zhang","year":"2003","unstructured":"Zhang, Y.Q.: Dram (h): a parallel computation model for high performance numerical computing. Chin. J. Comput.-Chin. Ed. 26(12), 1660\u20131670 (2003)","journal-title":"Chin. J. Comput.-Chin. Ed."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T10:29:33Z","timestamp":1728642573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}