A Novel Adjustable Matrix Bloom Filter-Based Copy Detection System for Digital Libraries

Abstract

With the increasing volume of on-line literatures on the Internet and the simplicity of finding and downloading data, dishonest use of the findings of others, known as plagiarism, is getting worse and worse. Therefore, there is a need to be a copy detection system to address this problem in an efficient way. Most current systems only focus on one goal, estimating similarity with highest accuracy, i.e. 100%. While, in some real applications, it can be useful to take into account other factors such as query speed, memory usage and security of content at the cost of reducing accuracy by a few percentages. In this paper, we propose an innovative adjustable copy-paste detection system which provides an adjustable property on mentioned factors according to the application requirements. The main core of our design is a new extension of Bloom filters, called Matrix Bloom Filter (MBF), which provides the adjustability of the system. A matrix Bloom filter is defined as a bit matrix in which each entry can only be set or reset. It is utilized to efficiently maintain all documents of libraries. Based on our knowledge, this is the first work using the idea behind Bloom filters to solve copy-paste detection problem while ensuring the privacy of document content and also the first work aiming to provide this adjustable property. The experimental results show that our proposed approach provides three main improvements, including enhancing the speed of querying operation up to 2.7 times, diminishing the memory required and providing the security of content besides allowing an adjustable trade-off among all aforesaid factors.

High speed filtering for mutual privacy protection in SNS using multistage bloom filter

“…A query encryption method for encrypted database is proposed by Arai et al [11]. Bloom filter is also applied for copy detection system by Geravand et al [12]. Still more, there are some researches [13]- [19] for enhancing security with Bloom filter.…”

Optimizing Bloom Filter: Challenges, Solutions, and Comparisons

“…Typically, to realize the minimum false positive rate, the bit utilization in a standard BF is only 50%. Therefore, multiple works have been conducted to tackle this issue [99] [100] [101] [102] [103].…”

“…Matrix BF. A Matrix BF is a bit matrix in which each bit can be set or reset to detect copy-paste contents in a literature library [103]. The matrix BF consists of N rows each of which records the contents in one document.…”

“…This will significantly reduce the memory access frequency. The space efficiency is not only about the utilization of bits in a BF (e.g., Compressed BF [99], Compacted BF [100], dlCBF [101], Memory-optimized BF [102], and Matrix BF [103]), but also the global space utilization in a system where both fast RAM and secondary memory (e.g., SSD) are jointly employed [106]. Lastly, for negative query results, when the query algorithm encounters the first zero bit, the algorithm should be terminated and return a negative result.…”

Detecting Text Similarity on a Scalable No-SQL Database Platform

“…For example, use of probabilistic data structure called Bloom filter [7] was suggested as a way to increase the speed of text comparison [8] [9]. The approach provided reasonable results in terms of the speed and quality of the detection but has an obvious applicability limitation as it assumes storing shingles in the RAM.…”