Tight lower bounds for query processing on streaming and external memory data

Theoretical Computer Science

Volumn 380, Issue 1-2, 2007, Pages 199-217

  Grohe, Martin ^a   Koch, Christoph ^b   Schweikardt, Nicole ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Data streams; External memory; Lower bounds; Machine models; XML query languages

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA PROCESSING; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; INFORMATION MANAGEMENT;

DATA STREAMS; EXTERNAL MEMORY; LOWER BOUNDS; MACHINE MODELS; XML QUERY LANGUAGES;

QUERY PROCESSING;

EID: 34248570911     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.062     Document Type: Article

References (46)

1. Abiteboul S., Hull R., and Vianu V. Foundations of Databases (1995), Addison-Wesley
2. G. Aggarwal, M. Datar, S. Rajagopalan, M. Ruhl, On the streaming model augmented with a sorting primitive, in: Proceedings of FOCS'04, 2004, pp. 540-549
3. Alon N., Matias Y., and Szegedy M. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences 58 (1999) 137-147
4. A. Arasu, B. Babcock, T. Green, A. Gupta, J. Widom, Characterizing memory requirements for queries over continuous data streams, in: Proceedings of PODS'02, 2002, pp. 221-232
5. B. Babcock, S. Babu, M. Datar, R. Motwani, J. Widom, Models and issues in data stream systems, in: Proceedings of PODS'02, 2002, pp. 1-16
6. Z. Bar-Yossef, M. Fontoura, V. Josifovski, On the memory requirements of XPath evaluation over XML streams, in: Proceedings of PODS'04, 2004, pp. 177-188
7. Z. Bar-Yossef, M. Fontoura, V. Josifovski, Buffering in query evaluation over XML streams, in: Proceedings of PODS'05, 2005, pp. 216-227
8. A. Brüggemann-Klein, M. Murata, D. Wood, 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
9. Chen J.-E., and Yap C.-K. Reversal complexity. SIAM Journal on Computing 20 4 (1991) 622-638
10. Doner J. Tree acceptors and some of their applications. Journal of Computer and System Sciences 4 (1970) 406-451
11. Duris P., Galil Z., and Schnitger G. Lower bounds on communication complexity. Information and Computation 73 (1987) 1-22
12. M. Frick, M. Grohe, C. Koch, Query evaluation on compressed trees, in: Proceedings of LICS'03, 2003, pp. 188-197
13. Gottlob G., and Koch C. Monadic datalog and the expressive power of web information extraction languages. Journal of the ACM 51 1 (2004) 74-113
14. G. Gottlob, C. Koch, R. Pichler, Efficient algorithms for processing XPath queries, in: Proceedings of VLDB'02, 2002, pp. 95-106
15. G. Gottlob, C. Koch, R. Pichler, The complexity of XPath query evaluation, in: Proceedings of PODS'03, 2003, pp. 179-190
16. Graefe G. Query evaluation techniques for large databases. ACM Computing Surveys 25 2 (1993) 73-170
17. Green T.J., Miklau G., Onizuka M., and Suciu D. Processing XML streams with deterministic automata. Proceedings of ICDT'03. LNCS vol. 2572 (2003), Springer 173-189
18. M. Grohe, A. Hernich, N. Schweikardt, Randomized computations on large data sets: Tight lower bounds, in: Proceedings of PODS'06, 2006, pp. 243-252
19. Grohe M., Koch C., and Schweikardt N. Tight lower bounds for query processing on streaming and external memory data. Proceedings of ICALP'05. LNCS vol. 3580 (2005), Springer 1076-1088
20. Grohe M., Koch C., and Schweikardt N. The complexity of querying external memory and streaming data. Proceedings of FCT'05. LNCS vol. 3623 (2005), Springer 1-16
21. M. Grohe, N. Schweikardt, Lower bounds for sorting with few random accesses to external memory, in: Proceedings of PODS'05, 2005, pp. 238-249
22. Henzinger M., Raghavan P., and Rajagopalan S. Computing on data streams. External memory algorithms. DIMACS Series In Discrete Mathematics and Theoretical Computer Science vol. 50 (1999) 107-118
23. A. Hernich, N. Schweikardt, Reversal complexity revisited, CoRR Report, 7 August, 2006 arxiv:cs.CC/0608036. Available at: http://www.arxiv.org/abs/cs.CC/0608036
24. Hopcroft J.E., and Ullman J.D. Some results on tape-bounded Turing machines. Journal of the ACM 16 1 (1969) 168-177
25. C. Koch, Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree automata-based approach, in: Proceedings of VLDB'03, 2003, pp. 249-260
26. Kushilevitz E., and Nisan N. Communication Complexity (1997), Cambridge University Press
27. Marx M. First order paths in ordered trees. Proceedings of ICDT'05. LNCS vol. 3363 (2005), Springer 114-128
28. In: Meyer U., Sanders P., and Sibeyn J. (Eds). Algorithms for Memory Hierarchies. LNCS vol. 2625 (2003), Springer
29. Munro J., and Paterson M. Selection and sorting with limited storage. Theoretical Computer Science 12 (1980) 315-323
30. S. Muthukrishnan, Data Streams: Algorithms and Applications, Now publishers Inc, 2005
31. Neumann A., and Seidl H. Locating matches of tree patterns in forests. Proceedings of FSTTCS'98. LNCS vol. 1530 (1998), Springer 134-145
32. F. Neven, Design and analysis of query languages for structured documents-A formal and logical approach, Ph.D. Thesis, Limburgs Universitair Centrum, 1999
33. Neven F. Automata theory for XML researchers. SIGMOD Record 31 3 (2002) 39-46
34. F. Neven, T. Schwentick, Expressive and efficient pattern languages for tree-structured data, in: Proceedings of PODS'00, 2000, pp. 145-156
35. Neven F., and Schwentick T. Query automata over finite trees. Theoretical Computer Science 275 1-2 (2002) 633-674
36. Neven F., and van den Bussche J. Expressiveness of structured document query languages based on attribute grammars. Journal of the ACM 49 1 (2002) 56-100
37. Ramakrishnan R., and Gehrke J. Database Management Systems (2002), McGraw-Hill
38. Razborov A.A. Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica 10 (1990) 81-93
39. L. Segoufin, Typing and querying XML documents: Some complexity bounds, in: Proceedings of PODS'03, 2003, pp. 167-178
40. L. Segoufin, V. Vianu, Validating streaming XML documents, in: Proceedings of PODS'02, 2002, pp. 53-64
41. Thatcher J., and Wright J. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2 1 (1968) 57-81
42. Thomas W. Languages, automata, and logic. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages vol. III (1997), Springer 389-455
43. van Emde Boas P. Machine models and simulations. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science vol. 1 (1990), Elsevier Science Publishers B.V. 1-66 (Chapter 1)
44. Vitter J. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys 33 2 (2001) 209-271
45. World Wide Web Consortium, XQuery 1.0 and XPath 2.0 Formal Semantics, W3C Working Draft (Aug. 16th 2002), http://www.w3.org/XML/Query. 2002
46. A. Yao, Some complexity questions related to distributive computing, in: Proceedings of STOC'79, 1979, pp. 209-213