Dissertation > Excellent graduate degree dissertation topics show
Research on SLCA Problem in XML Keyword Retrieval
Author: ZuoShaoYu
Tutor: HongXiaoGuang
School: Shandong University
Course: Computer Software and Theory
Keywords: XML keyword search Dewey SLCA BCS
CLC: TP311.13
Type: Master's thesis
Year: 2010
Downloads: 93
Quote: 1
Read: Download Dissertation
Abstract
|
XML (eXtensible Markup Language) is w3c standard generalized markup language based on the created is used to define the semantic tags. In Web services, e-commerce, digital libraries, and many other network-related applications has become the de facto standard for describing data. To facilitate the XML data from the mass to extract the information they need, many XML data query algorithm emerged, making XML data query XML data management to become a hot field. This article will query the XML data model described by the query algorithm is divided into different categories, namely XML structure queries and XML keyword search. The former uses a regular expression description method, in favor of the traditional structured query can be clearly expressed intent of the user's query; latter into the field of information retrieval ideas and methods commonly used queries, allowing users to simply enter a keyword will be able to search. XML structured query algorithm based on the exact query that can output the desired results. However, the algorithm for user queries put forward higher requirements, that not only familiar with structured query algorithms use query language, but also learn to query an XML document tree structure. Above requirements is impractical for most users, so from the user perspective, XML keyword query is a query that can be widely used method. XML keyword search method is the most critical issue is how to solve the smallest of all keywords containing XML fragments that SLCA (Smallest Lowest Common Ancestors) problem. At present there are many solving algorithms, including Stack, ILE, SE, LISA and LISA II and so on. ILE and SE in comparison with the experimental Stack behave more efficient for applications that require frequent I / O operations of large volumes of XML queries, they only need to read the XML data in order again; compared to ILE and SE, LISA and LISA Ⅱ lightweight level XML queries, both in theoretical analysis or comparison tests have shown a better performance. However, LISA is not only the need for frequent scanning node, and the need to introduce a collection of cross-operation, consuming a lot of CPU cycles. LISA II While avoiding unnecessary scans improves the LISA algorithm aspect, but with its own unique code, only the introduction of code mapping, but also makes the algorithm versatility greatly weakened. Even if these two algorithms in memory only as an execution of the algorithm, the above shortcomings also affect the query speed. Therefore, this paper proposes a lightweight, XML keyword search using generic coding of the new algorithm Dewey, BCS (Binary Comparative Search Algorithm), ie two points comparing XML keyword search for solving the smallest fragment containing the problem. The algorithm effectively improve the search efficiency for a large amount of data in the XML tree, the search efficiency is particularly evident. BCS both in theoretical analysis or comparison tests, have shown a good performance, is a viable smallest fragment containing the keyword algorithm. As a new XML keyword search algorithm, BCS has a simple and quick queries, ordinary users to use a lower threshold, the user-friendly features, etc., but there will still be relative precision rate lower XML structured query XML keyword search algorithm birth defects.
|
Related Dissertations
- Wisdom Training: Dewey’s Curriculum Theory and Its Contemporary Value,G40
- A Study on Compressed Sensing Based Estimation of Multipath Channels,TN925
- Pharmaceutical Excipients Enhance Intestinal Absorption of Ganciclovir,R96
- On John Dewey’s Female Education and the Impact,G776
- Study on Dewey’s Pragmatism Evaluation Views,G40
- Key Techniques on XML Query Processing Based on Partially Specified,TP311.10
- Experimental Study on Landfill Leachate Treatment by DAF-BCS-membrane Combination Processes,X703
- Research on Key Technologies of Labeling and Querying Dynamic XML Document,TP311.10
- Optimization of 64-slice Spiral CT Angiography Scanning Technique of Budd-Chiari Syndrome,R445.1
- John Dewey’ S Educational Theory of Pragmatism,G40-09
- Comparison of Moral Thought between Confucius and Dewey,G41
- Research on Dewey’s Thoughts of Moral Education,B82
- Snedden and Dewey 's battle of vocational education and its impact,G710
- Tao and Dewey Comparative Study of the Vocational Education Thought,G710
- Petrochemical enterprise's financial statements for application -BWBCS Design and Development,TP311.52
- Review of Dewey’s Educational Philosophy,G40
- Research on Communication of Canbased Vehicle Body Control System,TP273
- Dewey "Situation" Theory,B712
- British criticism of modern empiricism and beyond,K561
- Study of Tao Xingzhi’s Life Education Theory and Comparison with Dewey’s Education Life Theory,G40-092
- XSemantic: The Research of Keyword Search on XML Documents Based on Keyword Expansion,TP391.3
CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > Computer software > Program design,software engineering > Programming > Database theory and systems
© 2012 www.DissertationTopic.Net Mobile
|