A note on efficient aggregate queries in sensor networks
type: Item
instance of: scholarly article
title: A note on efficient aggregate queries in sensor networks
zbMATH Open document ID: 1118.68016
author: Boaz Patt-Shamir
published in: Theoretical Computer Science
publication date: 2007-02-26T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 5129795
zbMATH Keywords: sensor networks
zbMATH Keywords: communication complexity
zbMATH Keywords: median computation
zbMATH Keywords: aggregate queries
describes a project that uses: TAG
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.10.032
OpenAlex ID: W1967939903
cites work: The space complexity of approximating the frequency moments
cites work: Algorithms - ESA 2003
cites work: The Probabilistic Communication Complexity of Set Intersection
cites work: A result in order statistics related to probabilistic counting
cites work: Communication Complexity
cites work: A note on efficient aggregate queries in sensor networks
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Q4426360
DOI: 10.1016/J.TCS.2006.10.032
Recommended article: A note on efficient aggregate queries in sensor networks
Recommended article: Aggregate query processing in the presence of duplicates in wireless sensor networks
description: scientific article; zbMATH DE number 5129795