Survey of Spatial Approximate String Search
Journal Title: INTERNATIONAL JOURNAL OF COMPUTER TRENDS & TECHNOLOGY - Year 2013, Vol 6, Issue 3
Abstract
Several applications require finding objects closest to a specified location that contains a set of keywords. In view of example, online yellow pages allow users to specify an address and a set of keywords. In response, the user obtains a list of businesses whose description contains these keywords and it ordered according to their distance from the specified address. The complexities of nearest neighbor search on spatial data and keyword search on text data have been extensively studied separately. Still, to the best of our knowledge there is no efficient method to answer spatial keyword queries,exclusively, queries that specify both a location and a set of keywords. We survey the current techniques to cope with the problem of string matching that allows errors. For many fast rising areas such as information retrieval and computational biology this is becoming a more and more relevant issue. We focus on spatial string searching and mostly on edit distance, its statistical behavior, its history and current developments, and the central ideas of the techniques and their difficulties. The aim of this survey is to present an overview of the state of the art in approximate string searching.
Authors and Affiliations
B. Ramya
Risk Management a t Universities Illegal Residents in Hostels & Fire Cases
Every organization/institution is exposed to some kinds of risks that can affect them in many ways. Risks like fire, theft, damage of assets, illegal intruders etc. can affect them strategically, financially and operatio...
A Novel Approach to Detect Spam Worms Propagation with Monitoring the Footprinting
One of the key security threats on the Internet are the compromised machines that can be used to launch various security attacks such as spamming and spreading malware, accessing useful information and DDoS. Attackers fo...
An Imperial Investigation of Validation Problem of Top Indian Websites
This paper results the report of an experimental study on the validation problem of the web pages developed by the web developers. It is found that there are very few web pages which are “VALID” and most of them are “INV...
LWRP: Low Power Consumption Weighting Replacement Policy using Buffer Memory
As the performance gap between memory and processors has increased, then it leads to the poor performance. Efficient virtual memory can overcome this problem. And the efficiency of virtual memory depends on the replaceme...
Automatic Database Clustering: Issues and Algorithms
Clustering is the process of grouping of data, where the grouping is established by finding similarities between data based on their characteristics. Such groups are termed as Clusters. Clustering is an unsupervised lear...