File(s) under permanent embargo
Approximate query answering in sensor networks with hierarchically distributed caching
conference contribution
posted on 2006-11-22, 00:00 authored by L Ying, M V Ramakrishna, Seng LokeSeng LokeWe are addressing the problem of query processing in large sensor networks. Each sensor produces a large amount of streaming data and it may not be possible to store all the data. By caching some of the data in aggregated format, we will be able to answer queries referring to past data. We are investigating a hierarchical caching model where summarized data is cached. The granularity of aggregation becomes coarser as we move up the levels, starting from the actual data of the immediate past stored at the lowest level. We categorize queries into two types: queries that can be answered exactly and those that can be answered approximately. We have provided an analysis of the conditions under which the exact and approximate answers can be provided for a given query. When the query answer is approximate, an estimation of the error is provided.
History
Event
AINA'06 Advanced Information Networking and Applications - Volume 1. Internatoinal Conference (20th : 2006 : Vienna, Austria)Volume
2Pagination
281 - 285Publisher
Institute of Electrical and Electronics Engineers (IEEE)Location
Vienna, AustriaPlace of publication
Piscataway, N.J.Publisher DOI
Start date
2006-04-18End date
2006-04-20ISSN
1550-445XISBN-13
9780769524665ISBN-10
0769524664Language
engPublication classification
E1.1 Full written paper - refereedCopyright notice
2006, IEEETitle of proceedings
AINA'06 : Proceedings of the 20th International Conference on Advanced Information Networking and ApplicationsUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC