Machine models and lower bounds for query processing

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2007, Pages 41-52

  Schweikardt, Nicole ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Complexity; Data streams; External memory; Lower bounds; Machine models; Query processing; Survey; XML

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA PROCESSING; MATHEMATICAL MODELS; XML;

DATA STREAMS; EXTERNAL MEMORY; MACHINE MODELS;

QUERY PROCESSING;

EID: 35448932015     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1265530.1265537     Document Type: Conference Paper

References (36)

1. J. Abello and J. Vitter, editors. External Memory Algorithms, volume 50. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1999.
2. G. Aggarwal, M. Datar, S. Rajagopalan, and M. Ruhl. On the streaming model augmented with a sorting primitive. In Proc. FOCS'04, pages 540-549, 2004.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58:137-147, 1999.
4. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proc. PODS'02, pages 1-16.
5. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer-Verlag, 2nd edition, 1995.
6. Z. Bar-Yossef, M. Fontoura, and V. Josifovski. Buffering in query evaluation over XML streams. In Proc. PODS'05, pages 216-227.
7. Z. Bar-Yossef, M. Fontoura, and V. Josifovski. On the memory requirements of XPath evaluation over XML streams. In Proc. PODS'04, pages 177-188, 2004.
8. P. Beame, T. Jayram, and A. Rudra. Lower bounds for randomized read/write stream algorithms. In Proc. STOC'07, 2007.
9. C. Y. Chan, P. Felber, M. Garofalakis, and R. Rastogi. Efficient filtering of XML documents with XPath expressions. VLDB J., 11(4):354-379, 2002.
10. J. Chen and C.-K. Yap. Reversal complexity. SIAM Journal on Computing, 20(4):622-638, 1991.
11. A. Czumaj and C. Sohler. Subliner-time algorithms. Bulletin of the EATCS, 89:23-47, 2006.
12. C. Demetrescu, I. Finocchi, and A. Ribichini. Trading off space for passes in graph streaming problems. In Proc. SODA'06, pages 714-723, 2006.
13. Y. Diao, M. Altinel, M. Franklin, H. Zhang, and P. Fischer. Path sharing and predicate evaluation for high-performance XML filtering. ACM TODS, 28(4):467-516, 2003.
14. P. Erdös and G. Szekeres. A combinatorial problem in geometry. Compositio Mathematica, 2:463-470, 1935.
15. G. Gottlob, C. Koch, and R. Pichler. The complexity of XPath query evaluation. In Proc. PODS'03, pages 179-190, 2003.
16. T. Green, A. Gupta, G. Miklau, M. Onizuka, and D. Suciu. Processing XML streams with deterministic automata and stream indexes. ACM TODS, 29(4):752-788, 2004.
17. M. Grohe, Y. Gurevich, D. Leinders, N. Schweikardt, J. Tyszkiewicz, and J. Van den Bussche. Database query processing using finite cursor machines. In Proc. ICDT'07, volume 4353 of Springer LNCS, pages 284-298, 2007.
18. M. Grohe, A. Hernich, and N. Schweikardt. Lower bounds for processing data with few random accesses to external memory. Journal version of [22] and [19], submitted in 2006.
19. M. Grohe, A. Hernich, and N. Schweikardt. Randomized computations on large data sets: Tight lower bounds. In Proc. PODS'06, pages 243-252, 2006. Full version available as CoRR Report, arXiv:cs.DB/0703081.
20. M. Grohe, C. Koch, and N. Schweikardt. Tight lower bounds for query processing on streaming and external memory data. Accepted at Theoretical Computer Science, special issue for selected papers from ICALP'05.
21. M. Grohe, C. Koch, and N. Schweikardt. The complexity of querying external memory and streaming data. In Proc. FCT'05, volume 3623 of Springer LNCS, pages 1-16, 2005.
22. M. Grohe and N. Schweikardt. Lower bounds for sorting with few random accesses to external memory. In Proc. PODS'05, pages 238-249, 2005.
23. M. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In External memory algorithms, volume 50, pages 107-118. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1999.
24. A. Hernich and N. Schweikardt. Reversal complexity revisited. CoRR Report, arXiv:cs.CC/0608036, August 2006.
25. C. Koch. Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree automata-based approach. In Proc. VLDB'03, pages 249-260, 2003.
26. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
27. U. Meyer, P. Sanders, and J. Sibeyn, editors. Algorithms for Memory Hierarchies, volume 2625 of Springer LNCS. 2003.
28. S. Muthukrishnan. Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science, 1(2), 2005.
29. N. Nisan and A. Wigderson. Rounds in communication complexity revisited. SIAM Journal on Computing, 22(1):211-219, 1993.
30. D. Olteanu. SPEX: Streamed and progressive evaluation of XPath. To appear in Trans. Know. and Data Eng. (TKDE).
31. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
32. M. Ruhl. Efficient Algorithms for New Computational Models. PhD thesis, Massachusetts Institute of Technology, 2003.
33. L. Segoufin and C. Sirangelo. Constant-memory validation of streaming XML documents against DTDs. In Proc. ICDT'07, volume 4353 of Springer LNCS, pages 299-313, 2007.
34. L. Segoufin and V. Vianu. Validating streaming XML documents. In Proc. PODS'02, pages 53-64, 2002.
35. J. Vitter. External memory algorithms. In Proc. PODS'98, pages 119-128, 1998.
36. J. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33:209-271, 2001.