File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICDE.2007.367889
- Scopus: eid_2-s2.0-34548718701
- Find via
Conference Paper: The Haar+ Tree: A refined synopsis data structure
Title | The Haar+ Tree: A refined synopsis data structure |
---|---|
Authors | |
Issue Date | 2007 |
Citation | Proceedings - International Conference On Data Engineering, 2007, p. 436-445 How to Cite? |
Abstract | We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis quality at the task of summarizing data sets with sharp discontinuities than state-of-the-art histogram and Haar wavelet techniques. Second, thanks to its search space delimitation capacity, Haar+ synopsis construction operates in time linear to the size of the data set for any monotonic distributive error metric. Through experimentation, we demonstrate the superiority of Haar+ synopses over histogram and Haar wavelet methods in both construction time and achieved quality for representative error metrics. © 2007 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/93340 |
ISSN | 2023 SCImago Journal Rankings: 1.306 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Karras, P | en_HK |
dc.contributor.author | Mamoulis, N | en_HK |
dc.date.accessioned | 2010-09-25T14:58:08Z | - |
dc.date.available | 2010-09-25T14:58:08Z | - |
dc.date.issued | 2007 | en_HK |
dc.identifier.citation | Proceedings - International Conference On Data Engineering, 2007, p. 436-445 | en_HK |
dc.identifier.issn | 1084-4627 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/93340 | - |
dc.description.abstract | We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis quality at the task of summarizing data sets with sharp discontinuities than state-of-the-art histogram and Haar wavelet techniques. Second, thanks to its search space delimitation capacity, Haar+ synopsis construction operates in time linear to the size of the data set for any monotonic distributive error metric. Through experimentation, we demonstrate the superiority of Haar+ synopses over histogram and Haar wavelet methods in both construction time and achieved quality for representative error metrics. © 2007 IEEE. | en_HK |
dc.language | eng | en_HK |
dc.relation.ispartof | Proceedings - International Conference on Data Engineering | en_HK |
dc.title | The Haar+ Tree: A refined synopsis data structure | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Mamoulis, N:nikos@cs.hku.hk | en_HK |
dc.identifier.authority | Mamoulis, N=rp00155 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ICDE.2007.367889 | en_HK |
dc.identifier.scopus | eid_2-s2.0-34548718701 | en_HK |
dc.identifier.hkuros | 137789 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-34548718701&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 436 | en_HK |
dc.identifier.epage | 445 | en_HK |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Karras, P=14028488200 | en_HK |
dc.identifier.scopusauthorid | Mamoulis, N=6701782749 | en_HK |
dc.identifier.citeulike | 4175827 | - |
dc.identifier.issnl | 1084-4627 | - |