How far will you walk to find your shortcut: Space Efficient Synopsis Construction Algorithms

Details How far will you walk to find your shortcut: Space Efficient Synopsis Construction Algorithms How far will you walk to find your shortcut: Space Efficient Synopsis Construction Algorithms

2005-02-18

arxiv.org/abs/cs/0502075v1

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper we consider the wavelet synopsis construction problem without the restriction that we only choose a subset of coefficients of the original data. We provide the first near optimal algorithm. We arrive at the above algorithm by considering space efficient algorithms for the restricted version of the problem. In this context we improve previous algorithms by almost a linear factor and reduce the required space to almost linear. Our techniques also extend to histogram construction, and improve the space-running time tradeoffs for V-Opt and range query histograms. We believe the idea applies to a broad range of dynamic programs and demonstrate it by showing improvements in a knapsack-like setting seen in construction of Extended Wavelets.

Affiliated with

Also associated with

No associations

Rating

How far will you walk to find your shortcut: Space Efficient Synopsis Construction Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with How far will you walk to find your shortcut: Space Efficient Synopsis Construction Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How far will you walk to find your shortcut: Space Efficient Synopsis Construction Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-387832