Abstract
In the XML query algorithm based on matching pretreatment, three important existing tree matching models are used and the match results of data sets are presented according to the match cost in a descending order. The function of matching pretreatment is added to improve the existing algorithm, and a series of experiments are conducted. The results show that this algorithm can remove the unwanted node in the tree to promote the efficiency of data sets retrieval especially the recall ratio, the precision ratio and the average response time, when the data scale is quite large. This algorithm is applied in the unity retrieval system of scientific and technological resources database. It can facilitate the navigation of resources, narrow the search scope and promote the efficiency of this system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Frakes, W.B., Pole, T.P.: An empirical study of representation methods for reusable software components. IEEE Transactions on Software Engineering 120, 617–630 (1994)
Torshen, S.: ApproXQL: Design and implementation of an approximate pattern matching language for XML. Technical report. Free University, Berlin (2001)
XML and query language: Experiences and examples, http://www-db.research.bell-labs.com/user/simeon/xquery.ps
Richter, T.: A new measure of the distance between ordered trees and its applications, Technical report, University of Bonn (1997)
Xu, W., Qian, L., Cheng, J.: Research on Matching Algorithm for XML-Based Software Component Query. Journal of Software 14, 1195–1202 (2003) (in Chinese)
Torsten, S., Naumann, F.: Approximate tree embedding for querying XML data. In: Proceedings of ACM SIGIR Workshop on XML and Information Retrieval, Athens, Greece, pp. 181–184 (2000)
Sun, J.: Application of GA in XML Data Query. Computer Engineering 12, 183–184 (2005) (in Chinese)
Lu, Y., Zhang, B., Guo, J., et al.: A XML Query Solution with User-friendly Interface. Mini-Micro System 24, 1849–1852 (2003) (in Chinese)
Xiao, H., Tang, C., Zhang, T., et al.: BTCS: The Binary Traveling Coding Scheme for XML Document. Si Chuang University Journals (Nature Science version) 43, 532–537 (2006) (in Chinese)
Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: Proceedings of the 27th International Conference on Very Large Data Bases, Rome, Italy, pp. 1811–1814 (2001)
Yin, P., Wei, J., Zheng, W.: A XML-Based Approach for Information Search. Computer Engineering and Science 29, 145–148 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Ye, H., Ma, H., Zhang, W. (2011). XML Query Algorithm Based on Matching Pretreatment Optimization. In: Gong, Z., Luo, X., Chen, J., Lei, J., Wang, F.L. (eds) Web Information Systems and Mining. WISM 2011. Lecture Notes in Computer Science, vol 6988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23982-3_56
Download citation
DOI: https://doi.org/10.1007/978-3-642-23982-3_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23981-6
Online ISBN: 978-3-642-23982-3
eBook Packages: Computer ScienceComputer Science (R0)