An Alternate Idea for Storage Optimization in Search Engine | Zendy

Anirban Kundu | Zendy; Siddhartha Sett | Zendy; Subhajit Kumar | Zendy; Shruti Sengupta | Zendy; Srayan Chaudhury | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Alternate Idea for Storage Optimization in Search Engine

Author(s) -

Anirban Kundu,

Siddhartha Sett,

Subhajit Kumar,

Shruti Sengupta,

Srayan Chaudhury

Publication year - 2011

Publication title -

international journal of computer and communication technology

Language(s) - English

Resource type - Journals

eISSN - 2231-0371

pISSN - 0975-7449

DOI - 10.47893/ijcct.2011.1103

Subject(s) - search engine indexing , computer science , space (punctuation) , search engine , hamming space , hamming distance , theoretical computer science , algorithm , hamming code , information retrieval , decoding methods , operating system , block code

We propose an alternate indexing storage technique of Search Engine. In this approach, we achieve reduced space complexity. We try to decrease time complexity for faster data retrieval and decrease storage space for efficient utilization of space. This paper provides an algorithm of indexing mechanism by which effective storage space is reduced. Space complexity of a Search Engine depends on the indices created by the indexing algorithm. Hamming distance concept is used to achieve better result.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research