Pub Date : 2011-05-23DOI: 10.1109/MSST.2011.5937225
M. Murugan, D. Du
NAND flash memory is fast replacing traditional magnetic storage media due to its better performance and low power requirements. However the endurance of flash memory is still a critical issue in using it for large scale enterprise applications. Rethinking the basic design of NAND flash memory is essential to realize its maximum potential in large scale storage. NAND flash memory is organized as blocks and blocks in turn have pages. A block can be erased reliably only for a limited number of times and frequent block erase operations to a few blocks reduce the lifetime of the flash memory. Wear leveling helps to prevent the early wear out of blocks in the flash memory. In order to achieve efficient wear leveling, data is moved around throughout the flash memory. The existing wear leveling algorithms do not scale for large scale NAND flash based SSDs. In this paper we propose a static wear leveling algorithm, named as Rejuvenator, for large scale NAND flash memory. Rejuvenator is adaptive to the changes in workloads and minimizes the cost of expensive data migrations. Our evaluation of Rejuvenator is based on detailed simulations with large scale enterprise workloads and synthetic micro benchmarks.
{"title":"Rejuvenator: A static wear leveling algorithm for NAND flash memory with minimized overhead","authors":"M. Murugan, D. Du","doi":"10.1109/MSST.2011.5937225","DOIUrl":"https://doi.org/10.1109/MSST.2011.5937225","url":null,"abstract":"NAND flash memory is fast replacing traditional magnetic storage media due to its better performance and low power requirements. However the endurance of flash memory is still a critical issue in using it for large scale enterprise applications. Rethinking the basic design of NAND flash memory is essential to realize its maximum potential in large scale storage. NAND flash memory is organized as blocks and blocks in turn have pages. A block can be erased reliably only for a limited number of times and frequent block erase operations to a few blocks reduce the lifetime of the flash memory. Wear leveling helps to prevent the early wear out of blocks in the flash memory. In order to achieve efficient wear leveling, data is moved around throughout the flash memory. The existing wear leveling algorithms do not scale for large scale NAND flash based SSDs. In this paper we propose a static wear leveling algorithm, named as Rejuvenator, for large scale NAND flash memory. Rejuvenator is adaptive to the changes in workloads and minimizes the cost of expensive data migrations. Our evaluation of Rejuvenator is based on detailed simulations with large scale enterprise workloads and synthetic micro benchmarks.","PeriodicalId":136636,"journal":{"name":"2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128849078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-23DOI: 10.1109/MSST.2011.5937222
Li Xiao, Yufen Tan, Zhizhuo Sun
In this paper, we propose an alternative RAID data layout, Semi-RAID (S-RAID), for the kind of application that exhibits a sequential data access pattern. The data layout of S-RAID uses a grouping strategy that makes only part of the whole array active and puts the rest of the array into standby mode. In this way S-RAID can greatly reduce the power consumption and improve the reliability while still satisfying the I/O requirements of the application. We have shown that transforming a traditional RAID 5 into S-RAID 5 makes average mean time to failure (MTTF) 8 times as long as before, and reduces the power consumption to 74% in a 5-disk configuration. In a typical video surveillance system that has 25 disks, S-RAID may reduce the power consumption to nearly 15% in the best case. The performance of S-RAID is evaluated and proved to be sufficient for the workloads it is optimized for. Possible optimization for other workloads has also been given at the end of the paper.
{"title":"Semi-RAID: A reliable energy-aware RAID data layout for sequential data access","authors":"Li Xiao, Yufen Tan, Zhizhuo Sun","doi":"10.1109/MSST.2011.5937222","DOIUrl":"https://doi.org/10.1109/MSST.2011.5937222","url":null,"abstract":"In this paper, we propose an alternative RAID data layout, Semi-RAID (S-RAID), for the kind of application that exhibits a sequential data access pattern. The data layout of S-RAID uses a grouping strategy that makes only part of the whole array active and puts the rest of the array into standby mode. In this way S-RAID can greatly reduce the power consumption and improve the reliability while still satisfying the I/O requirements of the application. We have shown that transforming a traditional RAID 5 into S-RAID 5 makes average mean time to failure (MTTF) 8 times as long as before, and reduces the power consumption to 74% in a 5-disk configuration. In a typical video surveillance system that has 25 disks, S-RAID may reduce the power consumption to nearly 15% in the best case. The performance of S-RAID is evaluated and proved to be sufficient for the workloads it is optimized for. Possible optimization for other workloads has also been given at the end of the paper.","PeriodicalId":136636,"journal":{"name":"2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124391602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-23DOI: 10.1109/MSST.2011.5937232
Guanlin Lu, Biplob K. Debnath, D. Du
A Bloom Filter (BF) is a data structure based on probability to compactly represent/record a set of elements (keys). It has wide applications on efficiently identifying a key that has been seen before with minimum amount of recording space used. BF is heavily used in chunking based data de-duplication. Traditionally, a BF is implemented as in-RAM data structure; hence its size is limited by the available RAM space on the machine. For certain applications like data de-duplication that require a big BF beyond the size of available RAM space, it becomes necessary to store a BF into a secondary storage device. Since BF operations are inherently random in nature, magnetic disk provides worse performance for the random read and write operations. It will not be a good fit for storing the large BF. Flash memory based Solid State Drive (SSD) has been considered as an emerging storage device that has superior performance and can potentially replace disks as the preferred secondary storage devices. However, several special characteristics of flash memory make designing a flash memory based BF very challenging. In this paper, our goal is to design an efficient flash memory based BF that is fully aware of these physical characteristics. To this end, we propose a Forest-structured BF design (FBF). FBF uses a combination of RAM and flash memory to design a BF. BF is stored on the flash, while RAM helps to mitigate the impact of slow write performance of flash memory. In addition, in-flash BF is organized in a forest-like structure in order to improve the lookup performance. Our experimental results show that FBF design achieves 2 times faster processing speed with 50% less number of flash write operations when compared with the existing flash memory based BF designs.
布隆过滤器(BF)是一种基于概率的数据结构，用于紧凑地表示/记录一组元素(键)。它在以最小的记录空间有效地识别以前见过的密钥方面具有广泛的应用。BF在基于分块的重复数据删除中得到了广泛的应用。传统上，BF是作为内存中的数据结构实现的;因此，它的大小受到机器上可用RAM空间的限制。对于某些应用程序，如数据重复删除，需要一个超过可用RAM空间大小的大BF，就有必要将BF存储到辅助存储设备中。由于高炉操作本身具有随机性，因此磁盘对随机读写操作的性能较差。它不适合储存大型高炉。基于闪存的固态硬盘(Solid State Drive, SSD)被认为是一种新兴的存储设备，具有优越的性能，有可能取代磁盘成为首选的二级存储设备。然而，闪存的一些特殊特性使得基于BF的闪存的设计非常具有挑战性。在本文中，我们的目标是设计一个高效的基于BF的闪存，充分意识到这些物理特性。为此，我们提出了一种森林结构BF设计(FBF)。FBF采用RAM和闪存相结合的方式来设计BF。BF存储在闪存上，而RAM有助于减轻闪存写入速度慢的影响。此外，为了提高查找性能，flash内BF被组织成类似森林的结构。实验结果表明，与现有基于闪存的BF设计相比，FBF设计的处理速度提高了2倍，闪存写入操作次数减少了50%。
{"title":"A Forest-structured Bloom Filter with flash memory","authors":"Guanlin Lu, Biplob K. Debnath, D. Du","doi":"10.1109/MSST.2011.5937232","DOIUrl":"https://doi.org/10.1109/MSST.2011.5937232","url":null,"abstract":"A Bloom Filter (BF) is a data structure based on probability to compactly represent/record a set of elements (keys). It has wide applications on efficiently identifying a key that has been seen before with minimum amount of recording space used. BF is heavily used in chunking based data de-duplication. Traditionally, a BF is implemented as in-RAM data structure; hence its size is limited by the available RAM space on the machine. For certain applications like data de-duplication that require a big BF beyond the size of available RAM space, it becomes necessary to store a BF into a secondary storage device. Since BF operations are inherently random in nature, magnetic disk provides worse performance for the random read and write operations. It will not be a good fit for storing the large BF. Flash memory based Solid State Drive (SSD) has been considered as an emerging storage device that has superior performance and can potentially replace disks as the preferred secondary storage devices. However, several special characteristics of flash memory make designing a flash memory based BF very challenging. In this paper, our goal is to design an efficient flash memory based BF that is fully aware of these physical characteristics. To this end, we propose a Forest-structured BF design (FBF). FBF uses a combination of RAM and flash memory to design a BF. BF is stored on the flash, while RAM helps to mitigate the impact of slow write performance of flash memory. In addition, in-flash BF is organized in a forest-like structure in order to improve the lookup performance. Our experimental results show that FBF design achieves 2 times faster processing speed with 50% less number of flash write operations when compared with the existing flash memory based BF designs.","PeriodicalId":136636,"journal":{"name":"2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121960324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-23DOI: 10.1109/MSST.2011.5937220
Yulai Xie, Kiran-Kumar Muniswamy-Reddy, D. Feng, D. Long, Yangwook Kang, Zhongying Niu, Zhipeng Tan
In this paper, we present the design and performance evaluation of Oasis, an active storage framework for object-based storage systems that complies with the current T10 OSD standard. In contrast with previous work, Oasis has the following advantages. First, Oasis enables users to transparently process the OSD object and supports different processing granularity (from the single object to all the objects in the OSD) by extending the OSD object attribute page defined in the T10 OSD standard. Second, Oasis provides an easy and efficient way for users to manage the application functions in the OSD by using the existing OSD commands. Third, Oasis can authorize the execution of the application function in the OSD by enhancing the T10 OSD security protocol, allowing only authorized users to use the system. We evaluate the performance and scalability of our system implementation on Oasis by running three typical applications. The results indicate that active storage far outperforms the traditional object-based storage system in applications that filter data on the OSD. We also experiment with Java based applications and C based applications. Our experiments indicate that Java based applications may be bottlenecked for I/O-intensive applications, while for applications that do not heavily rely on the I/O operations, both Java based applications and C based applications achieve comparable performance. Our microbenchmarks indicate that Oasis implementation overhead is minimal compared to the Intel OSD reference implementation, between 1.2% to 5.9% for Read commands and 0.6% to 9.9% for Write commands.
{"title":"Design and evaluation of Oasis: An active storage framework based on T10 OSD standard","authors":"Yulai Xie, Kiran-Kumar Muniswamy-Reddy, D. Feng, D. Long, Yangwook Kang, Zhongying Niu, Zhipeng Tan","doi":"10.1109/MSST.2011.5937220","DOIUrl":"https://doi.org/10.1109/MSST.2011.5937220","url":null,"abstract":"In this paper, we present the design and performance evaluation of Oasis, an active storage framework for object-based storage systems that complies with the current T10 OSD standard. In contrast with previous work, Oasis has the following advantages. First, Oasis enables users to transparently process the OSD object and supports different processing granularity (from the single object to all the objects in the OSD) by extending the OSD object attribute page defined in the T10 OSD standard. Second, Oasis provides an easy and efficient way for users to manage the application functions in the OSD by using the existing OSD commands. Third, Oasis can authorize the execution of the application function in the OSD by enhancing the T10 OSD security protocol, allowing only authorized users to use the system. We evaluate the performance and scalability of our system implementation on Oasis by running three typical applications. The results indicate that active storage far outperforms the traditional object-based storage system in applications that filter data on the OSD. We also experiment with Java based applications and C based applications. Our experiments indicate that Java based applications may be bottlenecked for I/O-intensive applications, while for applications that do not heavily rely on the I/O operations, both Java based applications and C based applications achieve comparable performance. Our microbenchmarks indicate that Oasis implementation overhead is minimal compared to the Intel OSD reference implementation, between 1.2% to 5.9% for Read commands and 0.6% to 9.9% for Write commands.","PeriodicalId":136636,"journal":{"name":"2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132684216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-23DOI: 10.1109/MSST.2011.5937230
Chao Jin, D. Feng, Hong Jiang, Lei Tian
The RAID6 architecture is playing an increasingly important role in modern storage systems due to its provision of very high reliability. However, its high write penalty, because of the double-parity-update overheads upon each write operation, has been a persistent performance bottleneck of the RAID6 systems. In this paper, we propose a log-assisted RAID6 architecture, called RAID6L, to boost the write performance of the RAID6 systems. RAID6L integrates a log disk into the traditional RAID6 architecture, and alleviates its write penalty by simplifying the processing steps to service a write request. On the other hand, RAID6L also guarantees that the accelerated RAID6 systems can still recover from double disk failures. The Parity Logging scheme was originally proposed to accelerate the XOR based RAID5, and we propose a method to make it also applicable to the Reed-Solomon based RAID6. We present a detailed comparison between RAID6L and Parity Logging, and show that RAID6L has several advantages over Parity Logging. Experimental results show that RAID6L significantly increases the data transfer rate and decreases the request response time when compared with the traditional RAID6 and Parity Logging systems.
{"title":"RAID6L: A log-assisted RAID6 storage architecture with improved write performance","authors":"Chao Jin, D. Feng, Hong Jiang, Lei Tian","doi":"10.1109/MSST.2011.5937230","DOIUrl":"https://doi.org/10.1109/MSST.2011.5937230","url":null,"abstract":"The RAID6 architecture is playing an increasingly important role in modern storage systems due to its provision of very high reliability. However, its high write penalty, because of the double-parity-update overheads upon each write operation, has been a persistent performance bottleneck of the RAID6 systems. In this paper, we propose a log-assisted RAID6 architecture, called RAID6L, to boost the write performance of the RAID6 systems. RAID6L integrates a log disk into the traditional RAID6 architecture, and alleviates its write penalty by simplifying the processing steps to service a write request. On the other hand, RAID6L also guarantees that the accelerated RAID6 systems can still recover from double disk failures. The Parity Logging scheme was originally proposed to accelerate the XOR based RAID5, and we propose a method to make it also applicable to the Reed-Solomon based RAID6. We present a detailed comparison between RAID6L and Parity Logging, and show that RAID6L has several advantages over Parity Logging. Experimental results show that RAID6L significantly increases the data transfer rate and decreases the request response time when compared with the traditional RAID6 and Parity Logging systems.","PeriodicalId":136636,"journal":{"name":"2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133549919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-23DOI: 10.1109/MSST.2011.5937231
M. Landowski, P. Curran
ATA over Ethernet (AoE) protocol is an interesting alternative to iSCSI and Fibre Channel. AoE is a light, layer 2 protocol integrated with Ethernet frames, which makes it ideal for work inside LAN segments. Unfortunately, this advantage is also its limitation when access to the AoE storage is required to be over the internetwork. In this paper we show how MPLS can make AoE routable and thereby also independent of Ethernet itself.
{"title":"AoE storage protocol over MPLS network","authors":"M. Landowski, P. Curran","doi":"10.1109/MSST.2011.5937231","DOIUrl":"https://doi.org/10.1109/MSST.2011.5937231","url":null,"abstract":"ATA over Ethernet (AoE) protocol is an interesting alternative to iSCSI and Fibre Channel. AoE is a light, layer 2 protocol integrated with Ethernet frames, which makes it ideal for work inside LAN segments. Unfortunately, this advantage is also its limitation when access to the AoE storage is required to be over the internetwork. In this paper we show how MPLS can make AoE routable and thereby also independent of Ethernet itself.","PeriodicalId":136636,"journal":{"name":"2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134256327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
P. Carns, K. Harms, W. Allcock, Charles Bacon, S. Lang, R. Latham, R. Ross
Computational science applications are driving a demand for increasingly powerful storage systems. While many techniques are available for capturing the I/O behavior of individual application trial runs and specific components of the storage system, continuous characterization of a production system remains a daunting challenge for systems with hundreds of thousands of compute cores and multiple petabytes of storage. As a result, these storage systems are often designed without a clear understanding of the diverse computational science workloads they will support.
{"title":"Understanding and improving computational science storage access through continuous characterization","authors":"P. Carns, K. Harms, W. Allcock, Charles Bacon, S. Lang, R. Latham, R. Ross","doi":"10.1145/2027066.2027068","DOIUrl":"https://doi.org/10.1145/2027066.2027068","url":null,"abstract":"Computational science applications are driving a demand for increasingly powerful storage systems. While many techniques are available for capturing the I/O behavior of individual application trial runs and specific components of the storage system, continuous characterization of a production system remains a daunting challenge for systems with hundreds of thousands of compute cores and multiple petabytes of storage. As a result, these storage systems are often designed without a clear understanding of the diverse computational science workloads they will support.","PeriodicalId":136636,"journal":{"name":"2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117087045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-23DOI: 10.1109/MSST.2011.5937237
Y. Tsuchiya, Takashi Watanabe
The deduplication block-device (DBLK) is a deduplication and compression system with a block device interface. It is used as a primary storage and block-wise deduplication is done inline. Since deduplication for primary storage requires low latency and detecting block-wise deduplication creates a large amount of metadata, it is necessary to efficiently use the memory of the system. We solved this problem by developing a multilayer Bloom filter (MBF) to reduce the size of the data structure in the memory for indexing duplicate data.
{"title":"DBLK: Deduplication for primary block storage","authors":"Y. Tsuchiya, Takashi Watanabe","doi":"10.1109/MSST.2011.5937237","DOIUrl":"https://doi.org/10.1109/MSST.2011.5937237","url":null,"abstract":"The deduplication block-device (DBLK) is a deduplication and compression system with a block device interface. It is used as a primary storage and block-wise deduplication is done inline. Since deduplication for primary storage requires low latency and detecting block-wise deduplication creates a large amount of metadata, it is necessary to efficiently use the memory of the system. We solved this problem by developing a multilayer Bloom filter (MBF) to reduce the size of the data structure in the memory for indexing duplicate data.","PeriodicalId":136636,"journal":{"name":"2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"5 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131958298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-23DOI: 10.1109/MSST.2011.5937227
Simona Boboila, Peter Desnoyers
There is a wide gap between the potential performance of NAND flash-based solid state drives (SSDs) and their performance in many real-world applications; understanding this gap requires knowledge of their behavior and internal algorithms for various workloads. We develop analytic models for two commonly-used Flash Translation Layer (FTL) algorithms, as used in SSDs, as well as a methodology for applying these models to real-world workloads. We demonstrate the accuracy of these models via simulation, extend this approach to incorporate measurement-based approximations when detailed parameters are unknown, and validate this methodology against real devices.
{"title":"Performance models of flash-based solid-state drives for real workloads","authors":"Simona Boboila, Peter Desnoyers","doi":"10.1109/MSST.2011.5937227","DOIUrl":"https://doi.org/10.1109/MSST.2011.5937227","url":null,"abstract":"There is a wide gap between the potential performance of NAND flash-based solid state drives (SSDs) and their performance in many real-world applications; understanding this gap requires knowledge of their behavior and internal algorithms for various workloads. We develop analytic models for two commonly-used Flash Translation Layer (FTL) algorithms, as used in SSDs, as well as a methodology for applying these models to real-world workloads. We demonstrate the accuracy of these models via simulation, extend this approach to incorporate measurement-based approximations when detailed parameters are unknown, and validate this methodology against real devices.","PeriodicalId":136636,"journal":{"name":"2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116640814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-23DOI: 10.1109/MSST.2011.5937233
Michael Meseke
The XML and XQuery language capabilities of modern databases can provide a powerful and flexible method of data management within a mass storage system. Within the High Performance Storage System (HPSS), the implementation of XML and XQuery capabilities for user metadata is called “User-defined Attributes” or UDA. The UDA feature provides a method for user applications to associate arbitrary metadata with HPSS namespace objects and store it in an organized, scalable, and searchable manner using XML. The implementation includes a simple key-value interface as well as exposure of the database's XQuery interface to allow for highly customized and atomic update, retrieval, and namespace-wide search requests. Using this architecture enables HPSS to provide client applications a high degree of flexibility in the storage, management, and access of user-defined metadata. This paper describes a brief history of data management within HPSS as well as the architectural decisions, implementation, and results of the UDA feature. Also discussed are considerations for planning and management of the UDA feature, current and in development UDA solutions created by developers and customers, and possible future data management work within HPSS.
{"title":"Using XML and XQuery for data management in HPSS","authors":"Michael Meseke","doi":"10.1109/MSST.2011.5937233","DOIUrl":"https://doi.org/10.1109/MSST.2011.5937233","url":null,"abstract":"The XML and XQuery language capabilities of modern databases can provide a powerful and flexible method of data management within a mass storage system. Within the High Performance Storage System (HPSS), the implementation of XML and XQuery capabilities for user metadata is called “User-defined Attributes” or UDA. The UDA feature provides a method for user applications to associate arbitrary metadata with HPSS namespace objects and store it in an organized, scalable, and searchable manner using XML. The implementation includes a simple key-value interface as well as exposure of the database's XQuery interface to allow for highly customized and atomic update, retrieval, and namespace-wide search requests. Using this architecture enables HPSS to provide client applications a high degree of flexibility in the storage, management, and access of user-defined metadata. This paper describes a brief history of data management within HPSS as well as the architectural decisions, implementation, and results of the UDA feature. Also discussed are considerations for planning and management of the UDA feature, current and in development UDA solutions created by developers and customers, and possible future data management work within HPSS.","PeriodicalId":136636,"journal":{"name":"2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126856636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：