Spatially-decaying aggregation over a network

Journal of Computer and System Sciences

Volumn 73, Issue 3, 2007, Pages 265-288

  Cohen, Edith ^a   Kaplan, Haim ^b  

^a AT AND T LABS RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximate query processing; Decay functions; Sliding windows; Spatially decaying aggregation

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; DATA ACQUISITION; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED DATABASE SYSTEMS; PARAMETER ESTIMATION; QUERY LANGUAGES; SENSOR DATA FUSION;

APPROXIMATE QUERY PROCESSING; DECAY FUNCTIONS; PARKING SPOT AVAILABILITY; PEER TO PEER COMPUTER SYSTEMS; SENSOR NODES; SLIDING WINDOWS;

COMPUTER NETWORKS;

EID: 33845863420     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2006.10.016     Document Type: Article

References (38)

1. Awerbuch B. Distributed shortest paths algorithms. Proc. 21st Annual ACM Symposium on Theory of Computing (1989), ACM 490-500
2. Babcock B., Babu S., Datar M., Motwani R., and Widom J. Models and issues in data stream systems. Proc. of the 2002 ACM Symp. on Principles of Database Systems, PODS 2002 (2002), ACM
3. Bar-Yossef Z., Jayram T.S., Kumar R., Sivakumar D., and Trevisan L. Counting distinct elements in a data stream. RANDOM (2002), ACM
4. Broder A.Z., Charikar M., Frieze A.M., and Mitzenmacher M. Min-wise independent permutations. J. Comput. System Sci. 60 3 (2000) 630-659
5. Terrestrial air temperature and precipitation: Monthly and annual climatologies. version 3.02 (2001). http://climate.udel.edu/~climate
6. Cohen E. Size-estimation framework with applications to transitive closure and reachability. J. Comput. System Sci. 55 (1997) 441-453
7. Cohen E. Structure prediction and computation of sparse matrix products. J. Combin. Optim. 2 (1999) 307-332
8. Cohen E., and Kaplan H. Efficient estimation algorithms for neighborhood variance and other moments. Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (2004), ACM-SIAM
9. Cohen E., and Strauss M. Maintaining time-decaying stream aggregates. Proc. of the 2003 ACM Symp. on Principles of Database Systems, PODS 2003 (2003), ACM
10. Open Source Community, Gnutella, in (2001). http://gnutella.wego.com/
11. A. Crespo, H. Garcia-Molina, Routing indices for peer-to-peer systems, in: ICDE, 2002
12. Datar M., Gionis A., Indyk P., and Motwani R. Maintaining stream statistics over sliding windows. SIAM J. Comput. 31 6 (2002) 1794-1813
13. A. Deshpande, P. Gibbons, S. Nath, S. Seshan, Cache-and-query for wide area sensor databases, in: Proceedings of the ACM SIGMOD, 2003
14. D. Estrin, L. Girod, G. Pottie, M. Srivastava, Instrumenting the world with wireless sensor networks. in: Proc. International Conference on Acoustics, Speech, and Signal Processing, ICASSP, 2001
15. Feigenbaum J., Kannan S., Strauss M., and Viswanathan M. An approximate L1-difference algorithm for massive data streams. Proc. 39th IEEE Annual Symposium on Foundations of Computer Science (1999), IEEE 501-511
16. Flajolet P., and Martin G.N. Probabilistic counting algorithms for data base applications. J. Comput. System Sci. 31 (1985) 182-209
17. Floyd S., and Jacobson V. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Network. 1 4 (1993)
18. Fredman M., and Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34 3 (1987) 596-615
19. S. Ganeriwal, C.C. Han, M.B. Srivastava, Spatial average of a continuous physical process in sensor networks (poster), in: Proceedings of the 1st ACM Conference on Embedded Networked Sensor Systems, Sensys, 2003
20. D. Ganesan, S. Ratnasamy, H. Wang, D. Estrin, Coping with irregular spatio-temporal sampling in sensor networks, in: Proceedings of the ACM SIGCOMM HOTNETS-II Workshop, 2003
21. Gibbons P., and Tirthapura S. Estimating simple functions on the union of data streams. Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (2001), ACM-SIGMOD
22. Gibbons P.B., and Tirthapura S. Distributed streams algorithms for sliding windows. Proc. of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures (2002), ACM 63-72
23. M. Greenwald, S. Khanna, Space-efficient online computation of quantile summaries, in: Proceedings of the ACM SIGMOD, 2001
24. Guibas L.J., Knuth D.E., and Sharir M. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica 7 (1992) 381-413
25. Indyk P. A small approximately min-wise independent family of hash functions. Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (1999), ACM-SIAM
26. Indyk P. Stable distributions, pseudorandom generators, embeddings and data stream computation. Proc. 41st IEEE Annual Symposium on Foundations of Computer Science (2001), IEEE 189-197
27. V. Jacobson, Congestion avoidance and control, in: Proceedings of the ACM SIGCOMM '88 Conference, August 1988
28. Kleinberg J., and Kempe D. Protocols and impossibility results for gossip-based communication mechanisms. Proc. 43rd IEEE Annual Symposium on Foundations of Computer Science (2002), IEEE 471-480
29. Kleinberg J., Kempe D., and Demers A.J. Spatial gossip and resource location protocols. Proc. 33rd Annual ACM Symposium on Theory of Computing (2001), ACM 163-172
30. Korn F., and Muthukrishnan S. Influence sets based on reverse nearest neighbors. Proc. of the 2000 ACM SIGMOD Conference on Management of Data (2000), ACM 201-212
31. Korn F., Muthukrishnan S., and Srivastava D. Reverse nearest neighbor aggregates over data streams. Proc. of the 28th International Conference on Very Large Databases, VLDB 2002 (2002), ACM
32. Lin X., Lu H., Xu J., and Yu J.X. Continously maintaining quantile summaries of the most recent n elements over a data stream. Proceedings of the 20th International Conference on Data Engineering, ICDE (2004), IEEE
33. Madden S., Franklin M., Hellerstein J., and Hong W. Tag: A tiny aggregation service for ad-hoc sensor networks. Proceedings of the 5th USENIX Symposium on Operating Systems Design and Implementation, ODSI (2002), USENIX Association
34. A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, J. Anderson, Wireless sensor networks for habitat monitoring, in: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, 2002
35. Manku G.S., and Motwani R. Approximate frequency counts over data streams. Proc. of the 28th International Conference on Very Large Databases, VLDB 2002 (2002), ACM 346-357
36. Manku G.S., Rajagopalan S., and Lindsay B.G. Approximate medians and other quantiles in one pass and with limited memory. Proc. of the 1998 ACM SIGMOD Conference on Management of Data (1998), ACM 426-435
37. M.R. Paterson, Progress in selection, Dept. of Computer Science, University of Warwick, Coventry, UK, 1997
38. J. Zhao, R. Govindan, D. Estrin, Computing aggregates for monitoring wireless sensor networks, in: Proc. of First IEEE International Workshop on Sensor Network Protocols and Applications, 2003