Abstract
There is a huge increase in IoT network size and applications. It has increased the amount of the IoT data that needs to be handled by the applications. State-of-the art workload based static partitioning methods scale poorly and often result in poor execution times as not all the queries are favoured by initial partition created. This work proposes an adaptive partitioning method that adapts the system to workload changes by reproducing the most frequent pattern among nodes. The scheme also adapts when new triples or properties are added into a system by ensuring proper placement of new triples in an appropriate partition by leveraging subject-object joins. The performance of this adaptive partitioning method is evaluated against the existing static partitioning scheme. The performance of the system for different query types such as linear, star, administrative and snowflakes are analysed. The experimental results verify that the adaptive partitioning method is scalable, adjusts to categories of dynamism and results in faster query execution by minimizing inter-node communication. Although Algorithm Execution Time (AET) for adaptive partitioning is greater than static partitioning, Query Execution Time (QET) increases at much faster rate for static partitioning for scaled data. Adaptive partitioning accelerates queries by 60% compared to static partitioning when averaged over types of queries.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Lee, T.B., Hendler, J., Lassila, O.: The semantic web. In: Scientific American, pp. 1–4 (2001)
Abadi, D.J., Marcus, A., Madden, S.R., Hollenbach, K.: Scalable semantic web data management using vertical partitioning. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 411–422 (2007)
Levandoski, J.J., Mokbel, M.F.: RDF data-centric storage. In: IEEE International Conference on Web Services, ICWS 2009, Los Angeles, CA, USA, pp. 911–918 (2009)
Padiya, T., Bhise, M., Rajkotiya, P.: Data management for Internet of Things. In: IEEE Region 10 Symposium, pp. 62–65 (2015)
Padiya, T., Bhise, M.: DWAHP: workload aware hybrid partitioning and distribution of RDF data. In: IDEAS, pp. 235–241 (2017)
Al-Harbi, R.: Adaptive partitioning for very large RDF data. arxiv: 1505.02728 [cs.DB] (2015)
Lee, K., Liu, L.: Scaling queries over big RDF graphs with semantic hash partitioning. Proc. VLDB Endow. 6, 1894–1905 (2013)
LinkedSensorData. http://wiki.knoesis.org/index.php/LinkedSensorData
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kalavadia, B., Bhatia, T., Padiya, T., Pandat, A., Bhise, M. (2019). Adaptive Partitioning Using Partial Replication for Sensor Data. In: Fahrnberger, G., Gopinathan, S., Parida, L. (eds) Distributed Computing and Internet Technology. ICDCIT 2019. Lecture Notes in Computer Science(), vol 11319. Springer, Cham. https://doi.org/10.1007/978-3-030-05366-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-05366-6_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05365-9
Online ISBN: 978-3-030-05366-6
eBook Packages: Computer ScienceComputer Science (R0)