Wildcard Search using Fuzzy Auto Completion

Authors

  • Ansari Aadil Salim  MMANTC, Department of Computer Engineering, Malegaon, India
  • Ansari Shawana Aadil  Department of Electronics and Communication, SSVPS BSD COE, Dhule, India
  • Ansari Zeeshan Salim  Department of Computer Engineering, SSVPS BSD COE, Dhule, India

Keywords:

Autocompletion, wildcard, databases, SQL, fuzzy, DBMS.

Abstract

Most popular information discovery method is through keyword search, as user does not need to know either the underlying structure of the data and a query language. The search engines available today provide keyword search on top of sets of documents. While traditional database management systems offer powerful query languages, they do not allow keyword-based search and we focus on how to support this type of search using the native database language, SQL. Searching in a relational in a relational database is not an easy task because the data present are complicated. Wildcard search is a search with a character that can be used to substitute for any other character(s) in a string. Fuzzy autocompletion method is used to generate the results by typing incomplete keyword character by character. In this paper we are combining the property of both the techniques wildcard search and the fuzzy autocompletion to generate the search results efficiently. Using the above method we present solutions for both single-keyword queries and multi keyword queries, and develop novel techniques for on the fly search using SQL by allowing mismatches between query keywords and answers. Experiments on large, real data sets show that our techniques enable DBMS systems to support on-the-fly search on tables with millions of records.

References

  1. A. Nandi and H.V. Jagadish, “Effective Phrase Prediction,” Proc.33rd Int’l Conf. Very Large Data Bases (VLDB ’07), pp. 219-230, 2007.
  2. H. Bast, A. Chitea, F.M. Suchanek, and I. Weber, “ESTER: Efficient Search on Text, Entities, and Relations,” Proc. 30th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’07), pp. 671-678, 2007.
  3. H. Bast and I. Weber, “Type Less, Find More: Fast Autocompletion Search with a Succinct Index,” Proc. 29th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’06), pp. 364-371, 2006.
  4. S. Ji, G. Li, C. Li, and J. Feng, “Efficient Interactive Fuzzy Keyword Search,” Proc. 18th ACM SIGMOD Int’l Conf. World Wide Web (WWW), pp. 371-380, 2009.
  5. S. Chaudhuri and R. Kaushik, “Extending Autocompletion to Tolerate Errors,” Proc. 35th ACM SIGMOD Int’l Conf. Management of Data (SIGMOD ’09), pp. 433-439, 2009.
  6. G. Li, S. Ji, C. Li, and J. Feng, “Efficient Type-Ahead Search on Relational Data: A Tastier Approach,” Proc. 35th ACM SIGMOD Int’l Conf. Management of Data (SIGMOD ’09), pp. 695-706, 2009.
  7. L. Qin, J.X. Yu, and L. Chang, “Keyword Search in Data Bases: The Power of Rdbms,” Proc. 35th ACM SIGMOD Int’l Conf. Management of Data (SIGMOD ’09), pp. 681-694, 2009.
  8. G. Li, J. Fan, H. Wu, J. Wang, and J. Feng, “Dbease: Making Data Bases User-Friendly and Easily Accessible,” Proc. Conf. Innovative Data Systems Research (CIDR), pp. 45-56, 2011.
  9. L. Gravano, P.G. Ipeirotis, H.V. Jagadish, N. Koudas, S.Muthukrishnan, and D. Srivastava, “Approximate String Joins in a Data Base (Almost) for Free,” Proc. 27th Int’l Conf. Very Large Data Bases (VLDB ’01), pp. 491-500, 2001.
  10. S. Chaudhuri, K. Ganjam, V. Ganti, R. Kapoor, V. Narasayya, and T. Vassilakis, “Data Cleaning in Microsoft SQL Server 2005,” Proc. ACM SIGMOD Int’l Conf. Management of Data (SIGMOD ’05), pp. 918-920, 2005.
  11. S. Agrawal, K. Chakrabarti, S. Chaudhuri, and V. Ganti, “Scalable Ad-Hoc Entity Extraction from Text Collections,” Proc. VLDB Endowment, vol. 1, no. 1, pp. 945-957, 2008.
  12. G. Li, J. Feng, X. Zhou, and J. Wang, “Providing Built-in Keyword Search Capabilities in Rdbms,” VLDB J., vol. 20, no. 1, pp. 1-19, 2011.
  13. G. Li, J. Feng and Chen Li,” Supporting Search-As-You-Type Using SQL in Databases,” IEEE transactions on knowledge and data engineering, vol. 25, no. 2, february 2013
  14. E. Ukkonen, “Finding Approximate Patterns in Strings,” J. Algorithms, vol. 6, no. 1, pp. 132-137, 1985.
  15. http://dblp.uni-trier.de/
  16. http://www.dustindiaz.com/autocomplete-fuzzy-matching
  17. http://en.wikipedia.org/wiki/Wildcard_character
  18. http://www.w3schools.com/sql/sql_wildcards.asp
  19. http://www.youtube.com

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2017-06-30

Issue

Volume 2, Issue 3, May-June-2017

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Ansari Aadil Salim, Ansari Shawana Aadil, Ansari Zeeshan Salim, " Wildcard Search using Fuzzy Auto Completion, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 3, pp.219-226, May-June-2017.