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

51
views

0
downloads

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

DOI

https://doi.org/10.1109/iscis.2009.5291834

Conference Name

24th International Symposium on Computer and Information Sciences

Collections

Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Privacy preserving database external layer construction algorithm via secure decomposition for attribute-based security policies Turan, Uğur; Toroslu, İsmail Hakkı; Kantarcıoğlu, Murat; Department of Computer Engineering (2018) Relational DBMS’scontinue to dominate th emarket an dinference problem on external schema has preserved its importance in terms of data privacy. Especially for the last 10 years, external schema construction for application-speciﬁc database usage has increased its independency from the conceptual schema, as the deﬁnitions and implementations of views and procedures have been optimized. After deﬁning all mathematical background, this work offers an optimized decomposition strategy for the external schema, wh...
A comparative evaluation of XML repositories Ünal, Özgül; Doğaç, Asuman; Department of Information Systems (2002) Recently XML has established itself as the standard for representing data in scientific and business applications. Starting out as a standard data exchange format over the web, it has become instrumental in all kinds of applications. Almost all standardization efforts on the web today are based on XML. As a consequence, the amount of XML data being stored and processed is large and will be increasing at a very rapid rate. This has caused XML data management to become a focus of research efforts in the datab...
Improving the performance of Hadoop/Hive by sharing scan and computation tasks Özal, Serkan; Toroslu, İsmail Hakkı; Doğaç, Asuman; Department of Computer Engineering (2013) MapReduce is a popular model of executing time-consuming analytical queries as a batch of tasks on large scale data. During simultaneous execution of multiple queries, many oppor- tunities can arise for sharing scan and/or computation tasks. Executing common tasks only once can reduce the total execution time of all queries remarkably. Therefore, we propose to use Multiple Query Optimization (MQO) techniques to improve the overall performance of Hadoop Hive, an open source SQL-based distributed warehouse sy...
An index structure for fuzzy databases Yazıcı, Adnan (1996-09-11) Fuzzy querying involves more complex processing than ordinary querying does. In addition, a larger number of tuples will possibly be selected by fuzzy conditions compared to the crisp ones. The current index structures are inefficient in representing and dealing with uncertain and fuzzy data. In this paper we extend one of the multi-dimensional data structures, namely Multi Lever Grid File (Whang and Krishnamurty, 1991) for an efficient access to both crisp and fuzzy data. In order to take advantage of the ...
Design and analysis of hash functions Koçak, Onur; Doğanaksoy, Ali; Department of Cryptography (2009) Hash functions are cryptographic tools that are used in various applications like digital signature, message integrity checking, password storage and random number generation. These cryptographic primitives were, first, constructed using modular arithmetical operations which were popular at that time because of public key cryptography. Later, in 1989, Merkle and Damgard independently proposed an iterative construction method. This method was easy to implement and had a security proof. MD-4 was the first has...

Citation Formats

I. Elgedawy, B. Srivastava, and S. Mittal, “Exploring Queriability of Encrypted and Compressed XML Data,” Guzelyurt, CYPRUS, 2009, p. 141, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66302.