IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i10p345672.html
   My bibliography  Save this article

An Efficient Processing of Join Queries for Sensor Networks Using Column-Oriented Databases

Author

Listed:
  • Kyung-Chang Kim

    (Department of Computer Engineering, Hongik University, Seoul 121-791, Republic of Korea)

Abstract

Recently, the sensor network area is gaining attention both in the industry and academia. Many applications of sensor network such as vehicle tracking and environmental monitoring require joining sensor data scattered over the network. The main performance criterion for queries in a sensor network is to minimize the battery power consumption in each sensor node. Hence, reducing the communication cost of shipping data among sensor nodes is important since it is the main consumer of battery power. In this paper, we propose a technique for join queries in a sensor network that minimizes communication cost. For storage of sensor data, we use a column-oriented database that stores data on disk (or in memory) column-by-column unlike traditional database that store data in rows. The justification for using a column-oriented database technique is not to ship those data columns that do not participate in the actual join. We compare our algorithm with existing join algorithms for sensor networks that are based on traditional row-oriented databases. The performance analysis show that our proposed algorithm based on column-oriented databases outperforms existing algorithms in processing binary equi-join (BEJ) queries for sensor networks.

Suggested Citation

  • Kyung-Chang Kim, 2013. "An Efficient Processing of Join Queries for Sensor Networks Using Column-Oriented Databases," International Journal of Distributed Sensor Networks, , vol. 9(10), pages 345672-3456, October.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:10:p:345672
    DOI: 10.1155/2013/345672
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/345672
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/345672?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:10:p:345672. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.