Improved Fuzzy Technology for Efficient Searching
Keywords:
instant searching, fuzzy searching, computing all, segmentationAbstract
Instant searching technique finds answers to a query instantly when user types in keywords characterby-character. Fuzzy searching is advancement in instant searching which finds perfect matching keywords to query keywords. User expects fast results within few milliseconds and perfect match. The main challenge in this is the high-speed requirement, i.e., each query needs to be answered within milliseconds to achieve an instant response and a high query throughput. Number of fuzzy techniques such as compute all, early termination technique and segmentation technique are being used. Each of them as various difficulties that they requires more time to search in case of large data and space required is also more. The accuracy is also less as they are not providing relevant answers. In this paper I will be studying available techniques and new proposed algorithm. It will be compared with existing techniques with regard to time, space and relevancy.
References
Cetindil, J. Esmaelnezhad, C. Li, and Chen Li. “Efficent instant fuzzy search with proximaty ranking” in IEEE, July 2014.
I. Cetindil, J. Esmaelnezhad, C. Li, and D. Newman, “Analysis of instant search query logs,” in WebDB, 2012, pp. 7-12. Adding Persuasive features in Graphical Password to increase the capacity of KBAM, Uma D. Yadav, Prakash S. Mohod Computer Science & Engineering G. H. R. I. E. T. W. Nagpur, India
C. Silverstein, M. R. Henzinger, H. Marais, and M. Moricz, “Analysis of a very large web search engine query log,” SIGIR Forum, vol. 33, no. 1, pp. 6-12, 1999.
G. Li, J. Wang, C. Li, and J. Feng, “Supporting efcient top-k queries in type-ahead search,” in SIGIR, 2012, pp. 355-364.
R. Schenkel, A. Broschart, S. won Hwang, M. Theobald, and G. Weikum,“Efcient text proximity search,” in SPIRE, 2007, pp. 287- 299.
H. Yan, S. Shi, F. Zhang, T. Suel, and J.-R. Wen, “Efcient term proximity search with term-pair indexes,” in CIKM, 2010, pp. 1229- 1238.
H. Bast and I. Weber, “Type less, nd more: fast autocompletion search with a succinct index,” in SIGIR, 2006, pp. 364-371.
H. Bast and I. Weber, “The completesearch engine: Interactive, efcient, and towardsirdb integration,” in CIDR, 2007, pp. 88-95.
S. Ji, G. Li, C. Li, and J. Feng, “Efcient interactive fuzzy keyword search,” in WWW, 2009, pp. 371-380.
S. Chaudhuri and R. Kaushik, “Extending autocompletion to tolerate errors,” in SIGMOD Conference, 2009, pp. 707-718.
G. Li, S. Ji, C. Li, and J. Feng, “Efcient type-ahead search on relational data: a tastier approach,” in SIGMOD Conference, 2009, pp. 695-706.39
M. Hadjieleftheriou and C. Li, “Efcient approximate search on string collec- tions,” PVLDB, vol. 2, no. 2, pp. 1660-1661, 2009.
K. Chakrabarti, S. Chaudhuri, V. Ganti, and D. Xin, “An efcientlter for approximate membership checking,” in SIGMOD Conference, 2008, pp. 805-818.
S. Chaudhuri, V. Ganti, and R. Motwani, “Robust identication of fuzzy du- plicates,” in ICDE, 2005, pp. 865-876.
Behm, S. Ji, C. Li, and J. Lu, “Space-constrained grambased indexing forefcient approximate string search,” in ICDE, 2009, pp. 604-615.
Fagin, A. Lotem, and M. Naor, “Optimal aggregation algorithms for mid- dleware,” in PODS, 2001.
F. Zhang, S. Shi, H. Yan, and J.-R. Wen, “Revisiting globally sorted indexes forefcient document retrieval,” in WSDM, 2010, pp. 371-380.
M. Persin, J. Zobel, and R. Sacks-Davis, “Filtered document retrieval with frequency- sorted indexes,” JASIS, vol. 47, no. 10, pp. 749-764, 1996
R. Song, M. J. Taylor, J.-R. Wen, H.-W. Hon, and Y. Yu,
“Viewing term proximity from a diff erent perspective,” in
ECIR, 2008, pp. 346-357.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2015 COMPUSOFT: An International Journal of Advanced Computer Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
©2023. COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY by COMPUSOFT PUBLICATION is licensed under a Creative Commons Attribution 4.0 International License. Based on a work at COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY. Permissions beyond the scope of this license may be available at Creative Commons Attribution 4.0 International Public License.
