Sciweavers

17 search results - page 1 / 4
» The Haar Tree: A Refined Synopsis Data Structure
Sort
View
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 6 months ago
The Haar+ Tree: A Refined Synopsis Data Structure
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...
Panagiotis Karras, Nikos Mamoulis
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
13 years 10 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
EDBT
2009
ACM
110views Database» more  EDBT 2009»
13 years 9 months ago
A sampling approach for XML query selectivity estimation
As the Extensible Markup Language (XML) rapidly establishes itself as the de facto standard for presenting, storing, and exchanging data on the Internet, large volume of XML data ...
Cheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yu, Qia...
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
14 years 6 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
13 years 6 months ago
Versioning Tree Structures by Path-Merging
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...