The VLDB journal : the international journal on very large data bases.

Digital watermarking for relational databases emerged as a candidate so- lution to provide copyright protection, tamper detection, traitor tracing, maintaining integrity of relational data. Many watermarking techniques have been proposed in the literature to address these purposes. In this paper, we survey the current state-of-the- art and we classify them according to their intent, the way they express the watermark, the cover type, the granularity level, and their verifiability.

/pdf/watermarking-techniques-for-relational-databases-survey-4ghct4di08.pdf

Watermarking Techniques for Relational Databases: Survey, Classification and Comparison

We put forward a fragile zero watermarking scheme to detect and characterize malicious modifications made to a database relation. Most of the existing watermarking schemes for relational databases introduce intentional errors or permanent distortions as marks into the database original content. These distortions inevitably degrade the data quality and data usability as the integrity of a relational database is violated. Moreover, these fragile schemes can detect malicious data modifications but do not characterize the tempering attack, that is, the nature of tempering. The proposed fragile scheme is based on zero watermarking approach to detect malicious modifications made to a database relation. In zero watermarking, the watermark is generated (constructed) from the contents of the original data rather than introduction of permanent distortions as marks into the data. As a result, the proposed scheme is distortion-free; thus, it also resolves the inherent conflict between security and imperceptibility. The proposed scheme also characterizes the malicious data modifications to quantify the nature of tempering attacks. Experimental results show that even minor malicious modifications made to a database relation can be detected and characterized successfully.

/pdf/a-fragile-zero-watermarking-scheme-to-detect-and-3umd0kfje0.pdf

A Fragile Zero Watermarking Scheme to Detect and Characterize Malicious Modifications in Database Relations

In this paper we introduce a distortion free watermarking technique for relational databases based on the Abstract Interpretation framework. The watermarking technique is partition based. The partitioning can be seen as a virtual grouping, which does not change neither the value of the table's elements nor their physical positions. Instead of inserting the watermark directly to the database partition, we treat it as an abstract representation of that concrete partition, such that any change in the concrete domain reflects in its abstract counterpart. The main idea is to generate a binary image of the partition as a watermark of that partition, that serves as ownership proof as well as tamper detection.

/pdf/a-generic-distortion-free-watermarking-technique-for-1odk1unttj.pdf

A Generic Distortion Free Watermarking Technique for Relational Databases

A variety of systems with possibly embedded computing power, such as small portable robots, hand-held computers, and automated vehicles, have power supply constraints. Their batteries generally last only for a few hours before being replaced or recharged. It is important that all design efforts are made to conserve power in those systems. Energy consumption in a system can be reduced using a number of techniques, such as low-power electronics, architecture-level power reduction, compiler techniques, to name just a few. However, energy conservation at the application software-level has not yet been explored. In this paper, we show the impact of various software implementation techniques on energy saving. Based on the observation that different instructions of a processor cost different amount of energy, we propose three energy saving strategies, namely (i) assigning live variables to registers, (ii) avoiding repetitive address computations, and (iii) minimizing memory accesses. We also study how a variety of algorithm design and implementation techniques affect energy consumption. In particular, we focus on the following aspects: (i) recursive versus iterative (with stacks and without stacks), (ii) different representations of the same algorithm, (iii) different algorithms - with identical asymptotic complexity - for the same problem, and (iv) different input representations. We demonstrate the energy saving capabilities of these approaches by studying a variety of applications related to power-conscious systems, such as sorting, pattern matching, matrix operations, depth-first search, and dynamic programming. From our experimental results, we conclude that by suitably choosing an algorithm for a problem and applying the energy saving techniques, energy savings in excess of 60% can be achieved.

Software implementation strategies for power-conscious systems.

Problem statement: Digital multimedia watermarking technology was suggested in the last decade to embed copyright information in digital objects such images, audio and video. However, the increasing use of relational database systems in many real-life applications created an ever increasing need for watermarking database systems. As a result, watermarking relational database systems is now merging as a research area that deals with the legal issue of copyright protection of database systems. Approach: In this study, we proposed an efficient database watermarking algorithm based on inserting binary image watermarks in non-numeric mutli-word attributes of selected database tuples. Results: The algorithm is robust as it resists attempts to remove or degrade the embedded watermark and it is blind as it does not require the original database in order to extract the embedded watermark. Conclusion: Experimental results demonstrated blindness and the robustness of the algorithm against common database attacks.

/pdf/robust-and-blind-watermarking-of-relational-database-systems-3u70oa3l25.pdf

Robust and Blind Watermarking of Relational Database Systems

Text categorization is the process of grouping documents into categories based on their contents. This process is important to make information retrieval easier, and it became more important due to the huge textual information available online. The main problem in text categorization is how to improve the classification accuracy. Although Arabic text categorization is a new promising field, there are a few researches in this field. This paper proposes a new method for Arabic text categorization using vector evaluation. The proposed method uses a categorized Arabic documents corpus, and then the weights of the tested document's words are calculated to determine the document keywords which will be compared with the keywords of the corpus categorizes to determine the tested document's best category.

Arabic Text Categorization Algorithm using Vector Evaluation Method

Watermarking relational databases is an emerging research area that deals with the legal issue of copyright protection of relational databases. In this paper, we propose an efficient database watermarking algorithm based on inserting a binary image watermark in the dasiatimepsila attribute of database tuples. Experimental results demonstrate the robustness of the proposed algorithm against common database attacks.

Watermarking relational database systems

Arabic language is distinguished by its morphologic al richness, which forces the workers in the field of Arabic language Processing (i.e., information retri eval, document’s classification, text summarizing) to deal with many words that seem to be different but in re ality they came from an identical root word. One of the methods to overcome this problem is to return the w ords to their roots. This research aims to provide a new algorithm, that returns roots of Arabic words using n-gram technique without using morphological rules in order to avoid the complexity arising from the morp hological richness of the language in one hand and the multiplicity of morphological rules in other hand. The proposed algorithm uses a list that contains ov er 4,500 identical roots words.

/pdf/an-improved-arabic-word-s-roots-extraction-method-using-n-4zroe0n6fb.pdf

An improved arabic word's roots extraction method using n-gram technique

The Arabic language is characterized by its rich and complex morphology based on root-pattern schemes. Root extraction is one of the most important topics in the context of natural language processing applications such as information retrieval, text processing, machine translation, speech tagging, etc. This paper presents a method to extract the trilateral roots of Arabic words, acting from the roots of three consonants, through the removal of the prefixes and the suffixes, and the use of a list of morphological weights. Experimental results based on a list of eleven different root inflections shows the effectiveness of the proposed method with a success rate of 94%.

/pdf/arabic-roots-extraction-using-morphological-analysis-30lkcxm4qr.pdf

Ashraf Odeh

Papers

Robust and Blind Watermarking of Relational Database Systems

Arabic Text Categorization Algorithm using Vector Evaluation Method

Watermarking relational database systems

An improved arabic word's roots extraction method using n-gram technique

Arabic Roots Extraction Using Morphological Analysis