{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:36:56Z","timestamp":1794379016844,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540275800","type":"print"},{"value":"9783540316916","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_87","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T14:58:59Z","timestamp":1279465139000},"page":"1076-1088","source":"Crossref","is-referenced-by-count":14,"title":["Tight Lower Bounds for Query Processing on Streaming and External Memory Data"],"prefix":"10.1007","author":[{"given":"Martin","family":"Grohe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Koch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicole","family":"Schweikardt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"87_CR1","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)"},{"key":"87_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Datar, M., Rajagopalan, S., Ruhl, M.: On the streaming model augmented with a sorting primitive. In: Proc. FOCS 2004, pp. 540\u2013549 (2004)","DOI":"10.1109\/FOCS.2004.48"},{"key":"87_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N. Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. Journal of Computer and System Sciences\u00a058, 137\u2013147 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"87_CR4","doi-asserted-by":"crossref","unstructured":"Arasu, A., Babcock, B., Green, T., Gupta, A., Widom, J.: Characterizing Memory Requirements for Queries over Continuous Data Streams. In: Proc. PODS 2002, pp. 221\u2013232 (2002)","DOI":"10.1145\/543613.543642"},{"key":"87_CR5","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proc. PODS 2002, pp. 1\u201316 (2002)","DOI":"10.1145\/543613.543615"},{"key":"87_CR6","doi-asserted-by":"crossref","unstructured":"Bar-Yossef, Z., Fontoura, M., Josifovski, V.: On the Memory Requirements of XPath Evaluation over XML Streams. In: Proc. PODS 2004, pp. 177\u2013188 (2004)","DOI":"10.1145\/1055558.1055584"},{"key":"87_CR7","unstructured":"Br\u00fcggemann-Klein, A., Murata, M., Wood, D.: Regular Tree and Regular Hedge Languages over Non-ranked Alphabets: Version 1, April 3 (2001), Technical Report HKUST-TCSC-2001-05, Hong Kong Univ. of Science and Technology (2001)"},{"issue":"4","key":"87_CR8","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1137\/0220039","volume":"20","author":"J.-E. Chen","year":"1991","unstructured":"Chen, J.-E., Yap, C.-K.: Reversal Complexity. SIAM J. Comput.\u00a020(4), 622\u2013638 (1991)","journal-title":"SIAM J. Comput."},{"key":"87_CR9","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"Doner, J.: Tree Acceptors and some of their Applications. Journal of Computer and System Sciences\u00a04, 406\u2013451 (1970)","journal-title":"Journal of Computer and System Sciences"},{"key":"87_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(87)90037-X","volume":"73","author":"P. Duris","year":"1987","unstructured":"Duris, P., Galil, Z., Schnitger, G.: Lower bounds on communication complexity. Information and Computation\u00a073, 1\u201322 (1987); Journal version of STOC 1984 (1984)","journal-title":"Information and Computation"},{"issue":"1","key":"87_CR11","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/962446.962450","volume":"51","author":"G. Gottlob","year":"2004","unstructured":"Gottlob, G., Koch, C.: Monadic Datalog and the Expressive Power of Web Information Extraction Languages. Journal of the ACM\u00a051(1), 74\u2013113 (2004)","journal-title":"Journal of the ACM"},{"key":"87_CR12","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Pichler, R.: Efficient Algorithms for Processing XPath Queries. In: Proc. VLDB 2002, Hong Kong, China, pp. 95\u2013106 (2002)","DOI":"10.1016\/B978-155860869-6\/50017-2"},{"key":"87_CR13","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Pichler, R.: The Complexity of XPath Query Evaluation. In: Proc. PODS 2003, San Diego, California, pp. 179\u2013190 (2003)","DOI":"10.1145\/773153.773171"},{"issue":"2","key":"87_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/152610.152611","volume":"25","author":"G. Graefe","year":"1993","unstructured":"Graefe, G.: Query Evaluation Techniques for Large Databases. ACM Computing Surveys\u00a025(2), 73\u2013170 (1993)","journal-title":"ACM Computing Surveys"},{"key":"87_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-36285-1_12","volume-title":"Database Theory - ICDT 2003","author":"T.J. Green","year":"2002","unstructured":"Green, T.J., Miklau, G., Onizuka, M., Suciu, D.: Processing XML Streams with Deterministic Automata. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 173\u2013189. Springer, Heidelberg (2002)"},{"key":"87_CR16","doi-asserted-by":"crossref","unstructured":"Grohe, M., Koch, C., Schweikardt, N.: Tight lower bounds for query processing on streaming and external memory data. Technical report CoRR cs.DB\/0505002, Full version of ICALP 2005 paper (2005)","DOI":"10.1007\/11523468_87"},{"key":"87_CR17","doi-asserted-by":"crossref","unstructured":"Grohe, M., Schweikardt, N.: Lower bounds for sorting with few random accesses to external memory. In: Proc. PODS (2005) (To appear)","DOI":"10.1145\/1065167.1065197"},{"key":"87_CR18","doi-asserted-by":"crossref","unstructured":"Henzinger, M., Raghavan, P., Rajagopalan, S.: Computing on data streams. In: External memory algorithms. DIMACS Series In Discrete Mathematics And Theoretical Computer Science, vol.\u00a050, pp. 107\u2013118 (1999)","DOI":"10.1090\/dimacs\/050\/05"},{"issue":"1","key":"87_CR19","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321495.321508","volume":"16","author":"J.E. Hopcroft","year":"1969","unstructured":"Hopcroft, J.E., Ullman, J.D.: Some results on tape-bounded Turing machines. Journal of the ACM\u00a016(1), 168\u2013177 (1969)","journal-title":"Journal of the ACM"},{"key":"87_CR20","doi-asserted-by":"crossref","unstructured":"Koch, C.: Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach. In: Proc. VLDB 2003, pp. 249\u2013260 (2003)","DOI":"10.1016\/B978-012722442-8\/50030-6"},{"key":"87_CR21","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge Univ. Press, Cambridge (1997)"},{"key":"87_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms - ESA 2003","year":"2003","unstructured":"Meyer, U., Sanders, P., Sibeyn, J. (eds.): ESA 2003. LNCS, vol.\u00a02832. Springer, Heidelberg (2003)"},{"key":"87_CR23","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"J. Munro","year":"1980","unstructured":"Munro, J., Paterson, M.: Selection and sorting with limited storage. Theoretical Computer Science\u00a012, 315\u2013323 (1980)","journal-title":"Theoretical Computer Science"},{"key":"87_CR24","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. In: Proc. 14th SODA, pp. 413\u2013413 (2003)"},{"key":"87_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-49382-2_12","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Neumann","year":"1998","unstructured":"Neumann, A., Seidl, H.: Locating Matches of Tree Patterns in Forests. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 134\u2013146. Springer, Heidelberg (1998)"},{"issue":"1","key":"87_CR26","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/505241.505245","volume":"49","author":"F. Neven","year":"2002","unstructured":"Neven, F., van den Bussche, J.: Expressiveness of Structured Document Query Languages Based on Attribute Grammars. J. ACM\u00a049(1), 56\u2013100 (2002)","journal-title":"J. ACM"},{"key":"87_CR27","volume-title":"Database Management Systems","author":"R. Ramakrishnan","year":"2002","unstructured":"Ramakrishnan, R., Gehrke, J.: Database Management Systems. McGraw-Hill, New York (2002)"},{"key":"87_CR28","doi-asserted-by":"crossref","unstructured":"Segoufin, L.: Typing and Querying XML Documents: Some Complexity Bounds. In: Proc. PODS 2003, pp. 167\u2013178 (2003)","DOI":"10.1145\/773153.773170"},{"key":"87_CR29","doi-asserted-by":"crossref","unstructured":"Segoufin, L., Vianu, V.: Validating Streaming XML Documents. In: Proc. PODS 2002 (2002)","DOI":"10.1145\/543613.543622"},{"issue":"1","key":"87_CR30","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J. Thatcher","year":"1968","unstructured":"Thatcher, J., Wright, J.: Generalized Finite Automata Theory with an Application to a Decision Problem of Second-order Logic. Math. Syst. Theory\u00a02(1), 57\u201381 (1968)","journal-title":"Math. Syst. Theory"},{"key":"87_CR31","first-page":"1","volume-title":"Handbook of Theoretical Computer Science, ch. 1","author":"P. Boas van Emde","year":"1990","unstructured":"van Emde Boas, P.: Machine Models and Simulations. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 1, vol.\u00a01, pp. 1\u201366. Elsevier Science Publishers B.V, Amsterdam (1990)"},{"issue":"2","key":"87_CR32","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J. Vitter","year":"2001","unstructured":"Vitter, J.: External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys\u00a033(2), 209\u2013271 (2001)","journal-title":"ACM Computing Surveys"},{"key":"87_CR33","unstructured":"World Wide Web Consortium. XQuery 1.0 and XPath 2.0 Formal Semantics. W3C Working Draft (August 16, 2002), http:\/\/www.w3.org\/XML\/Query"},{"key":"87_CR34","doi-asserted-by":"crossref","unstructured":"Yao, A.: Some complexity questions related to distributive computing. In: Proc. 11th STOC, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_87.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:06:18Z","timestamp":1605625578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11523468_87","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11523468","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}