Accuracy vs. lifetime: Linear sketches for aggregate queries in sensor networks

Algorithmica (New York)

Volumn 49, Issue 4, 2007, Pages 357-385

  Puttagunta, Vasundhara ^a   Kalpakis, Konstantinos ^a  

^a University of Marylandw Baltimore County   (United States)

Author keywords

Approximate query answering; In network aggregation; Linear sketching; Sensor networks

Indexed keywords

APPROXIMATE QUERY ANSWERING; IN-NETWORK AGGREGATION; LINEAR SKETCHES;

APPROXIMATION THEORY; DATA STRUCTURES; DISCRETE FOURIER TRANSFORMS; DISCRETE WAVELET TRANSFORMS; QUERY PROCESSING;

SENSOR NETWORKS;

EID: 38549176381     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9098-2     Document Type: Conference Paper

References (37)

1. Acharya, S., Gibbons, P.B., Poosala, V., Ramaswamy, S.: Join synopses for approximate query answering. In: Proceedings ACM SIGMOD International Conference on Management of Data, pp. 275-286, 1999
2. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: STOC '96: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 20-29, 1996
3. Alon, N., Gibbons, P.B., Matias, Y., Szegedy, M.: Tracking join and self-join sizes in limited storage. In: PODS '99: Proceedings of the Eighteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, New York, NY, USA, pp. 10-20, 1999
4. Babu, S., Widom, J.: Continuous queries over data streams. Technical report, Stanford University (2001)
5. Chang, J.-H., Tassiulas, L.: Energy conserving routing in wireless ad-hoc networks. In: Proceedings of IEEE INFOCOM, vol. 1, pp. 22-31, 2000
6. Considine, J., Li, F., Kollios, G., Byers, J.W.: Approximate aggregation techniques for sensor databases. In: Proceedings of the 20th International Conference on Data Engineering (ICDE), pp. 449-460, 2004
7. Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1), 58-75 (2005)
8. Dasgupta, S., Gupta, A.: An elementary proof of the Johnson-Lindenstrauss Lemma. Technical Report TR-99-006, University of California, Berkeley, CA, 1999
9. Davis, P.J.: Circulant Matrices. Wiley, New York (1979)
10. Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182-209 (1985)
11. Gibbons, P.B., Matias, Y.: New sampling-based summary statistics for improving approximate query answers. In: SIGMOD '98: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, New York, NY, USA, pp. 331-342, 1998
12. Gibbons, P.B., Matias, Y.: Synopsis data structures for massive data sets. In: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science: Special Issue on External Memory Algorithms and Visualization, vol. A, 1999
13. Gibbons, P.B., Matias, Y., Poosala, V.: Aqua project white paper. Technical report, Information Sciences Research Center, Bell Laboratories (1997)
14. Gibbons, P.B., Matias, Y., Poosala, V.: Fast incremental maintenance of approximate histograms. In: Proc. 23rd Int. Conf. Very Large Data Bases, VLDB, pp. 466-475, 1997
15. Gilbert, A.C., Kotidis, Y., Muthukrishnan, S., Strauss, M.: QuickSAND: quick summary and analysis of network data. Technical report, DIMACS (2001)
16. Gilbert, A.C., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Surfing wavelets on streams: one-pass summaries for approximate aggregate queries. In: VLDB '01: Proceedings of the 27th International Conference on Very Large Data Bases, San Francisco, CA, USA, pp. 79-88, 2001
17. Gilbert, A.C., Kotidis, Y., Muthukrishnan, S., Strauss, M.: How to summarize the universe: dynamic maintenance of quantiles. In: VLDB, pp. 454-465, 2002
18. Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.: Histogramming data streams with fast per-item processing. In: ICALP 2002, pp. 681-692, 2002
19. Haas, P.J., Naughton, J.F., Seshadri, S., Stokes, L.: Sampling-based estimation of the number of distinct values of an attribute. In: VLDB'95, Proceedings of 21th International Conference on Very Large Data Bases, Zurich, Switzerland, pp. 311-322, 1995
20. Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the 33rd Hawaii International Conference on System Sciences, vol. 8, 2000
21. Hellerstein, J.M., Hong, W., Madden, S., Stanek, K.: Beyond average: toward sophisticated sensing with queries. In: Proceedings of 2nd International Workshop on Information Processing in Sensor Networks (IPSN), pp. 63-79, 2003
22. Kalpakis, K., Dasgupta, K., Namjoshi, P.: Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. Comput. Netw. 42(6), 697-716 (2003)
23. Kalpakis, K., Dasgupta, K., Namjoshi, P.: Improving the lifetime of sensor networks via intelligent selection of data aggregation trees. In: Proceedings of Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS'03), pp. 139-147, 2003
24. Krishnamachari, B., Estrin, D., Wicker, S.B.: The impact of data aggregation in wireless sensor networks. In: Proceedings of International Workshop on Distributed Event-Based Systems, pp. 575-578, 2002
25. Lancaster, P., Tismenetsky, M.: The Theory of Matrices with Applications, 2nd edn. A Series of Monographs and Textbooks, vol. Computer Science and Applied Mathematics. Academic Press, Orlando (1985)
26. LANDSAT Image Gallery: http://landsat.gsfc.nasa.gov/images/gallery.html. Previously at http://www.nnic.noaa.gov/SOCC/gallery.htm
27. Lindsay, S., Raghavendra, C.S., Sivalingam, K.M.: Data gathering in sensor networks using the energy delay metric. In: IPDPS '01: Proceedings of the 15th International Parallel & Distributed Processing Symposium, Washington, DC, USA, p. 188, 2001
28. Madden, S., Franklin, M.J.: Fjording the stream: an architecture for queries over streaming sensor data. In: Proceedings of the 18th International Conference on Data Engineering (ICDE'02), p. 555, 2002
29. Madden, S., Szewczyk, R., Franklin, M.J., Culler, D.: Supporting aggregate queries over ad-hoc wireless sensor networks. In: WMCSA '02: Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications, Washington, DC, USA, p. 49, 2002
30. Madden, S.R., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a tiny aggregation service for ad-hoc sensor networks. In: Proceedings of the ACM Symposium on Operating System Design and Implementation (OSDI), 2002
31. Nath, S., Gibbons, P.B., Seshan, S., Anderson, Z.R.: Synopsis diffusion for robust aggregation in sensor networks. In: SenSys '04: Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems, New York, NY, USA, pp. 250-262, 2004
32. Poosala, V.: Histogram-based estimation techniques in database systems. Ph.D. thesis, University of Wisconsin, Madison, Wisconsin, USA (1997)
33. Puttagunta, V., Kalpakis, K.: Answering approximate aggregate queries using linear sketches. Technical Report TR-CS-03-29, University of Maryland Baltimore County (2003)
34. Strang, G.: Mathematical methods for engineers I: supplementary material. http://www-math.mit.edu/18085. Four Special Matrices (applmath1_1.pdf), Solutions (applmath1_1sols.pdf), Eigenvalues and Eigenvectors (applmath1_5.pdf), The Stiffness Matrix (applmath2_1.pdf)
35. Strang, G.: Introduction to Applied Mathematics. Wellesley-Cambridge Press, Wellesley (1986)
36. Thaper, N., Guha, S., Indyk, P., Koudas, N.: Dynamic multidimensional histograms. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 428-439, 2002
37. Yao, Y., Gehrke, J.E.: Query processing in sensor networks. In: Proceedings of the First Biennial Conference on Innovative Data Systems Research (CIDR), 2003