Exploring Queriability of Encrypted and Compressed XML Data

Date

2009-09-16

Author

Elgedawy, Islam
Srivastava, Biplav
Mittal, Sumit

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

6
views

0
downloads

Cite This

When large XML documents are shared, documents compression and encryption become simultaneously important for efficient and secure access. Existing approaches for compressing and encrypting large XML documents provide a non-queriable intermediate document representation, creating a need to decompress and decrypt the whole document before any access, which simply wastes computing resources (such as memory, time, and power) especially in mobile environment. To overcome this limitation, this paper proposes a new approach for compressing and encrypting large XML documents while maintaining queriability over the intermediate document representation. The proposed approach separates document structure from its contents using a variation of the Ctree XML indexing approach (known as the Ctree(+)), then applies context-free lossless encryption and compression techniques over the resulting Ctree(+) intermediate representations. Experiments results show that the proposed approach dramatically enhances queries response times when compared with existing approaches. However, the proposed approach provides lesser compression ratios when compared with context-based compression techniques.

Subject Keywords

Database languages, Information retrieval, , Indexing, Mobile computing, Data engineering, Data structures, Delay, Books, XML, Cryptography

URI

https://hdl.handle.net/11511/66302

Collections

Engineering, Conference / Seminar