CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
Reseach Article

Supporting Ranking Queries for Search-As-You-Type in Databases using WIP

by Kaushik G. Vaghani, Pratik A. Patel
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 95 - Number 9
Year of Publication: 2014
Authors: Kaushik G. Vaghani, Pratik A. Patel
10.5120/16625-6478

Kaushik G. Vaghani, Pratik A. Patel . Supporting Ranking Queries for Search-As-You-Type in Databases using WIP. International Journal of Computer Applications. 95, 9 ( June 2014), 36-41. DOI=10.5120/16625-6478

@article{ 10.5120/16625-6478,
author = { Kaushik G. Vaghani, Pratik A. Patel },
title = { Supporting Ranking Queries for Search-As-You-Type in Databases using WIP },
journal = { International Journal of Computer Applications },
issue_date = { June 2014 },
volume = { 95 },
number = { 9 },
month = { June },
year = { 2014 },
issn = { 0975-8887 },
pages = { 36-41 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume95/number9/16625-6478/ },
doi = { 10.5120/16625-6478 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:19:02.263444+05:30
%A Kaushik G. Vaghani
%A Pratik A. Patel
%T Supporting Ranking Queries for Search-As-You-Type in Databases using WIP
%J International Journal of Computer Applications
%@ 0975-8887
%V 95
%N 9
%P 36-41
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Most of the search engines in Internet have simplified keyword-based search concept. The relational database management systems do not allow keyword-based search while they offers powerful query languages. Existing search systems that are based on keyword in relational database require users to submit a complete query to compute answers. Often users have limited knowledge about the data, and have to use a try and see method to modify queries and find the answers. Search-as-you-type is a search system that allows the user to submit the prefix of the keyword and system will compute the answer as user type keyword character by character for data stored in a relational database management systems. A main challenge is how to influence existing database functionalities to achieve high-performance in searching speed and how to support ranking queries that provide the most frequently searched results at top position in computed result. The proposed technique shows how to use weights of records stored as an auxiliary tables to increase search performance. I have proposed solutions for single-keyword queries and develop a new technique, weighted index-based technique called WIP-based searching that supports ranking queries for searching records based on prefix of keywords by using additional weight table stored as auxiliary table. My main approach is to push the weight constraints into index-based techniques. By this new WIP-based technique of search-as-you-type, query result gives the records based upon frequency of usage.

References
  1. 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.
  2. 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.
  3. Hao Wu. "Search-As-You-Type in Forms: Leveraging the Usability and the Functionality of Search Paradigm in Relational Databases. " VLDB (PhD Workshop), 36-41. 2010. Accessed February 7, 2012.
  4. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using banks. In ICDE, pages 431–440, 2002.
  5. Guoliang Li, Jianhua Feng, Chen Li, "Supporting Search-As-You-Type Using SQL in Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 2, pp. 461-475, Feb. 2013
  6. 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.
  7. Daniel Suelmann, "Keyword-based Search in a Relational Database" Bachelor's Thesis, Department of Information Science Faculty of Arts University of Groningen August 2009
  8. F. Liu, C. T. Yu, W. Meng, and A. Chowdhury, "Effective Keyword Search in Relational Data Bases," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '06), pp. 563-574, 2006.
  9. 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.
  10. M. Hadjieleftheriou, A. Chandel, N. Koudas, and D. Srivastava, "Fast Indexes and Algorithms for Set Similarity Selection Queries," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE '08), pp. 267-276, 2008.
  11. C. Li, J. Lu, and Y. Lu, "Efficient Merging and Filtering Algorithms for Approximate String Searches," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE '08), pp. 257-266, 2008.
Index Terms

Computer Science
Information Sciences

Keywords

WIPTables technique – Weighted Inverted-Index Prefix Table technique