METHODS AND SYSTEMS FOR INDEXING AND ACCESSING DOCUMENTS OVER CLOUD NETWORK

1 . A method of indexing a plurality of documents, the method comprising:

extracting, by a document accessing device, a series of values from each document, allocating, by a document accessing device, a bit array of a predetermined size in a memory,

constructing, by the document accessing device, a bloom filter based on the bit array, wherein each of a plurality of values in the bit array is hashed;

determining, by the document accessing device, density of the bloom filter;

iteratively tuning, by the document accessing device, the bit array until the density of the bloom filter is greater than a predetermined density level; and

storing, by the document accessing device, the tuned bit array in a storage folder, wherein a plurality of bit arrays of same size are grouped together.

2 . The method of claim 1 , wherein, constructing the bloom filter further comprises turning each value into a N-bit number.

3 . The method of claim 2 , wherein the N-bit number is 64.

4 . The method of claim 1 , wherein tuning further comprises:

calculating an error rate associated with the bloom filter; and

iteratively reducing the size of the bit array until the error rate associated with the bloom filter is at a maximum acceptable error rate.

5 . The method of claim 4 , wherein reducing the size of the bit array further comprises hash folding the bit array to reduce the size of the bit array.

6 . The method of claim 5 , wherein the size of the bit array is predetermined to accommodate a largest expected variety of data values, based on the predetermined error rate.

7 . The method of claim 1 , wherein constructing the bloom filter further comprises:

reading the plurality of input values in a streaming fashion;

hashing each of the plurality of input values to generate a plurality of hashed values; and

applying a modular reduction function to each of the plurality of hashed values using an index parameter, to generate a predetermined independent bit positions.

8 . The method of claim 1 further comprising:

transposing the bit arrays to enable one or more bits at a position to be retrieved together; and

merging a plurality of different small input files of same size into one large input file.

9 . The method of claim 1 further comprising:

identifying a folder having at least size 64 bit arrays, upon checking storage folders each having same size;

opening a read pointer to each of the identified files; and

creating an empty output file in an output storage location.

10 . The method of claim 1 further comprising writing a metadata summary stating position of original file identifiers

11 . A document accessing device for accessing a plurality of documents, the document accessing device comprising:

a processor; and

a memory communicatively coupled to the processor, wherein the memory stores processor instructions, which, on execution, causes the processor to:

allocate a bit array of a predetermined size in a memory,

construct a bloom filter based on the bit array, wherein each of a plurality of values in the bit array is hashed;

determine density of the bloom filter;

iteratively tune the bit array until the density of the bloom filter is greater than a predetermined density level; and

store the tuned bit array in a storage folder, wherein a plurality of bit arrays of same size are grouped together.

12 . The document accessing device of claim 11 , wherein, constructing the bloom filter further comprises turning each value into a N-bit number, and wherein the N-bit number is 64.

13 . The document accessing device of claim 1 , wherein tuning further comprises:

calculating an error rate associated with the bloom filter; and

iteratively tuning the bit array until the error rate associated with the bloom filter is at a maximum acceptable error rate.

14 . The document accessing device of claim 13 , wherein tuning the bit array further comprises hash folding the bit array to reduce the size of the bit array.

15 . The document accessing device of claim 14 , wherein the size of the bit array is predetermined to accommodate a largest expected variety of data values, based on the predetermined error rate.

16 . The document accessing device of claim 11 , wherein constructing the bloom filter further comprises:

reading the plurality of input values in a streaming fashion;

hashing each of the plurality of input values to generate a plurality of hashed values; and

applying a modular reduction function to each of the plurality of hashed values using an index parameter, to generate a predetermined independent bit positions.

17 . The document accessing device of claim 11 , wherein the processor instructions further cause the processor to:

transpose the bit arrays to enable one or more bits at a position to be retrieved together; and

merge a plurality of different small input files of same size into one large input file.

18 . The document accessing device of claim 11 , wherein the processor instructions further cause the processor to:

identify a folder having at least size 64 bit arrays, upon checking storage folders each having same size;

open a read pointer to each of the identified files; and

create an empty output file in an output storage location.

19 . The document accessing device of claim 11 , wherein the processor instructions further cause the processor to write a metadata summary stating position of original file identifiers

20 . A non-transitory computer-readable storage medium having stored thereon, a set of computer-executable instructions causing a computer comprising one or more processors to perform steps comprising:

allocating a bit array of a predetermined size in a memory,

constructing a bloom filter based on the bit array, wherein each of a plurality of values in the bit array is hashed;

determining density of the bloom filter;

iteratively tuning the bit array until the density of the bloom filter is greater than a predetermined density level; and

storing the tuned bit array in a storage folder, wherein a plurality of bit arrays of same size are grouped together.