Pre-constrained XML Keyword Search Technologies

Keyword search is one of the hot research issues for XML data management. As existing keyword search systems only support simple keywords, the deviation between query semantics and users’ query intention is observed frequently in practice, resulting in huge burden on users to identify desired information from large volumes of returned results, which we call as post-processing. This paper research XML keyword query is basing on the prior constraint, The research contents are as follows.First, based on prior constraints of XML query processing keyword ideas, we will implement a prototype system, which can describe users’ query intentions accurately, support real-time query hints and related XML keyword query, and help them to formulate queries that reflects their query intentions, the information detection and results existence detection is the main technical problems.Secondly, in terms of information detection, we proposed the solution basing on the efficient path of approximate matching and dynamic updating method to support the relatedpath detection, at the same time achieve to detect the vocabulary of similarity base on caching algorithm or k expansion algorithm, to assist the user to enter the relevant keywords, real-time path information contain relevant keywords, so that the user according to the information in the hint path specify the type of the returned results.Thirdly, In terms of existence results of detection, efficient algorithm is proposed to detect the existence ofeffective results for what the user input.When get the complete path information tree structure after inputing keywords, according to the path information selected by the user, size limit the size of finding-subtree. When the user input the subsequent keyword, the system will invoke the correspondingsearch tree query real-time to detect whether there is a solution of test input.Finally, the effectiveness of the proposed method is verified by experiment...