File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Operator placement for snapshot multi-predicate queries in wireless sensor networks

TitleOperator placement for snapshot multi-predicate queries in wireless sensor networks
Authors
Issue Date2009
Citation
The 10th International Conference on Mobile Data Management Systems: Systems, Services and Middleware (MDM 2009), Taipei, Taiwan, 18-20 May 2009, p. 21-30 How to Cite?
AbstractThis work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of networks where communicating data is very demanding in resources, for example in wireless sensor networks transmitting data drains the battery life of sensors involved. The important class of multi-predicate queries in horizontally or vertically distributed databases is addressed. We show that minimizing the communication cost for multi-predicate queries is NP-hard and we propose a dynamic programming algorithm to compute the optimal solution for small problem instances. We also propose a low complexity, approximate, heuristic algorithm for solving larger problem instances efficiently and running it on nodes with low computational power (e.g. sensors). Finally, we present a variant of the Fermat point problem where distances between points are minimal paths in a weighted graph, and propose a solution. An extensive experimental evaluation compares the proposed algorithms to the best known technique used to evaluate queries in wireless sensor networks and shows improvement of 10% up to 95%. The low complexity heuristic algorithm is also shown to be scalable and robust to different query characteristics and network size. © 2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/151954
ISBN
References

 

DC FieldValueLanguage
dc.contributor.authorChatzimilioudis, Gen_US
dc.contributor.authorHakkoymaz, Hen_US
dc.contributor.authorMamoulis, Nen_US
dc.contributor.authorGunopulos, Den_US
dc.date.accessioned2012-06-26T06:31:27Z-
dc.date.available2012-06-26T06:31:27Z-
dc.date.issued2009en_US
dc.identifier.citationThe 10th International Conference on Mobile Data Management Systems: Systems, Services and Middleware (MDM 2009), Taipei, Taiwan, 18-20 May 2009, p. 21-30en_US
dc.identifier.isbn9780769536507-
dc.identifier.urihttp://hdl.handle.net/10722/151954-
dc.description.abstractThis work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of networks where communicating data is very demanding in resources, for example in wireless sensor networks transmitting data drains the battery life of sensors involved. The important class of multi-predicate queries in horizontally or vertically distributed databases is addressed. We show that minimizing the communication cost for multi-predicate queries is NP-hard and we propose a dynamic programming algorithm to compute the optimal solution for small problem instances. We also propose a low complexity, approximate, heuristic algorithm for solving larger problem instances efficiently and running it on nodes with low computational power (e.g. sensors). Finally, we present a variant of the Fermat point problem where distances between points are minimal paths in a weighted graph, and propose a solution. An extensive experimental evaluation compares the proposed algorithms to the best known technique used to evaluate queries in wireless sensor networks and shows improvement of 10% up to 95%. The low complexity heuristic algorithm is also shown to be scalable and robust to different query characteristics and network size. © 2009 IEEE.en_US
dc.languageengen_US
dc.relation.ispartofI E E E International Conference on Mobile Data Management Proceedingsen_US
dc.rightsI E E E International Conference on Mobile Data Management Proceedings. Copyright © I E E E-
dc.rights©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleOperator placement for snapshot multi-predicate queries in wireless sensor networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_US
dc.identifier.authorityMamoulis, N=rp00155en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1109/MDM.2009.13en_US
dc.identifier.scopuseid_2-s2.0-70349496587en_US
dc.identifier.hkuros166359-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70349496587&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage21en_US
dc.identifier.epage30en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChatzimilioudis, G=35069312000en_US
dc.identifier.scopusauthoridHakkoymaz, H=35069579300en_US
dc.identifier.scopusauthoridMamoulis, N=6701782749en_US
dc.identifier.scopusauthoridGunopulos, D=6603923918en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats