Randomized computations on large data sets: Tight lower bounds

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

Volumn , Issue , 2006, Pages 243-252

  Grohe, Martin ^a   Hernich, André ^a   Schweikardt, Nicole ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Complexity; Data streams real time data; Query processing query optimization; Semi structured data; XML

Indexed keywords

ACCESS CONTROL; COMPUTATIONAL METHODS; DECISION MAKING; QUERY PROCESSING; REAL TIME CONTROL; STORAGE ALLOCATION (COMPUTER);

DATA STREAMS; DECISION PROBLEMS; QUERY OPTIMIZATION; SEMI-STRUCTURED DATA;

DATABASE SYSTEMS;

EID: 34250638730     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142387     Document Type: Conference Paper

References (20)

1. 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.
2. 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.
3. L. Arge and P. Bro Miltersen. On showing lower bounds for external-memory computational geometry problems. In J. Abello and J. Vitter, editors, External Memory Algorithms and Visualization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 139-159. 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, 2002.
5. 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.
6. Z. Bar-Yossef, M. Fontoura, and V. Josifovski. Buffering in query evaluation over XML streams. In Proc. PODS'05, pages 216-227, 2005.
7. J. Chen and C.-K. Yap. Reversal complexity. SIAM Journal on Computing, 20(4):622-638, 1991.
8. 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.
9. M. Grohe, C. Koch, and N. Schweikardt. Tight lower bounds for query processing on streaming and external memory data. In Proc. ICALP'05, volume 3580 of Springer LNCS, pages 1076-1088, 2005. (Best paper award at ICALP'05, track B.).
10. M. Grohe and N. Schweikardt. Lower bounds for sorting with few random accesses to external memory. In Proc. PODS'05, pages 238-249, 2005.
11. 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.
12. J. Hromkovic. Design and Analysis of Randomized Algorithms. Springer-Verlag, 1998.
13. U. Meyer, P. Sanders, and J. Sibeyn, editors. Algorithms for Memory Hierarchies, volume 2625 of Springer LNCS. 2003.
14. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
15. J. Munro and M. Paterson. Selection and sorting with limited storage. Theoretical Computer Science, 12:315-323, 1980.
16. S. Muthukrishnan. Data streams: algorithms and applications. In Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 413-413, 2003.
17. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
18. J. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33:209-271, 2001.
19. K. Wagner and G. Wechsung. Computational Complexity. VEB Deutscher Verlag der Wissenschaften, 1986.
20. World Wide Web Consortium. XML Path Language (XPath) 2.0. W3C Candidate Recommendation 3 November 2005, 2005. http://www.w3.org/TR/xpath20/.