Abstract
We present a space- and time- efficient algorithm for maintaining multidimensional histograms for data that is dynamic, i.e., subject to updates that may be increments or decrements. Both space used as well as per-update and computing times are polylogarithmic in the input data size; this is the first known algorithm in the data stream model for this problem with this property.
One of the powerful motivation for studying data stream algorithms is in analyzing traffic log from IP networks where d-dimensional data (for small d) is common. Hence, our results are of great interest. The result itself is achieved by generalizing methods known for maintenance of unidimensional histograms under updates—finding significant tensor generalizations of one dimensional wavelets, approximating distributions by robust representations—and relationships amongst histograms such as those between tensor wavelets or hierarchical histograms and general histograms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Matias, Y., Szegedy, M.: The Space Complexity of Approximating the Frequency Moments. In: STOC, pp. 20–29 (1996)
d’Amore, F., Franciosa, P.G.: On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles. Information Processing Letters 44(5), 255–259 (1992)
Babcock, B., Babu, S., Datar, M., Motwani, E., Widom, J.: Models and Issues in Data Stream Systems. In: Proc. of the ACM Symposium on Principles of Database System, PODS (2002)
Garofalakis, M., Gehrke, J., Rastogi, R.: Querying and mining data streams: you only get one look. In: Tutorials at SIGMOD 2002, KDD 2002, VLDB 2002, etc., http://www.bell-labs.com/user/minos/tutorials.html
Gilbert, A., Guha, S., Indyk, P., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Fast, Small-Space Algorithms for Approximate Histogram Maintenance. In: STOC (2002)
Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.: Histogramming Data Streams with Fast Per-Item Processing. In: ICALP, pp. 681–692 (2002)
Indyk, P.: Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. In: FOCS, pp. 189–197 (2000)
Jagadish, H., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K., Suel, T.: Optimal Histograms with Quality Guarantees. In: VLDB, pp. 275–286 (1998)
Muthukrishnan, S.: Data Streams: Algorithms and Applications. In: SODA, p. 413 (2003)
Muthukrishnan, S., Poosala, V., Suel, T.: On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications. In: ICDT, pp. 236–256 (1999)
Workshop on Managing and Processing Data Streams (MPDS) With FCRC (2003), http://www.research.att.com/conf/mpds2003/
Thaper, N., Guha, S., Indyk, P., Koudas, N.: Dynamic Multidimensional Histograms. In: SIGMOD, pp. 428–439 (2002)
Varghese, G.: SIGCOMM 2002 tutorial on Detecting packet patterns at high speeds (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muthukrishnan, S., Strauss, M. (2003). Maintenance of Multidimensional Histograms. In: Pandya, P.K., Radhakrishnan, J. (eds) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2003. Lecture Notes in Computer Science, vol 2914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24597-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-24597-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20680-4
Online ISBN: 978-3-540-24597-1
eBook Packages: Springer Book Archive