英文摘要 |
Keyword Search is an effective approach for most users to search information because they neither need to learn complex query languages nor need to understand the underlying structure of data. This paper proposes a method to abstract appropriate segments of XML elements for multiple keywords queries. The user only needs to input several related keywords without describing the hierarchical relationship among these keywords. From the associated DTD of an XML document, our method can abstract several logical XML element segments called ACS-D’s. These ACS-D’s then can be used to identify some practical XML element segments, called ACS-X’s, from the XML document. As a granularity of XML instance data, each ACS-X contains all inputted keywords and the hierarchy architecture of the keywords. Users can browse interesting information from the returned ACS-X’s in an appropriate range. Finally, we give two examples to illustrate how our method works. |