Supporting Search-As-You-Type Using SQL in Databases

  IJCTT-book-cover
 
International Journal of Computer Trends and Technology (IJCTT)
 
© 2014 by IJCTT Journal
Volume-16 Number-5 
Year of Publication : 2014
Authors : C. Bhagya Laxmi , Bhaludra Raveendranadh Singh , Moligi Sangeetha

MLA

C. Bhagya Laxmi , Bhaludra Raveendranadh Singh , Moligi Sangeetha. "Supporting Search-As-You-Type Using SQL in Databases". International Journal of Computer Trends and Technology (IJCTT) V16(5):185-188, Oct 2014. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
A search-as-you-type system determines answers while a user types a keyword query character by character. We study the search-as-you-type on data which is residing in a relational DBMS. We focus on native database language, SQL as how to support this type of search. A main challenge is how to make full use of existing database functionalities to meet the high-performance to achieve an interactive speed. Further we study how to use auxiliary indexes stored in the tables to increase the search performance. We present solutions for both multi keyword queries and single-keyword queries, and develop novel techniques for the fuzzy search using SQL by allowing the mismatches between query keywords and answers. Since the volume of data increases day to day the real world, the searching process has become unvaried. The good search technique must be render the requested data in a stipulated time based on the user requested query. Using the native query language, i.e SQL to implement search-as-you-type reduces programming effort. Here we are providing user requested result based on the user previous search.

References
[1] 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.
[2] S. Agrawal, S. Chaudhuri, and G. Das, “DBXplorer: A System for Keyword-Based Search over Relational Data Bases,” Proc. 18th Int’l Conf. Data Eng. (ICDE ’02), pp. 5-16, 2002.
[3] A. Arasu, V. Ganti, and R. Kaushik, “Efficient Exact Set-Similarity Joins,” Proc. 32nd Int’l Conf. Very Large Data Bases (VLDB ’06), pp. 918-929, 2006.
[4] 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.
[5] 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.
[6] H. Bast and I. Weber, “The Complete Search Engine: Interactive,Efficient, and Towards IR & DB Integration,” Proc. Conf. Innovative Data Systems Research (CIDR), pp. 88-95, 2007.

References
databases, Search-as-you-type , fuzzy search, SQL