期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：3
DOI：10.15680/ijircce.2015.0303213
出版社：S&S Publications
摘要：This work deals with the approximate string search in large spatial databases. To investigate rangequeries augmented with a string similarity search predicate in both Euclidean space and road networks. This query isspatial approximate string (SAS) query. A query is used to access only certain information at a time. a database query isa function of database software. In Euclidean space, to propose an approximate solution, the MHR-tree, which embedsmin-wise signatures into an R-tree. The min-wise signature for an index node u keeps a concise representation of theunion of q-grams from strings under the sub-tree of u. to analyze the pruning functionality of such signatures based onthe query string and q-grams from the sub trees of ides nodes.
关键词：spatial databases; approximate string search; range query; road network.
