適用於多重關鍵字搜尋的適當XML元素切割片段

Appropriate Cutting Segments of XML Elements for Multiple Keywords Queries

10.29767/ECS.200803.0002

陳靖國(Jeang-Kuo Chen)；徐任鵬(Jen-Peng Hsu)

關鍵字搜尋 ； XML ； DTD ； 資料大小單元 ； Keyword Search ； XML ； DTD ； Granularity

Electronic Commerce Studies

6卷1期（2008 / 03 / 31）

5 - 27

繁體中文

關鍵字搜尋對大部份的使用者而言，是一個常用的資料搜尋方法，因為使用者不需要學習複雜的查詢語言或了解資料基本的結構。本篇論文對於XML多重關鍵字搜尋，提出一個方法可以擷取適當的XML元素片段資料。使用者只需輸入多個關鍵字而不必描述關鍵字們之間的階層關係。我們的方法先從XML文件附屬的DTD中，摘取出若干個邏輯的XML元素片段，叫做ACS-D，然後再利用每一個ACS-D從XML文件中辨識出符合這個ACS-D結構的若干個實際XML資料元素片段，叫做ACS-X。每個ACS-X是XML實際資料的一個適當的資料大小單元，包含使用者所下的所有關鍵字以及關鍵字之間的階層架構，讓使用者得以瀏覽適當範圍內有興趣的資料。最後，我們使用二個實例來說明我們方法如何運作。

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.

1. Agrawal, S.,Chaudhuri, S.,Das, G.(2002).DBXplorer: A System for Keyword-Based Search over Relationship Databases.Proceedings of the 18th International Conference on Data Engineering
2. Bhalotia, G.,Hulgeri, A.,Nakhe, C.,Chakrabarti, S.,Sudarshan, S.(2002).Keyword Searching and Browsing in Databases using BANKS.Proceedings of the 18th International Conference on Data Engineering
3. Bonifati, A.,Cuzzocrea, A.(2006).Storing and Retrieving XPath Fragments in Structured P2P Networks.Proceedings of the Data & Knowledge Engineering,59,247-269.
4. Cohen, S.,Mamou, J.,Kanza, Y.,Sagiv, Y.(2003).XSEarch: A Semantic Search Engine for XML.Proceedings of the 29th International Conference on VLDB
5. Florescu, D.,Kossmann, D.,Manolescu, I.(2000).Integrating Keyword Search into XML Query Processing.Proceedings of the 9th International World Wide Web Conference on Computer networks
6. Fuhr, N.,Grobjohann, K.(2001).XIRQL: A Query Language for Information Retrieval in XML documents.Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
7. Guo, L.,Shao, F.,Botev, C.,Shanmugasundaram, J.(2003).XRANK: Ranked Keyword Search over XML Documents.Proceedings of the ACM SIGMOD International Conference on Management of data
8. Hristidis, V.,Papakonstantinou, Y.(2002).DISCOVER: Keyword Search in Relationship Databases.Proceedings of the 28th International Conference on VLDB
9. Hristidis, V.,Papakonstantinou, Y.,Balmin, A.(2003).Keyword Proximity Search on XML Graphs.Proceedings of the 19th International Conference on Data Engineering
10. Database Optimization: Increase query performance with indexes and statistics
11. Ng, W.,Lau, H. L.(2007).A Co-training Framework for Searching XML Documents.Proceedings of the Information Systems,32,477-503.
12. Theobald, A.,Weikum, G.(2002).The Index-Based XXL Search Engine for Querying XML Data with Relevance Ranking.Proceedings of the 8th International Conference on Extending Database Technology
13. Xu, J.,Lu, J.,Wang, W.,Shi, B.(2006).Efficient Keyword Search in XML Documents Based on MIU.Proceedings of the 11th International Conference on Database Systems for Advanced Applications
14. Xu, Y.,Papakonstantinou, Y.(2005).Efficient Keyword Search for Smallest LCAs in XML Databases.Proceedings of the ACM SIGMOD International Conference on Management of data
15. Yoshikawa, M.,Amagasa, T.,Shimura, T.,Uemura, S.(2001).XRel: A Path-Based Approach to Storage and Retrieval of XML Documents Using Relational Databases.Proceedings of the ACM Transactions on Internet Technology,1,110-141.