Lower bounds for processing data with few random accesses to external memory

doi:10.1145/1516512.1516514

Lower bounds for processing data with few random accesses to external memory

Full Text:

PDF

Buy this Article

Authors:	Martin Grohe	Humboldt-Universität, Berlin, Germany
	André Hernich	Goethe-Universität, Frankfurt am Main, Germany
	Nicole Schweikardt	Goethe-Universität, Frankfurt am Main, Germany

Published in:

	· Journal
	Journal of the ACM (JACM) JACM Homepage archive
	Volume 56 Issue 3, May 2009 Article No. 12 ACM New York, NY, USA table of contents doi>10.1145/1516512.1516514

	2009 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 4 · Downloads (12 Months): 34 · Downloads (cumulative): 432 · Citation Count: 5

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: bounded-action devices complexity data streams languages query optimization query processing query processing real-time data relational databases relations among complexity classes semi-structured data theory xml

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder