Object storage
Sirpa Kurz, Anne Freiag, Reto Nyffeler et al. · Open MIND · 2021
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Object storage”
Sirpa Kurz, Anne Freiag, Reto Nyffeler et al. · Open MIND · 2021
Cited by 0
Reuter, H. · Max Planck Institute for Plasma Physics
Cited by 0
Marius Alfred Dieckmann, Sebastian Beyvers, Jannis Hochmuth et al. · Proceedings of the Conference on Research Data Infrastructure · 2023
The exponential growth of scientific data has led to an increasing demand for effective data management and storage solutions. Academic computing infrastructures are often fragmented, which can make it challenging for researchers to leverage cloud-native principles and modern data analysis tools. To address this challenge, a new distributed storage platform called Aruna Object Storage (AOS) was developed. AOS is a cloud-native, scalable, and domain-agnostic object storage system that provides an S3-compatible interface for a variety of data analysis tools like Apache Spark, TensorFlow, and Pandas. The system uses an underlying distributed NewSQL database to manage detailed information about its resources and can be deployed across multiple data centers for geo-redundancy. AOS is designed to support modern DataOps practices, including the adoption of FAIR principles. Resources in AOS are organized into Objects, Datasets, Collections and Projects, which represent relations of data objects. Additionally, these can be further annotated with key-value pairs called Labels and Hooks to provide additional information about the data. The system's event-driven architecture makes it easy to automate actions and enforce data validation checks, significantly improving accessibility and reproducibility of scientific results. AOS is open source and freely available via https://aruna-storage.org.
Cited by 1Open access
Toebbicke, R., Maslennikov, A., Giammarino, L. et al. · Max Planck Institute for Plasma Physics
Cited by 0
Andrey Markelov · Certification study companion series · 2022
This chapter covers 5% of the Certified OpenStack Administrator exam requirements. You may expect a small number of tasks related to object storage. Moreover, not all OpenStack installations have this type of storage. However, I recommend studying this chapter carefully to maximize the chances of passing the COA exam.
Cited by 1
Reuter, H · Max Planck Institute for Plasma Physics
Cited by 0
Toebbicke, R., Maslennikov, A., Giammarino, L. et al. · Max Planck Institute for Plasma Physics
Cited by 0
XI WEIYA · National University of Singapore · 2008
Ph.D
Cited by 0
Toebbicke, R., Maslennikov, A., Giammarino, L. et al. · Max Planck Institute for Plasma Physics
Cited by 0
Vera Ivanushko · OSF Preprints (OSF Preprints) · 2024
Cited by 0
Apress eBooks · 2007
Data, data, everywhere, but not a byte to eat. How we store, organize, and access data can determine the future success of software systems and thus the organizations that rely on them so heavily. Choosing poorly in these respects can doom us to a long, agonizing information death as complexity, inefficiency, and competing constraints spiral out of control.
Cited by 0
Erik Riedel, Sami Iren · 2007
Cited by 0
Wendy Harding, C. M. Clark, Claudio Gallo et al. · IBM Systems Journal · 1990
The Object Access Method (OAM) component of MVS/Data Facility Product is responsible for the storage, retrieval, and management of objects in IBM MVS/ESA™ ImagePlus™ systems and in other applications. The OAM Storage Management Component is the subcomponent of OAM that provides storage management for objects stored within an object storage hierarchy. Storage management is a cyclic procedure which assures that data are stored in conformity to a policy defined by the data processing storage administrator. During a storage management cycle, the OAM Storage Management Component (OSMC) selects objects for processing based on requirements for backup, expiration, or service level changes. This paper describes the concepts of object storage management using a storage hierarchy that contains DASD and optical disk storage.
Cited by 3
Xavier Caron · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 2000
This report is the result of a diploma thesis of Xavier Caron, a computer science student at the Software Engineering Lab (LGL), which is part of the Swiss Federal Institute of Technology in Lausanne (EPFL). The LGL is currently developing an object-oriented library providing transaction support for Ada programmers. Transactions are actions that have the well-known ACID properties (Atomicity, Consistency, Isolation, and Durability). Durability of objects can be achieved by saving their state to so-called "stable storage". The goal of this project is to implement the two following forms of stable storage: 1) Stable storage using a technique called mirroring. The integrity of the stored data must be guaranteed even in the presence of crash failures. 2) Stable storage based on replication. Using the distributed programming facilities of Ada 95, a mechanism must be devised that allows to broadcast the information that has to be made durable to a group of collaborating machines for storage. Of course, it should also be possible to retrieve the data in a consistent manner. This report describes the system design and implementation in Ada 95.
Cited by 0Open access
Zhongmin Li, Zhanwu Yu · Lecture notes in computer science · 2007
Cited by 1Open access
Akif Quddus Khan, Mihhail Matskin, Radu Prodan et al. · Computing · 2024
Abstract Cloud storage adoption has increased over the years given the high demand for fast processing, low access latency, and ever-increasing amount of data being generated by, e.g., Internet of Things applications. In order to meet the users’ demands and provide a cost-effective solution, cloud service providers offer tiered storage; however, keeping the data in one tier is not cost-effective. In this respect, cloud storage tier optimization involves aligning data storage needs with the most suitable and cost-effective storage tier, thus reducing costs while ensuring data availability and meeting performance requirements. Ideally, this process considers the trade-off between performance and cost, as different storage tiers offer different levels of performance and durability. It also encompasses data lifecycle management, where data is automatically moved between tiers based on access patterns, which in turn impacts the storage cost. In this respect, this article explores two novel classification approaches, rule-based and game theory-based, to optimize cloud storage cost by reassigning data between different storage tiers. Four distinct storage tiers are considered: premium, hot, cold, and archive. The viability and potential of the proposed approaches are demonstrated by comparing cost savings and analyzing the computational cost using both fully-synthetic and semi-synthetic datasets with static and dynamic access patterns. The results indicate that the proposed approaches have the potential to significantly reduce cloud storage cost, while being computationally feasible for practical applications. Both approaches are lightweight and industry- and platform-independent.
Cited by 6Open access
Ananth Devulapalli, Dennis Dalessandro, Pete Wyckoff et al. · 2007
As storage systems grow larger and more complex, the traditional block-based design of current disks can no longer satisfy workloads that are increasingly metadata intensive. A new approach is offered by object-based storage devices (OSDs). By moving more of the responsibility of storage management onto each OSD, improvements in performance, scalability and manageability are possible. Since this technology is new, no physical object-based storage device is currently available. In this work we describe a software emulator for an object-based disk. We focus on the design of the attribute storage, which is used to hold metadata associated with particular data objects. Alternative designs are discussed, and performance results for an SQL implementation are presented.
Cited by 12
Kanishk Jain · 2007
This literature survey is the only work so far where the overall progress in object based storage technology has been analyzed, following its standardization. It also illustrates how the trends of recent research fit into the broad scope of the object based storage environment, thus bringing out the current status of the technology, while simultaneously providing a reality check for the concept. A special feature of this survey is an attempted comparison of existing object based file systems, mainly from a design perspective. Object-based storage is a new technology which provides intelligence at the storage device. The object storage device (OSD) interface has recently been standardized. The main characteristic of an OSD is “intelligent data layout”. Its advantages include scalability, security, reliability, performance and ease of management. This literature survey looks at the capabilities of object-based storage, and explores how it improves data sharing, security, and device intelligence. It analyzes various aspects of object based storage such as file system design, application based optimizations and so on, in order to understand the advantages of this upcoming storage technology. Many of the ideas presented in this survey suggest extensions to the OSD interface to enhance performance, security, quality of service and so on. Hence the interface is still evolving. 1.
Cited by 0
Lijuan Zhong · Lecture notes in computer science · 2020
Cited by 0
Daegyu Han, Sucheol Lee, Kyeungpyo Kim et al. · 2024
In this work, we explore the opportunity to optimize the I/O path for object storage in disaggregated storage. To do so, we propose QuickSilver, a mechanism that directly accesses remote storage by leveraging file mapping information rather than relying on RPC communication for data exchange with remote nodes. We implemented QuickSilver on MinIO, representative object storage, and our experimental study shows that QuickSilver significantly enhances MinIO's performance by reducing unnecessary data communication between nodes.
Cited by 0