{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:40:29Z","timestamp":1726062029647},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030364113"},{"type":"electronic","value":"9783030364120"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36412-0_18","type":"book-chapter","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:04:15Z","timestamp":1575590655000},"page":"223-234","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Recognizing the Tractability in Big Data Computing"],"prefix":"10.1007","author":[{"given":"Xiangyu","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongjing","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianmin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,23]]},"reference":[{"unstructured":"https:\/\/www.wikiwand.com\/en\/PCI_Express","key":"18_CR1"},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"DA Mix Barrington","year":"1990","unstructured":"Mix Barrington, D.A., Immerman, N., Straubing, H.: On uniformity within NC1. J. Comput. Syst. Sci. 41(3), 274\u2013306 (1990)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Buss, S.R.: The Boolean formula value problem is in ALOGTIME. In: Nineteenth ACM Symposium on Theory of Computing (1987)","key":"18_CR4","DOI":"10.1145\/28395.28409"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1137\/S009753970444572X","volume":"35","author":"B Chazelle","year":"2005","unstructured":"Chazelle, B., Liu, D., Magen, A.: Sublinear geometric algorithms. SIAM J. Comput. 35(3), 627\u2013646 (2005)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Czumaj, A., Sohler, C.: Sublinear-time algorithms. In: Property Testing-current Research & Surveys (2010)","key":"18_CR6","DOI":"10.1007\/978-3-642-16367-8_5"},{"unstructured":"Dowd, M.: Notes on log space representation (1986)","key":"18_CR7"},{"key":"18_CR8","volume-title":"Theory of Computational Complexity","author":"D-Z Du","year":"2011","unstructured":"Du, D.-Z., Ko, K.-I.: Theory of Computational Complexity, vol. 58. Wiley, New York (2011)"},{"issue":"9","key":"18_CR9","doi-asserted-by":"publisher","first-page":"685","DOI":"10.14778\/2536360.2536368","volume":"6","author":"W Fan","year":"2013","unstructured":"Fan, W., Geerts, F., Neven, F.: Making queries tractable on big data with preprocessing: (through the eyes of complexity theory). Proc. VLDB Endow. 6(9), 685\u2013696 (2013)","journal-title":"Proc. VLDB Endow."},{"doi-asserted-by":"crossref","unstructured":"Gao, X., Li, J., Miao, D., Liu, X.: Recognizing the tractability in big data computing (2019)","key":"18_CR10","DOI":"10.1007\/978-3-030-36412-0_18"},{"issue":"03","key":"18_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1142\/S0129626493000253","volume":"3","author":"R Greenlaw","year":"1993","unstructured":"Greenlaw, R.: Breadth-depth search is $$\\cal{P}$$-complete. Parallel Process. Lett. 3(03), 209\u2013222 (1993)","journal-title":"Parallel Process. Lett."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2017.08.017","volume":"749","author":"X Liu","year":"2018","unstructured":"Liu, X., Cai, Z., Miao, D., Li, J.: Tree size reduction with keeping distinguishability. Theor. Comput. Sci. 749, 26\u201335 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1109\/TKDE.2017.2758361","volume":"30","author":"D Miao","year":"2018","unstructured":"Miao, D., Cai, Z., Li, J.: On the complexity of bounded view propagation for conjunctive queries. IEEE Trans. Knowl. Data Eng. 30(1), 115\u2013127 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2017.07.033","volume":"749","author":"D Miao","year":"2018","unstructured":"Miao, D., Cai, Z., Li, Y.: SEF view deletion under bounded condition. Theor. Comput. Sci. 749, 17\u201325 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2018.10.034","volume":"788","author":"D Miao","year":"2019","unstructured":"Miao, D., Cai, Z., Jiguo, Y., Li, Y.: Triangle edge deletion on planar glasses-free RGB-digraphs. Theor. Comput. Sci. 788, 2\u201311 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/j.tcs.2015.02.010","volume":"609","author":"D Miao","year":"2016","unstructured":"Miao, D., Liu, X., Li, J.: On the complexity of sampling query feedback restricted database repair of functional dependency violations. Theor. Comput. Sci. 609, 594\u2013605 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2016.07.009","volume":"774","author":"D Miao","year":"2019","unstructured":"Miao, D., Liu, X., Li, Y., Li, J.: Vertex cover in conflict graphs. Theor. Comput. Sci. 774, 103\u2013112 (2019)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"18_CR18","first-page":"1095","volume":"34","author":"R Rubinfeld","year":"2011","unstructured":"Rubinfeld, R.: Sublinear time algorithms. Marta Sanz Sol\u00e9 34(2), 1095\u20131110 (2011)","journal-title":"Marta Sanz Sol\u00e9"},{"key":"18_CR19","volume-title":"Handbook of Theoretical Computer Science","author":"J Leeuwen Van","year":"1990","unstructured":"Van Leeuwen, J., Leeuwen, J.: Handbook of Theoretical Computer Science, vol. 1. Elsevier, Amsterdam (1990)"},{"issue":"12","key":"18_CR20","first-page":"1","volume":"56","author":"J Yang","year":"2017","unstructured":"Yang, J., Wang, H., Cao, Y.: Tractable queries on big data via preprocessing with logarithmic-size output. Knowl. Inf. Syst. 56(12), 1\u201323 (2017)","journal-title":"Knowl. Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36412-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,14]],"date-time":"2019-12-14T08:57:24Z","timestamp":1576313844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36412-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030364113","9783030364120"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36412-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiamen","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoaconference.org\/index.html","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":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"108","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":"49","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":"0","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":"45% - 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.2","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":"10","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}