arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1411.6773cs.IR
收藏

基于B树搜索机制的高效模糊搜索引擎

Efficient Fuzzy Search Engine with B-Tree Search Mechanism

Simran Bijral, Debajyoti Mukhopadhyay

摘要:

搜索引擎在互联网上的日常生活中起着至关重要的作用。人们使用搜索引擎在互联网上查找内容。云计算是一种计算概念,其中数据在称为云的第三方服务器的帮助下存储和访问。数据不存储在本地的机器和软件和信息提供给用户,如果用户需要它。搜索查询是在互联网上搜索数据的最重要的部分。搜索查询由一个或多个关键字组成。搜索查询是从数据库中搜索精确匹配的,传统的可搜索方案不能容忍经常发生的轻微的拼写错误和格式不一致。这一缺点使得现有技术不适合,并且它们提供非常低的效率。在本文中,我们将首次制定的问题,有效的模糊搜索引入树搜索方法。我们将探索B树在搜索机制中的好处,并使用它们来进行有效的关键字搜索。我们严格考虑了系统的安全性分析,以保证系统的安全性和隐私保护。

英文摘要:

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 search methodologies. We will explore the benefits of B trees in search mechanism and use them to have an efficient keyword search. We have taken into consideration the security analysis strictly so as to get a secure and privacy-preserving system.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