A Novel Approach to Spatial Approximate String Search by Using RSASSOL Algorithm
Abstract
We also discuss how to estimate the selectivity of a SAS query in Euclidean space, for which we present a novel adaptive algorithm to find balanced partitions using both the spatial and string information stored in the tree. For queries on road networks, we propose a novel exact method, RSASSOL, which significantly outperforms the baseline algorithm in practice. The RSASSOL combines the q-gram based inverted lists and the reference nodes based pruning. Extensive experiments on large real data sets demonstrate the efficiency and effectiveness of our approaches.
Keywords
Spatial Approximate String (SAS); Approximate String Search; Range Query; Road Network; Spatial Databases; RSASSOL Method
Full Text:
PDFCopyright (c) 2015 Aakunuru. Rahul, Laxman Golla
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
All published Articles are Open Access at https://journals.pen2print.org/index.php/ijr/
Paper submission: ijr@pen2print.org