Spatially-decaying aggregation over a network

DOI10.1016/j.jcss.2006.10.016zbMath1115.68016OpenAlexW2126356486MaRDI QIDQ878748

Edith Cohen, Haim Kaplan

Publication date: 26 April 2007

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2006.10.016

zbMATH Keywords

decay functionssliding windowsapproximate query processingspatially-decaying aggregation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Algorithms and estimators for summarization of unaggregated data streams, Efficient distributed approximation algorithms via probabilistic tree embeddings, Axioms for Centrality

Uses Software

• TAG

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic counting algorithms for data base applications
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Structure prediction and computation of sparse matrix products
• Size-estimation framework with applications to transitive closure and reachability
• Min-wise independent permutations
• A Small Approximately Min-Wise Independent Family of Hash Functions
• Maintaining Stream Statistics over Sliding Windows
• Spatial gossip and resource location protocols
• Fibonacci heaps and their uses in improved network optimization algorithms
• Maintaining time-decaying stream aggregates