Efficient Fuzzy Search Engine with B-Tree Search Mechanism
Simran Bijral, Debajyoti Mukhopadhyay

TL;DR
This paper introduces a novel fuzzy search engine that leverages B-tree search mechanisms to improve efficiency and incorporates security analysis for privacy preservation in cloud-based search systems.
Contribution
It formulates the problem of effective fuzzy search using tree search methodologies and explores B-trees for efficient keyword search with security considerations.
Findings
Enhanced search efficiency with B-tree based fuzzy search
Improved tolerance to typos and format inconsistencies
Secure and privacy-preserving search mechanism
Abstract
Search engines play a vital role in day to day life on internet. People use search engines to find content on internet. Cloud computing is the computing concept in which data is stored and accessed with the help of a third party server called as cloud. Data is not stored locally on our machines and the softwares and information are provided to user if user demands for it. Search queries are the most important part in searching data on internet. A search query consists of one or more than one keywords. A search query is searched from the database for exact match, and the traditional searchable schemes do not tolerate minor typos and format inconsistencies, which happen quite frequently. This drawback makes the existing techniques unsuitable and they offer very low efficiency. In this paper, we will for the first time formulate the problem of effective fuzzy search by introducing tree…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Spam and Phishing Detection · Blockchain Technology Applications and Security
