Skip to main content

An Energy Efficient Filtering Approach to In-Network Join Processing in Sensor Network Databases

  • Conference paper
Multimedia, Computer Graphics and Broadcasting (MulGraB 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 263))

Abstract

In processing join queries in a sensor network it is important to minimize communication cost, which is the main consumer of battery power, among sensor nodes. Shipping only relevant data involved in join result to the sensor nodes that is responsible for the final join means reduction in the size of data transmitted and hence lowers battery consumption. In this paper, we present algorithm SBJ which uses bloom filter and algorithm RFB which uses bit vector to filter unnecessary data during join processing in a sensor database. We compare our algorithms with the existing synopsis join (SNJ) algorithm in terms of the communication cost associated with processing BEJ (Binary Equi-Join) queries. The query performance results show that both the SBJ and the RFB algorithms outperform the SNJ algorithm. In addition, the RFB algorithm generally performs better than the SBJ algorithm.

This work was supported by 2010 Hongik University Research Fund.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abadi, D.J., Madden, S., Lindner, W.: REED: robust, efficient filtering and event detection in sensor networks. In: Proceedings of the VLDB (2005)

    Google Scholar 

  2. Bonfils, B.J., Bonnet, P.: Adaptive and Decentralized Operator Placement for in-Network Query Processing. In: Zhao, F., Guibas, L.J. (eds.) IPSN 2003. LNCS, vol. 2634, pp. 47–62. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Pandit, A., Gupta, H.: Communication-Efficient Implementation of Range-Joins in Sensor Networks. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 859–869. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Coman, A., Nascimento, M., Sander, J.: On join location in sensor networks. In: Proceedings of MDM (2007)

    Google Scholar 

  5. Madden, S.: The Design and Evaluation of a Query Processing Architecture for Sensor Networks. Ph.D. Thesis, UC Berkeley (2003)

    Google Scholar 

  6. Yao, Y., Gehrke, J.: Query processing for sensor networks. In: Proceedings of CIDR (2003)

    Google Scholar 

  7. Yu, H., Lim, E., Zhang, J.: On In-network Synopsis Join Processing for Sensor Networks. In: Proceedings of MDM (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, KC., Oh, BJ. (2011). An Energy Efficient Filtering Approach to In-Network Join Processing in Sensor Network Databases. In: Kim, Th., et al. Multimedia, Computer Graphics and Broadcasting. MulGraB 2011. Communications in Computer and Information Science, vol 263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27186-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27186-1_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27185-4

  • Online ISBN: 978-3-642-27186-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics