簡易檢索 / 詳目顯示

研究生: 李承翰
Cheng-Han Li
論文名稱: Management Scheme of Real-time Multi-version Sensor Data for Flash-based Embedded Database Systems
Management Scheme of Real-time Multi-version Sensor Data for Flash-based Embedded Database Systems
指導教授: 謝仁偉
Jen-Wei Hsieh
口試委員: 黃元欣
Yuan-Shin Hwang
蔣宗哲
Tsung-Che Chiang
學位類別: 碩士
Master
系所名稱: 電資學院 - 資訊工程系
Department of Computer Science and Information Engineering
論文出版年: 2013
畢業學年度: 101
語文別: 英文
論文頁數: 46
中文關鍵詞: Real time systemEmbedded systemDatabase systemSensor networkFlash memory
外文關鍵詞: Real time system, Embedded system, Database system, Sensor network, Flash memory
相關次數: 點閱:321下載:5
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

We propose a novel scheme that using multi-version structure to store the sensor data that need not only the latest version of data but also keep track of the old data in the flash memory. For sensor devices, it is important to preserve old version of sensor data for further queries. In our scheme, each sensor has different period and phase. We can query the historical data directly by a series of equations without using index structures to improve the query process. We can also query a period of version. Besides, we also consider the garbage collection to ensure that there are sufficient free blocks. We reclaim the old version of sensor data that accessed less frequently than new versions. Our scheme can reduce the number of page read and improve the write performance compare with traditional Multi-version B+-Tree index structures and Cluster-based Multi-version B+-Tree index structures.


We propose a novel scheme that using multi-version structure to store the sensor data that need not only the latest version of data but also keep track of the old data in the flash memory. For sensor devices, it is important to preserve old version of sensor data for further queries. In our scheme, each sensor has different period and phase. We can query the historical data directly by a series of equations without using index structures to improve the query process. We can also query a period of version. Besides, we also consider the garbage collection to ensure that there are sufficient free blocks. We reclaim the old version of sensor data that accessed less frequently than new versions. Our scheme can reduce the number of page read and improve the write performance compare with traditional Multi-version B+-Tree index structures and Cluster-based Multi-version B+-Tree index structures.

1 Introduction 5 2 Preliminary 8 2.1 The Characteristic of Flash Memory . . . . . . . . . . . . . . . . 8 2.2 Multi-Version B+-Tree Index Structure and its Problems in Flash Memory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.3 Cluster-based Multi-version B+-Tree in Flash-Based Embedded Database Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.4 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.4.1 Transactional Multi-version B+-tree . . . . . . . . . . . . 12 2.4.2 BFTL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.4.3 μ-Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.4.4 In Page Logging B+-Tree . . . . . . . . . . . . . . . . . . . 13 2.4.5 Dynamic In-Page Logging for B+-tree Index . . . . . . . . 14 2.4.6 Real-Time Querying of Historical Data in Flash-Equipped Sensor Devices . . . . . . . . . . . . . . . . . . . . . . . . 15 3 Management Scheme of Real-time Multi-version Sensor Data for Flash-based Embedded Database Systems 19 3.1 Problem Definition . . . . . . . . . . . . . . . . . . . . . . . . . . 19 3.2 Structure Overview . . . . . . . . . . . . . . . . . . . . . . . . . . 20 3.3 Multi-version Data Management . . . . . . . . . . . . . . . . . . . 22 3.4 Versioning Sensor Data Insertions . . . . . . . . . . . . . . . . . . 23 3.4.1 Centralized Mode . . . . . . . . . . . . . . . . . . . . . . . 23 3.4.2 Distributed Mode . . . . . . . . . . . . . . . . . . . . . . . 25 3.5 Historical Data Queries . . . . . . . . . . . . . . . . . . . . . . . . 26 3.6 Historical Data Queries for Varies Data Size . . . . . . . . . . . . 30 3.7 Purge Old Data Versions . . . . . . . . . . . . . . . . . . . . . . . 33 4 Performance Evaluation 36 4.1 Experimental Settings and Performance Metrics . . . . . . . . . . 36 4.2 Update Performance . . . . . . . . . . . . . . . . . . . . . . . . . 37 4.2.1 Number of Pages Write . . . . . . . . . . . . . . . . . . . . 37 4.2.2 Page Utilization . . . . . . . . . . . . . . . . . . . . . . . . 38 4.3 Query Performance . . . . . . . . . . . . . . . . . . . . . . . . . . 39 4.3.1 Number of Pages Read . . . . . . . . . . . . . . . . . . . . 39 4.4 Garbage Collection . . . . . . . . . . . . . . . . . . . . . . . . . . 41 4.4.1 Number of Erase Operations . . . . . . . . . . . . . . . . . 41 5 Conclusion 43

