Interactive Fuzzy based Search over XML Data for Optimized Performance

Abstract
Authors
Keywords
Conclusion
References

In a traditional keyword-search system over XML data, a user composes a keyword query, submits it to the system, and retrieves relevant answers. In the case where the user has limited knowledge about the data, often the user feels “left in the dark” when issuing queries, and has to use a try-and-see approach for finding information. In this paper we study, TASX - Type-Ahead Search in XML data, a new information-access paradigm in which the system searches XML data on the fly as the user types in query keywords. It allows users to explore data as they type, even in the presence of minor errors of their keywords. TASX provides friendly interface for users to explore XML data and can save users typing effort.

Published In : IJCAT Journal Volume 1, Issue 6

Date of Publication : 31 July 2014

Pages : 301 - 307

Figures :07

Tables : 02

Publication Link : Interactive Fuzzy based Search over XML Data for Optimized Performance

Sushma. J. Basanagoudar : completed B.E in Computer Science & Engineering from S.J.C.I.T college in the year 2011, M. Tech (pursuing) Computer Science & Engineering in B.N.M Institute of Technology in the year 2014.

Dr. B. G. Prasad : currently working as Professor & Head of Department in CSE at B.N.M Institute of Technology. He has over 25 years of academic experience in Computer Science. Has published 24 journal/conference papers. His areas of interest encompass Computer Networks, Image Processing, CBIR, Operating System and Computer Vision.

XML

Keyword Search

Type-ahead Search

The problem of fuzzy type-ahead search in XML data, a new information-access paradigm in which system searches XML data on the fly as the user types in query keywords is implemented. This method provides approximate keyword search for users. In fuzzy typeahead search method the predicted keywords are calculated using edit distance method and relevant answers among predicted keywords are retrieved using MCT (Minimal Cost Tree) method. MCT-based search method effectively and progressively identifies the most relevant answers.

[1] Y. Xu and Y. Papakonstantinou, “Efficient Keyword Search for Smallest Lcas in XML Databases,” Proc. ACM SIGMOD Int’l Conf.Management of Data, pp. 537-538, 2005.

[2] C. Sun, C.Y. Chan, and A.K. Goenka, “Multiway Slca- Based Keyword Search in Xml Data,” Proc. Int’l Conf. World Wide Web (WWW), pp. 1043-1052, 2007.

[3] S. Cohen, J. Mamou, Y. Kanza, and Y. Sagiv, “Xsearch” A Semantic Search Engine for Xml,” Proc. Int’l Conf. Very Large Data Bases (VLDB), pp. 45-56, 2003.

[4] G. Li, S. Ji, C. Li, and J. Feng, “Efficient Type-Ahead Search on Relational Data: A Tastier Approach,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 695-706, 2009.

[5] S. Ji, G. Li, C. Li, and J. Feng, “Efficient Interactive Fuzzy Keyword Search,” Proc. Int’l Conf. World Wide Web (WWW), pp. 371-380, 2009.

[6] G. Koutrika, Z.M. Zadeh, and H. Garcia-Molina, “Data Clouds: Summarizing Keyword Search Results over Structured Data,” Proc. Int’l Conf. Extending Database Technology: Advances in Database Technology (EDBT), pp. 391-402, 2009.

[7] Y. Chen, W. Wang, Z. Liu, and X. Lin, “Keyword Search on Structured and Semi-Structured Data,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 1005-1010, 2009.