MHR-Tree Based Spatial Approximate String Search |
Author(s): |
| Miss. Ashvini Shankarrao Shingare , MGM college of engineering,Nanded; Miss. Ashvini Shingare, MGM college of enginnering,Nanded; Miss. Nitu Pariyal, MGM college of enginnering,Nanded |
Keywords: |
| MHR, Spatial Approximate String (SAS), String Search |
Abstract |
|
Keyword search in a large amount of data is very essential factor in data mining. This project focuses on keyword search, called as spatial approximate string search (SASS).A main limitation of the approximate search is that it only supports exact keyword search in a large amount of data. Keyword search for retrieving estimated string matches is required. Since, exact match is a special case of approximate string match, it is clear that keyword search by approximate string matches has a much larger pool of applications. In this work, we focus on range queries and name such queries as Spatial Approximate String (SAS) queries. (i.e. ESAS, RSAS). We have to efficiently find that string in the collection that is similar to a query string. Such type of query is called an "approximate string search". |
Other Details |
|
Paper ID: IJSRDV6I20090 Published in: Volume : 6, Issue : 2 Publication Date: 01/05/2018 Page(s): 130-133 |
Article Preview |
|
|
|
|