[1] B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer, "An asymp-
totically optimal multiversion b-tree," VLDB Journal, vol. 5, no. 4, pp. 264-
275, 1996.
[2] R. Rajkumar, I. Lee, L. Sha, and J. Stankovic, "Cyber-physical systems:
the next computing revolution," Proceedings of the 47th Design Automation
Conference, pp. 731-736, 2010.
[3] Q. Tang, S. K. S. Gupta, and G. Varsamopoulos, "A unified methodology
for scheduling in distributed cyber-physical systems," ACM Trans. Embed.
Comput. Syst., vol. 11, no. S2, pp. 57:1-57:25, 2012.
[4] D. Zeinalipour-yazti, S. Lin, V. Kalogeraki, D. Gunopulos, and W. A. Naj-
jar, "Microhash: An efficient index structure for flash-based sensor devices,"
Proceedings of the 4th USENIX Conference on File and Storage Technologies,
pp. 31-44, 2005.
[5] D. Kang, D. Jung, J.-U. Kang, and J.-S. Kim, "μ-tree: an ordered index
structure for nand flash memory," Proceedings of the 7th ACM & IEEE in-
ternational conference on Embedded software, pp. 144-153, 2007.
[6] J.-T. Wang, K.-Y. Lam, Y.-H. Chang, J.-W. Hsieh, S. Han, Y.-H. Kuan, and
A. K. Mok, "Cluster-based multi-version b+-tree in flash-based embedded
database systems," Work-in-Progress Session of the IEEE Real-Time and
Embedded Technology and Applications Symposium, pp. 1-4, 2012.
[7] S.-W. Lee and B. Moon, "Transactional inpage logging for multiversion read
consistency and recovery," Proceedings of the 2011 IEEE 27th International
Conference on Data Engineering, pp. 876-887, 2011.
[8] A. J. Dou, S. Lin, and V. Kalogeraki, "Real-time querying of historical data in
flash-equipped sensor devices," Proceeding of Real-Time Systems Symposium,
pp. 335-344, 2008.
[9] T. Haapasalo, I. Jaluta, B. Seeger, S. Sippu, and E. Soisalon-Soininen,
"Transactions on the multiversion b+-tree," Proceedings of the 12th Interna-
tional Conference on Extending Database Technology: Advances in Database
Technology, pp. 1064-1075, 2009.
[10] C.-H. Wu, T.-W. Kuo, and L.-P. Chang, "An efficient b-tree layer for flash-
memory storage systems," ACM Trans. Embed. Comput. Syst., 2007.
[11] C.-H. Wu, L.-P. Chang, and T.-W. Kuo, "An efficient r-tree implementation
over flash-memory storage systems," Proceedings of the 11th ACM interna-
tional symposium on Advances in geographic information systems, pp. 17-24,
2003.
[12] G.-J. Na, B. Moon, and S.-W. Lee, "Design of flash-based dbms: an in-page
logging approach," Proceedings of the 2007 ACM SIGMOD international con-
ference on Management of data, pp. 55-66, 2007.
[13] G.-J. Na, B. Moon, and S.-W. Lee, "In-page logging b-tree for flash memory," Proceedings of the 14th In-
ternational Conference on Database Systems for Advanced Applications, pp.
755-758, 2009.
[14] G.-J. Na, S.-W. Lee, and B. Moon, "Dynamic in-page logging for b+-tree
index," IEEE Transactions on Knowledge and Data Engineering, pp. 1231-
1243, 2012.

QR CODE