Chunking of Large Multidimensional Arrays
Data intensive scientific computations as well on-lineanalytical processing applications as are done on very large datasetsthat are modeled as k-dimensional arrays. The storage organization ofsuch arrays on disks is done by partitioning the large global array intofixed size hyper-rectangular sub-arrays called chunks or tiles that formthe units of data transfer between disk and memory. Typical queriesinvolve the retrieval of sub-arrays in a manner that accesses all chunksthat overlap the query results. An important metric of the storageefficiency is the expected number of chunks retrieved over all suchqueries. The question that immediately arises is "what shapes of arraychunks give the minimum expected number of chunks over a query workload?"In this paper we develop two probabilistic mathematical models of theproblem and provide exact solutions using steepest descent and geometricprogramming methods. Experimental results, using synthetic workloads onreal life data sets, show that our chunking is much more efficient thanthe existing approximate solutions.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Director. Office of Science. Advanced ScientificComputing Research
- DOE Contract Number:
- DE-AC02-05CH11231
- OSTI ID:
- 927033
- Report Number(s):
- LBNL-63230; R&D Project: 429201; BnR: KJ0101030; TRN: US200810%%206
- Country of Publication:
- United States
- Language:
- English
Similar Records
Minimizing I/O Costs of Multi-Dimensional Queries with BitmapIndices
Extension of 4-8 Texture Hierarchies to Large Video Processing and Visualization