A Novel Document Retrieval Scheme using Relational Keyword Search System
|
10.5120/21808-5127 |
Neelam S Pokale and Jyoti R Yemul. Article: A Novel Document Retrieval Scheme using Relational Keyword Search System. International Journal of Computer Applications 122(19):17-20, July 2015. Full text available. BibTeX
@article{key:article,
author = {Neelam S. Pokale and Jyoti R. Yemul},
title = {Article: A Novel Document Retrieval Scheme using Relational Keyword Search System},
journal = {International Journal of Computer Applications},
year = {2015},
volume = {122},
number = {19},
pages = {17-20},
month = {July},
note = {Full text available}
}
Abstract
Keyword search pattern to relational data is the most important and the highlighted area within a search and information retrieval community. For the system evaluations, there are many approaches followed but there is a lack of standardization. The result of lack of standardization affects performance of the system. The number of queries completed successfully in a query workload is performance wise not showing good results for relational keyword search system. The solution to above problem is to develop a novel technique for efficient document retrieval using relational keyword search system. The new system is developed to manage uploading and downloading of data from disk to improve performance and reuse dataset and query workload to provide greater consistency of results. A scalable document retrieval improves the search performance in terms of execution time, cost efficiency and apply ranking to the document depends on query weight. The new system gives 30% to 40% reduction in the search execution time compared to the existing system.
References
- J. Coffman and A. C. Weaver ,"An Empirical Performance Evaluation of Relational Keyword Search Systems", IEEE Transactions on Knowledge and Data Engineering,Vol. 26 , 2014.
- R. Vernica and C. Li, "Efficient Top-k Algorithms for Fuzzy Search in String Collections" , ACM, KEYS'09, June 28, 2009.
- J. Coffman and A. C. Weaver, "A Framework for Evaluating Database Keyword Search Strategies," in Proceedings of the 19th ACM International Conference on Information and Knowledge Management,ser. CIKM '10, 2010, pp. 729–738. [Online]. Available: http://doi. acm. org/10. 1145/1871437. 1871531.
- A. Baid, I. Rae, J. Li, A. Doan, and J. Naughton, "Toward Scalable Keyword Search over Relational Data," Proceedings of the VLDB Endowment, vol. 3, 2010 ,pp. 140–149.
- G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan,"Keyword Searching and Browsing in Databases using BANKS," in Proceedings of the 18th International Conference on Data Engineering,ser. ICDE '02, 2002, pp. 431–440.
- Y. Chen, W. Wang, Z. Liu, and X. Lin, "Keyword Search on Structured and Semi-Structured Data," in Proceedings of the 35th SIGMOD International Conference on Management of Data, ser. SIGMOD '09, 2009, pp. 1005–1010.
- B. Ding, J. X. Yu, S. Wang, L. Qin, X. Zhang, and X. Lin, "Finding Topk Min-Cost Connected Trees in Databases," in ICDE '07: Proceedings of the 23rd International Conference on Data Engineering, 2007,pp. 836–845.
- K. Golenberg, B. Kimelfeld, and Y. Sagiv, "Keyword Proximity Search in Complex Data Graphs," in Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, ser. SIGMOD '08, 2008, pp. 927–940.
- D. Chenthati , H. Mohanty, A. Damodaram, "A Scalable Relational Database Approach for WebService Matchmaking", DOI 10. 5013/IJSSST, 2003.
- L. J. Chen, Y. Papakonstantinou, "Supporting Top-K Keyword Search in XML Databases", research was supported by NSF IIS award 0713672.
- S. Bergamaschi, E. Domnori, R. Emilia, F. Guerra, R. T. Lado, and Y Velegrakis, "Keyword Search over Relational Databases: A Metadata Approach", SIGMOD'11, 2011.