Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

PODS
2007
ACM

favoriteEmaildiscussreport

108views Database» more PODS 2007»

Machine models and lower bounds for query processing

14 years 11 months ago

Machine models and lower bounds for query processing

Download www2.informatik.hu-berlin.de

This paper gives an overview of recent work on machine models for processing massive amounts of data. The main focus is on generalizations of the classical data stream model where, apart from an "internal memory" of limited size, also a number of (potentially huge) streams may be used as "external memory devices". Categories and Subject Descriptors

Nicole Schweikardt

Real-time Traffic

Data Stream Model | Database | External Memory Devices | Internal Memory | PODS 2007 |

claim paper

Related Content

» Tight Lower Bounds for Query Processing on Streaming and External Memory Data

» Database Query Processing Using Finite Cursor Machines

» Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine

» Orthogonal range reporting query lower bounds optimal structures in 3d and higherdimension...

» Efficient Learning Algorithms Yield Circuit Lower Bounds

» A Lower Bound for Learning Distributions Generated by Probabilistic Automata

» Lower Bounds on Learning Random Structures with Statistical Queries

» Lower Bounds for the Complexity of Learning HalfSpaces with Membership Queries

» The Complexity of Querying External Memory and Streaming Data

Post Info
More Details (n/a)

Added	08 Dec 2009
Updated	08 Dec 2009
Type	Conference
Year	2007
Where	PODS
Authors	Nicole Schweikardt

Comments (0)