Approximate aggregation techniques for sensor databases

Proceedings - International Conference on Data Engineering

Volumn 20, Issue , 2004, Pages 449-460

  Considine, Jeffrey ^a   Li, Feifei ^a   Kollios, George ^a   Byers, John ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATE QUERIES; MULTIPATH ROUTING; PACKET LOSSES; SENSOR DATABASES;

BANDWIDTH; COMPUTATION THEORY; COMPUTER NETWORKS; QUERY LANGUAGES; SENSORS; SIGNAL TO NOISE RATIO; TELECOMMUNICATION TRAFFIC;

DATABASE SYSTEMS;

EID: 2442576849     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2004.1320018     Document Type: Conference Paper

References (23)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
2. Z. Bar-Yossef, T.S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In Proc. of RANDOM, 2002.
3. G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan. Comparing data streams using hamming norms (how to zero in). In VLDB, 2002.
4. L. Devroye. Generating the maximum of independent identically distributed random variables. Computers and Mathematics with Applications, 6:305-315, 1980.
5. M. Durand and P. Flajolet. Loglog counting of large cardinalities. In ESA, 2003.
6. P. Flajolet. On adaptive sampling. COMPUTG: Computing, 43, 1990.
7. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31, 1985.
8. D. Ganesan, R. Govindan, S. Shenker, and D. Estrin. Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks. ACM Mobile Computing and Communications Review, 5(4), 2001.
9. S. Ganguly, M. Garofalakis, and R. Rastogi. Processing set expressions over continuous update streams. In ACM SIGMOD, 2003.
10. P.B. Gibbons and S. Tirthapura. Estimating simple functions on the union of data streams. In ACM Symposium on Parallel Algorithms and Architectures, pages 281-291, 2001.
11. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals. Data Mining and Knowledge Discovery,1(1):29-53, 1997.
12. M. Horton, D. Culler, K. Pister, J. Hill, R. Szewczyk, and A. Woo. Mica, the commercialization of microsensor motes. 19(4):40-48, April 2002.
13. C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In MobiCOM, 2000.
14. V. Kachitvichyanukul and B.W. Schmeiser. Binomial random variate generation. Communications of the ACM, 31(2):216-222, 1988.
15. S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong. TAG: a Tiny AGgregation Service for Ad-Hoc Sensor Networks. In OSDI, 2002.
16. S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong. The design of an acquisitional query processor for sensor networks. In ACM SIGMOD, 2003.
17. S. Nath and P.B. Gibbons. Synopsis Diffusion for Robust Aggregation in Sensor Networks. Technical Report ITR-03-08, Intel Research Pittsburgh, August 2003.
18. C. Palmer, P. Gibbons, and C. Faloutsos. ANF: A Fast and Scalable Tool for Data Mining in Massive Graphs. In SIGKDD, 2002.
19. A.J. Walker. An efficient method for generating discrete random variables with general distributions. ACM Transactions on Mathematical Software (TOMS), 3(3): 253-256, 1977.
20. Y. Yao and J. Gehrke. The cougar approach to in-network query processing in sensor networks. SIGMOD Record 31 (3), 2002.
21. Y. Yao and J. Gehrke. Query processing in sensor networks. In CIDR, 2003.
22. F. Ye, G. Zhong, S. Lu, and L. Zhang. GRAdient Broadcast: A Robust Data Delivery Protocol for Large Scale Sensor Networks. ACM Wireless Networks (WINET), 11(2), 2005.
23. J. Zhao, R. Govindan, and D. Estrin. Computing aggregates for monitoring wireless sensor networks. In SNPA, 2003.