ACM Home Page
Please provide us with feedback. Feedback
SHIFT-SPLIT: I/O efficient maintenance of wavelet-transformed multidimensional data
Full text PdfPdf (561 KB)
Source International Conference on Management of Data archive
Proceedings of the 2005 ACM SIGMOD international conference on Management of data table of contents
Baltimore, Maryland
SESSION: Research papers: OLAP table of contents
Pages: 275 - 286  
Year of Publication: 2005
ISBN:1-59593-060-4
Authors
Mehrdad Jahangiri  University of Southern, California, Los Angeles, CA
Dimitris Sacharidis  National Technical University of Athens, Athens, GR
Cyrus Shahabi  University of Southern, California, Los Angeles, CA
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 54,   Citation Count: 7
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1066157.1066189
What is a DOI?

ABSTRACT

The Discrete Wavelet Transform is a proven tool for a wide range of database applications. However, despite broad acceptance, some of its properties have not been fully explored and thus not exploited, particularly for two common forms of multidimensional decomposition. We introduce two novel operations for wavelet transformed data, termed SHIFT and SPLIT, based on the properties of wavelet trees, which work directly in the wavelet domain. We demonstrate their significance and usefulness by analytically proving six important results in four common data maintenance scenarios, i.e., transformation of massive datasets, appending data, approximation of data streams and partial data reconstruction, leading to significant I/O cost reduction in all cases. Furthermore, we show how these operations can be further improved in combination with the optimal coefficient-to-disk-block allocation strategy. Our exhaustive set of empirical experiments with real-world datasets verifies our claims.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. Bulut and A. K. Singh. SWAT: Hierarchical stream summarization in large networks. In Proceedings of ICDE, pages 303--314, 2003.
 
2
3
4
 
5
6
 
7
 
8
S. Papadimitriou, A. Brockwell, and C. Faloutsos. Awsom: Adaptive, hands-off stream mining. In Proceedings of VLDB, 2003.
 
9
 
10
C. Shahabi and R. Schmidt. Wavelet disk placement for efficient querying of large-multidimensional data sets. In Department of Computer Science Technical Reports. University Of Southern California, 2004.
 
11
12
13
 
14
M. Widmann and C. Bretherton. 50 km resolution daily precipitation for the pacific northwest, 1949--94.
15

Collaborative Colleagues:
Mehrdad Jahangiri: colleagues
Dimitris Sacharidis: colleagues
Cyrus Shahabi: colleagues