Lower bounds for sorting with few random accesses to external memory

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

Volumn , Issue , 2005, Pages 238-249

  Grohe, Martin ^a   Schweikardt, Nicole ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; DATA STORAGE EQUIPMENT;

ANNOTATION; COMMUNICATION COMPLEXITY; DATASETS;

QUERY LANGUAGES;

EID: 33244481087     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065167.1065197     Document Type: Conference Paper

References (14)

1. G. Aggarwal, M. Datar, S. Rajagopalan, and M. Ruhl. On the streaming model augmented with a sorting primitive. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 540-549, 2004.
2. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximationg the frequency moments. Journal of Computer and System Sciences, 58:137-147, 1999.
3. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proceedings of the 21st ACM Symposium on Principles of Database Systems, pages 1-16, 2002.
4. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer-Verlag, 2nd edition, 1995.
5. Z. Bar-Yossef, M. Fontoura, and V. Josifovski. On the memory requirements of XPath evaluation over XML streams. In Proceedings of the 23rd ACM Symposium on Principles of Database Systems, pages 177-188, 2004.
6. J. Chen and C.-K. Yap. Reversal complexity. SIAM Journal on Computing, 20(4):622-638, 1991.
7. M. Grohe, C. Koch, and N. Schweikardt. Tight lower bounds for query processing on streaming and external memory data. Manuscript, 2005.
8. 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.
9. C. Koch. Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree automata-based approach. In Proceedings of 29th Conference on Very Large Data Bases, pages 249-260, 2003.
10. U. Meyer, P. Sanders, and J. F. Sibeyn, editors. Algorithms for Memory Hierarchies, volume 2832 of Lecture Notes in Computer Science. Springer-Verlag, 2003.
11. J. J. Munro and M. S. Paterson. Selection and sorting with limited storage. Theoretical Computer Science, 12:315-323, 1980.
12. S. Muthukrishnan. Data streams: algorithms and applications. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 413-413, 2003.
13. J. F. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33:209-271, 2001.
14. K. Wagner and G. Wechsung. Computational Complexity. VEB Deutscher Verlag der Wissenschaften, 1986.