Knygos.lt klubas Knygos.lt nariams
138,59 €
-30%
Įprastai
197,99 €
Evaluation of Spatio-Temporal Queries in Sensor Networks
Evaluation of Spatio-Temporal Queries in Sensor Networks
Knygos.lt klubas Knygos.lt nariams
138,59 €
-30%
Įprastai
197,99 €
  • Išsiųsime per 12–18 d.d.
Declarative query interfaces for Sensor Networks (SN) have become a commodity. These interfaces allow access to SN deployed for collecting data using relational queries. However, SN are not confined to data collection, but may track object movement, e.g., wildlife observation or traffic monitoring. While relational approaches are well suited for data collection, research on Moving Object Databases (MOD) has shown that relational operators are unsuitable to express queries on object movement, i.…

Evaluation of Spatio-Temporal Queries in Sensor Networks (el. knyga) (skaityta knyga) | knygos.lt

Atsiliepimai

Aprašymas

Declarative query interfaces for Sensor Networks (SN) have become a commodity. These interfaces allow access to SN deployed for collecting data using relational queries. However, SN are not confined to data collection, but may track object movement, e.g., wildlife observation or traffic monitoring. While relational approaches are well suited for data collection, research on Moving Object Databases (MOD) has shown that relational operators are unsuitable to express queries on object movement, i.e., spatio-temporal semantics. The properties of SN prevent a straightforward application of MOD, e.g., node failures, limited accuracy etc. Furthermore, MOD model entities like regions as point sets which presumes very accurate knowledge on the spatial extend of these entities. Such knowledge is unavailable in most SN. This dissertation is the first to address spatio-temporal queries in SN. It defines a complete set of spatio-temporal operators for SN while taking into account their properties and systematically shows how to derive query results from object detections. Finally, the dissertation presents a distributed, energy-efficient query processor for spatio-temporal queries in SN.

Knygos.lt klubas
Knygos.lt nariams
138,59 €
-30%
Įprastai
197,99 €
Kaina registruotiems pirkėjams
Prisijunkite ir už šią prekę
gausite 1,98 Knygų Eurų!?
Išsiųsime per 12–18 d.d.
Įsigykite dovanų kuponą
Daugiau

Declarative query interfaces for Sensor Networks (SN) have become a commodity. These interfaces allow access to SN deployed for collecting data using relational queries. However, SN are not confined to data collection, but may track object movement, e.g., wildlife observation or traffic monitoring. While relational approaches are well suited for data collection, research on Moving Object Databases (MOD) has shown that relational operators are unsuitable to express queries on object movement, i.e., spatio-temporal semantics. The properties of SN prevent a straightforward application of MOD, e.g., node failures, limited accuracy etc. Furthermore, MOD model entities like regions as point sets which presumes very accurate knowledge on the spatial extend of these entities. Such knowledge is unavailable in most SN. This dissertation is the first to address spatio-temporal queries in SN. It defines a complete set of spatio-temporal operators for SN while taking into account their properties and systematically shows how to derive query results from object detections. Finally, the dissertation presents a distributed, energy-efficient query processor for spatio-temporal queries in SN.

Atsiliepimai

  • Atsiliepimų nėra
0 pirkėjai įvertino šią prekę.
5
0%
4
0%
3
0%
2
0%
1
0%
(rodomas nebus)
[{"option":"222","probability":1,"style":{"backgroundColor":"#ffffff"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/6a3ba631ba76d1782294065.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"221","probability":1.3,"style":{"backgroundColor":"#e1032e"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/6a3ba61ea9f381782294046.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"220","probability":1.6,"style":{"backgroundColor":"#ffffff"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/6a3ba60167d251782294017.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"219","probability":1.5,"style":{"backgroundColor":"#e2022e"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/6a3ba5ea1c47d1782293994.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"218","probability":1.5,"style":{"backgroundColor":"#ffffff"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/6a3ba5d38b4a21782293971.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"217","probability":1.6,"style":{"backgroundColor":"#e3022e"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/6a3ba5b981b7a1782293945.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"216","probability":1.4,"style":{"backgroundColor":"#ffffff"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/6a3ba58b535551782293899.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}},{"option":"215","probability":0.1,"style":{"backgroundColor":"#ffe01a"},"image":{"uri":"\/uploads\/images\/wheel_of_fortune\/6a3ba53a6496f1782293818.png","sizeMultiplier":0.6,"landscape":true,"offsetX":-50}}]