Sciweavers

6004 search results - page 850 / 1201
» Parallelizing query optimization
Sort
View
171
Voted
PPOPP
2011
ACM
14 years 6 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
156
Voted
MICRO
2012
IEEE
231views Hardware» more  MICRO 2012»
13 years 5 months ago
What is Happening to Power, Performance, and Software?
The past 10 years have delivered two significant revolutions. (1) Microprocessor design has been transformed by the limits of chip power, wire latency, and Dennard scaling—leadi...
Hadi Esmaeilzadeh, Ting Cao, Xi Yang, Stephen Blac...
GIS
2007
ACM
16 years 4 months ago
Environmental scenario search and visualization
We have developed Environmental Scenario Search Engine (ESSE) for parallel data mining of a set of conditions inside distributed, very large databases from multiple environmental ...
Mikhail N. Zhizhin, Eric A. Kihn, Vassily Lyutsare...
PODS
2005
ACM
164views Database» more  PODS 2005»
16 years 3 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 3 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...