Robust approximate aggregation in sensor data management systems

ACM Transactions on Database Systems

Volumn 34, Issue 1, 2009, Pages

  Considine, Jeffrey ^a   Hadjieleftheriou, Marios ^b,c   Li, Feifei ^a   Byers, John ^a   Kollios, George ^a  

^a BOSTON UNIVERSITY   (United States)

^b ATandT Labs   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

Aggregation; Approximation algorithms; Sensor databases; Sketches; Synopses

Indexed keywords

AGGREGATION; AGGREGATION QUERIES; AGGREGATION STRATEGY; DATA COLLECTION; DATA MANAGEMENT PROBLEMS; ENERGY LIMITATIONS; EXPERIMENTAL EVALUATION; FAULT-TOLERANT; FAULT-TOLERANT METHOD; FREQUENCY COUNTING; HARDWARE SUPPORTS; IN-NETWORK AGGREGATION; MULTI PATH ROUTING; NETWORK TRAFFIC; QUANTILE ESTIMATION; SENSOR BASED SYSTEMS; SENSOR DATA MANAGEMENT; SENSOR DATABASES; SENSOR DEVICE; SKETCHES; SYNOPSES;

DATA ACQUISITION; DATABASE SYSTEMS; FREQUENCY ESTIMATION; INTERNET; MAXIMUM LIKELIHOOD ESTIMATION; SENSOR NETWORKS; SENSORS;

APPROXIMATION ALGORITHMS;

EID: 67649233397     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1508857.1508863     Document Type: Article

References (48)

