Skip to main content

An Approximation Algorithm for Optimizing Multiple Path Tracking Queries over Sensor Data Streams

  • Conference paper
Database and Expert Systems Applications (DEXA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5690))

Included in the following conference series:

  • 933 Accesses

Abstract

Sensor networks have received considerable attention in recent years and played an important role in data collection applications. Sensor nodes have limited supply of energy. Therefore, one of the major design considerations for sensor applications is to reduce the power consumption. In this paper, we study an application that combines RFID and sensor network technologies to provide an environment for moving object path tracking, which needs efficient join processing. This paper considers multi-query optimization to reduce query evaluation cost, and therefore power consumption. We formulate the multi-query optimization problem and present a novel approximation algorithm which provides solutions with suboptimal guarantees. In addition, extensive experiments are made to demonstrate the performance of the proposed optimization strategy.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Viglas, S., Naughton, J.F., Burger, J.: Maximizing the output rate of multi-way join queries over streaming information sources. In: Proc. of the Intl. Conf. on Very Large Data Bases, pp. 285–296 (2003)

    Google Scholar 

  2. Babu, S., et al.: Adaptive ordering of pipeline stream filters. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 407–418 (2004)

    Google Scholar 

  3. Balas, E., Padberg, M.: Set partition: a survey. SIAM review (18), 710–760 (1976)

    Google Scholar 

  4. Han, J., Kamber, M.: Data Mining Concepts and Techniques. Morgan Kaufmann, San Francisco (2001)

    MATH  Google Scholar 

  5. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge Press (1995)

    Google Scholar 

  6. Levis, P., Gay, D.: Maté: a tiny virtual machine for sensor networks. In: Proc. of Intl. Conf. on Architectural Support for Programming Languages and Operating Systems, pp. 85–95 (2002)

    Google Scholar 

  7. Hammad, M.A., et al.: Scheduling for shared window joins over data streams. In: Proc. of the Intl. Conf. on Very Large Data Bases, pp. 297–308 (2003)

    Google Scholar 

  8. Cranor, C.D., et al.: Gigascope: a stream database for network application. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 647–651 (2003)

    Google Scholar 

  9. Srivastava, D., et al.: Multiple aggregations over data streams. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 299–310 (2005)

    Google Scholar 

  10. Chandrasekaran, S., Franklin, M.J.: Streaming Queries over Streaming Data. In: Proc. of the Intl. Conf. on Very Large Data Bases, pp. 203–214 (2002)

    Google Scholar 

  11. Madden, S., et al.: Continuously Adaptive Continuous Queries over Streams. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 49–60 (2002)

    Google Scholar 

  12. Krishnamurthy, S., et al.: On-the-fly sharing for streamed aggregation. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 623–634 (2006)

    Google Scholar 

  13. Huebsch, R., et al.: Sharing aggregate computation for distributed queries. In: Proc. of the Intl. Conf. on Very Large Data Bases (2007)

    Google Scholar 

  14. Yao, Y., Gehrke, J.: Query processing in sensor networks. In: Proc. of Intl. Conf. on Innovative Data Systems Research (2003)

    Google Scholar 

  15. Madden, S., et al.: TAG: a tiny aggregation service for ad-hoc sensor networks. In: Proc. of Annual Symps. on Operating System Design and Implementation, pp. 131–146 (2002)

    Google Scholar 

  16. Madden, S., et al.: TinyDB: an acquisitional query processing system for sensor networks. ACM Trans. on Database Systems 30(1), 122–173 (2005)

    Article  Google Scholar 

  17. Trigoni, N., et al.: Multi-query optimization for sensor networks. In: Proc. of Intl. Conf. on Distributed Computing in Sensor Systems, pp. 301–321 (2005)

    Google Scholar 

  18. Müller, R., Alonso, G.: Efficient sharing of sensor networks. In: Proc. of Intl. Conf. on Mobile Ad-hoc and Sensor Systems, pp. 101–118 (2005)

    Google Scholar 

  19. Xian, S., et al.: Two-Tier Multiple query optimization for sensor networks. In: Proc. of the IEEE Intl. Conf. Distributed Computing System, pp. 39–47 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fan, YC., Chen, A.L.P. (2009). An Approximation Algorithm for Optimizing Multiple Path Tracking Queries over Sensor Data Streams. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2009. Lecture Notes in Computer Science, vol 5690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03573-9_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03573-9_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03572-2

  • Online ISBN: 978-3-642-03573-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics