1671 search results - page 203 / 335 » Dynamic Data Warehouse Design |
PPOPP
1999
ACM
15 years 3 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
CGF
2008
14 years 11 months ago
2008
We present a system for creating and manipulating layered procedural surface editing operations, which is motivated by the limited support for iterative design in free-form modeli...
UPP
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Traditionally, autonomic computing is envisioned as replacing the human factor in the deployment, administration and maintenance of computer systems that are ever more co...
156
Voted
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
A cracked database is a datastore continuously reorganized based on operations being executed. For each query, the data of interest is physically reclustered to speed-up future ac...
102
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...