Sciweavers

496 search results - page 1 / 100
» Machine models and lower bounds for query processing
Sort
View
PODS
2007
ACM
108views Database» more  PODS 2007»
14 years 5 months ago
Machine models and lower bounds for query processing
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...
Nicole Schweikardt
ICALP
2005
Springer
13 years 10 months ago
Tight Lower Bounds for Query Processing on Streaming and External Memory Data
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...
Martin Grohe, Christoph Koch, Nicole Schweikardt
ICDT
2007
ACM
143views Database» more  ICDT 2007»
13 years 11 months ago
Database Query Processing Using Finite Cursor Machines
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...
Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole...
ICALP
1992
Springer
13 years 9 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
COMPGEOM
2010
ACM
13 years 10 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen