Zigzag Decodable codes: Linear-time erasure codes with applications to data storage

With increasing powering of data storage and advances in data generation and collection technologies, large volumes of time series data become available and the content is changing rapidly. This requires the data mining methods to have low time complexity to handle the huge and fast-changing data. This paper presents a novel time series clustering algorithm that has linear time complexity. The proposed algorithm partitions the data by checking some randomly selected symbolic patterns in the time series. Theoretical analysis is provided to show that group structures in the data can be revealed from this process. We evaluate the proposed algorithm extensively on all 85 datasets from the well-known UCR time series archive, and compare with the state-of-the-art approaches with statistical analysis. The results show that the proposed method is faster, and achieves better accuracy compared with other rival methods.

Download Full-text

Secure P2P Data Storage and Maintenance

International Journal of Digital Multimedia Broadcasting ◽

10.1155/2010/720251 ◽

2010 ◽

Vol 2010 ◽

pp. 1-11 ◽

Cited By ~ 3

Author(s):

Nouha Oualha ◽

Melek Önen ◽

Yves Roudier

Keyword(s):

Data Storage ◽

Data Availability ◽

Self Organization ◽

Erasure Codes ◽

P2p Systems ◽

Storage Solutions ◽

Existing Data ◽

Self Organizing

P2P data storage requires strong reliability and security assurances. Existing data storage solutions have been designed for centralized as well as distributed settings; yet they do not address the security and cooperation issues raised by self-organization. P2P systems also introduce new needs regarding data availability due to the dynamicity of the infrastructure, which are unaddressed so far. This paper first discusses the approaches for tackling these problems. A solution is then introduced that relies on self-organizing security mechanisms in conjunction with a data rejuvenation scheme using erasure codes.

Download Full-text

Correcting a Single Indel / Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality

IEEE Transactions on Information Theory ◽

10.1109/tit.2021.3049627 ◽

2021 ◽

pp. 1-1

Author(s):

Kui Cai ◽

Yeow Meng Chee ◽

Ryan Gabrys ◽

Han Mao Kiah ◽

Tuan Thanh Nguyen

Keyword(s):

Data Storage ◽

Linear Time

Download Full-text

Fine Grained Decentralized Access Control With Provable Data Transmission and User Revocation in Cloud

International Journal of Information Security and Privacy ◽

10.4018/ijisp.2021040102 ◽

2021 ◽

Vol 15 (2) ◽

pp. 29-52

Author(s):

Shweta Kaushik ◽

Charu Gandhi

Keyword(s):

Access Control ◽

Data Storage ◽

Linear Time ◽

Data Access ◽

Control Technique ◽

Fine Grained ◽

Data Access Control ◽

Integrity Checking ◽

User Data ◽

User Revocation

Cloud computing started a new era for IT enterprises. It allows the movement of application from local to remote location, massive data storage. Owner has access to centralized or decentralized data storage server, where data management handled by remote vendor. But, the heterogeneous and dynamic nature of cloud introduces security challenges. Among them, access control and integrity checking are most important which incur high consideration. Attribute-based encryption is one of the access control technique which allows integration of access policies, attributes, and encrypted data. In this paper, a new fine-grained decentralized data access control technique with user revocation has been proposed. Here, service provider is responsible for verifying the user authenticity. The proposed schema supports integrity checking and user revocation. The integrity checking proof validates that the user data is intact and revocation mechanism will help to revoke the user in linear time. Moreover, the proposed access control and authentication schemes are decentralized and comparable to other approaches.

Download Full-text