完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYang, Huei-Youen_US
dc.contributor.authorPeng, Wen-Chihen_US
dc.contributor.authorLo, Chia-Haoen_US
dc.date.accessioned2014-12-08T15:10:52Z-
dc.date.available2014-12-08T15:10:52Z-
dc.date.issued2007en_US
dc.identifier.isbn978-3-540-71702-7en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/11536/8312-
dc.description.abstractIn this paper, we explore the feature of sharing partial results of multiple queries to reduce the total number of messages incurred. Those queries sharing their partial results are referred to as backbones. Given a set of queries, we shall determine backbones with the purpose of minimizing the total number of messages. Specifically, given a set of queries, we derive a graph, where each vertex represents one query and the corresponding weight edge denotes the number of messages reduced by sharing partial results. Then, we develop a heuristic algorithm SB (standing for Selecting Backbones) to derive a cut in which both backbones and non-backbones are determined. Simulation results show that by sharing partial results, algorithm SB is able to significantly reduce the total number of messages involved.en_US
dc.language.isoen_USen_US
dc.titleOptimizing multiple in-network aggregate queries in wireless sensor networksen_US
dc.typeProceedings Paperen_US
dc.identifier.journalAdvances in Databases: Concepts, Systems and Applicationsen_US
dc.citation.volume4443en_US
dc.citation.spage870en_US
dc.citation.epage875en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000246173300072-
顯示於類別:會議論文