1. ADURI, P. AND TIRTHAPURA, S. 2005. Range efficient computation off 0 over massive data streams. In Proceedings of the International Conference on Data Engineering (ICDE'05), 32-43.
2. ALON, N., MATIAS, Y., AND SZEGEDY, M. 1996. The space complexity of approximating the frequency moments. In Proceedings of the ACM Symposium on Theory of Computing (STOC'96), 20-29.
3. BAR-YOSSEF, Z., JAYRAM, T. S., KUMAR, R., SIVAKUMAR, D., AND TREVISAN, L. 2002. Counting distinct elements in a data stream. In Proceedings of the International Workshop on Randomization and Approximation Techniques (RANDOM'02), 1-10.
4. BAWA, M., GARCIA-MOLINA, H., GIONIS, A., AND MOTWANI, R. 2003. Estimating aggregates on a peer-to-peer network. Tech. rep., Stanford University.
5. CHAKRABARTI, D., LESKOVEC, J., FALOUTSOS, C., MADDEN, S., GUESTRIN, C., AND FALOUTSOS, M. 2007. Information survival threshold in sensor and p2p networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'07), 1316-1324.
6. CONSIDINE, J., LI, F., KOLLIOS, G., AND BYERS, J. 2004. Approximate aggregation techniques for sensor databases. In Proceedings of the International Conference on Data Engineering (ICDE'04), 449-461.
7. CORMODE, G., DATAR, M., INDYK, P., AND MUTHUKRISHNAN, S. 2003. Comparing data streams using hamming norms (how to zero in). IEEE Trans. Knowl. Data Eng. 15, 3, 529-540.
8. CORMODE, G. AND MUTHUKRISHNAN, S. 2005a. An improved data stream summary: The count-min sketch and its applications. J. Algor. 55, 1, 58-75.
9. CORMODE, G. AND MUTHUKRISHNAN, S. 2005b. Space efficient mining of multigraph streams. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS'05), 271-282.
10. DELIGIANNAKIS, A., KOTIDIS, Y., AND ROUSSOPOULOS, N. 2004a. Compressing historical information in sensor networks. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 527-538.
11. DELIGIANNAKIS, A., KOTIDIS, Y., AND ROUSSOPOULOS, N. 2004b. Hierarchical in-network data aggregation with quality guarantees. In Proceedings of the International Conference on Extending Database Technology (EDBT'04), 658-675.
12. DELIGIANNAKIS, A., KOTIDIS, Y., AND ROUSSOPOULOS, N. 2007. Bandwidth-Constrained queries in sensor networks. The VLDB J. 16,3.
13. DESHPANDE, A., GUESTRIN, C., MADDEN, S., HELLERSTEIN, J., AND HONG, W. 2004. Model-Driven data acquisition in sensor networks. In Proceedings of the International Conference on Very Large Data Bases (VLDB'04), 588-599.
14. DESHPANDE, A. AND MADDEN, S. 2006. Mauvedb: Supporting model-based user views in database systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 73-84.
15. DEVROYE, L. 1986. Non-Uniform Random Variate Generation. Springer.
16. DURAND, M. AND FLAJOLET, P. 2003. Loglog counting of large cardinalities. In Proceedings of the European Symposium on Algorithms (ESA'03), 605-617.
17. FLAJOLET, P. 1990. On adaptive sampling. COMPUTG: Comput. 43.
18. FLAJOLET, P. AND MARTIN, G. N. 1985. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31, 2, 182-209.
19. FLOYD, R. W. AND RIVEST, R. L. 1975. Expected time bounds for selection. Commun. ACM 18, 3, 165-172.
20. GANESAN, D., GOVINDAN, R., SHENKER, S., AND ESTRIN, D. 2001. Highly-Resilient, energy-efficient multipath routing in wireless sensor networks. ACM Mobile Comput. Commun. Rev. 5, 4, 11-25.
21. GANGULY, S., GAROFALAKIS, M., AND RASTOGI, R. 2003. Processing set expressions over continuous update streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 265-276.
22. GAROFALAKIS, M., HELLERSTEIN, J. M., AND MANIATIS, P. 2007. Proof sketches: Verifiable in- network aggregation. In Proceedings of the International Conference on Data Engineering (ICDE'07), 996-1005.
23. GIBBONS, P. AND TIRTHAPURA, S. 2001. Estimating simple functions on the union of data streams. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 281-291.
24. GRAY, J., CHAUDHURI, S., BOSWORTH, A., LAYMAN, A., REICHART, D., VENKATRAO, M., PELLOW, F., AND PIRAHESH, H. 1997. Data cube: A relational aggregation operator generalizing group-by, crosstab, and sub-totals. Data Mining Knowl. Discov. 1, 1, 29-53.
25. GREENWALD, M. AND KHANNA, S. 2004. Power-Conserving computation of order-statistics over sensor networks. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS'04), 275-285.
26. HORTON, M., CULLER, D., PISTER, K., HILL, J., SZEWCZYK, R., AND WOO, A. 2002. Mica, the commercialization of microsensor motes. IEEE Sensors J. 19, 4, 40-48.
27. Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., and Silva, F. 2003. Directed diffusion for wireless sensor networking. IEEE / ACM Trans. Netw. 11, 1, 2-16.
28. KAMRA, A., MISRA, V., AND RUBENSTEIN, D. 2007. Counttorrent: Ubiquitous access to query aggregates in dynamic and mobile sensor networks. In Proceedings of the SIGOPS International Conference on Embedded Networked Sensor Systems (SenSys'07), 43-57.
29. KEMPE, D., DOBRA, A., AND GEHRKE, J. 2003. Gossip-Based computation of aggregate information. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS'03), 482.
30. KOTIDIS, Y. 2005. Snapshot queries: Towards data-centric sensor networks. In Proceedings of the International Conference on Data Engineering (ICDE'05), 131-142.
31. MADDEN, S., FRANKLIN, M. J., HELLERSTEIN, J. M., AND HONG, W. 2002. Tag: A tiny aggregation service for ad-hoc sensor networks. ACM SIGOPS Oper. Syst. Rev. 36, SI, 131-146.
32. MADDEN, S., FRANKLIN, M. J., HELLERSTEIN, J. M., AND HONG, W. 2003. The design of an acquisitional query processor for sensor networks. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 491-502.
33. MADDEN, S., FRANKLIN, M. J., HELLERSTEIN, J. M., AND HONG, W. 2005. Tinydb: An acquisitional query processing system for sensor networks. ACM Trans. Database Syst. 30, 1, 122-173.
34. MANJHI, A., NATH, S., AND GIBBONS, P. B. 2005. Tributaries and deltas: Efficient and robust aggregation in sensor network streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 287-298.
35. MUNRO, J. I. AND PATERSON, M. 1980. Selection and sorting with limited storage. Theor. Comput. Sci. 12, 315-323.
36. NATH, S., GIBBONS, P. B., SESHAN, S., AND ANDERSON, Z. R. 2004. Synopsis diffusion for robust aggregation in sensor networks. In Proceedings of the International Conference on Embedded Networked Sensor Systems (SenSys'04), 250-262.
37. PALMER, C. R., GIBBONS, P. B., AND FALOUTSOS, C. 2002. ANF: A fast and scalable tool for data mining in massive graphs. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 81-90.
38. PAPOULIS, A. 1965. Probability, Random Variables, and Stochastic Processes. McGraw-Hill, New York.
39. PRZYDATEK, B., SONG, D., AND PERRIG, A. 2003. SIA: Secure information aggregation in sensor networks. In Proceedings of the SIGOPS International Conference on Embedded Networked Sensor Systems (SenSys'03), 255-265.
40. SHARAF, A., BEAVER, J., LABRINIDIS, A., AND CHRYSANTHIS, K. 2004. Balancing energy efficiency and quality of aggregate data in sensor networks. The VLDB J. 13, 4, 384-403.
41. SHRIVASTAVA, N., BURAGOHAIN, C., AGRAWAL, D., AND SURI, S. 2004. Medians and beyond: new aggregation techniques for sensor networks. In Proceedings of the SIGOPS International Conference on Embedded Networked Sensor Systems (SenSys'04), 239-249.
42. STOEV, S., HADJIELEFTHERIOU, M., KOLLIOS, G., AND TAQQU, M. S. 2007. Norm, point, and distance estimation over multiple signals using max-stable distributions. In Proceedings of the International Conference on Data Engineering (ICDE'07), 1006-1015.
43. U.S. CENSUS BUREAU. 2009. TIGER/Line datasets. http://www.census.gov/geo/www/tiger/.
44. WALKER, A. 1977. An efficient method for generating discrete random variables with general distributions. ACM Trans. Math. Softw. 3, 3, 253-256.
45. YAO, Y. AND GEHRKE, J. 2002. The cougar approach to in-network query processing in sensor networks. SIGMOD Rec. 31, 3, 9-18.
46. YAO, Y. AND GEHRKE, J. 2003. Query processing in sensor networks. In Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR'03).
47. YE, F., ZHONG, G., LU, S., AND ZHANG, L. 2005. Gradient broadcast: A robust data delivery protocol for large scale sensor networks. ACM Wireless Netw. 11, 3, 285-298.
48. ZHAO, J., GOVINDAN, R., AND ESTRIN, D. 2003. Computing aggregates for monitoring wireless sensor networks. In Proceedings of the IEEE International Workshop on Sensor Network Protocols and Applications (SNPA'03), 139-148.