Identifying Meaningful Return Informationfor XML Keyword Search.pptVIP

Identifying Meaningful Return Informationfor XML Keyword Search Ziyang Liu, Yi Chen Arizona State University Searching XML Data Challenges in XML Keyword Search How to select relevant keyword matches and connect them? Inferring for clauses (with variable bindings) and where clauses in XQuery Have been much studied XRank [Guo et al 03] XSEarch [Cohen et al 03] Meaningful LCA [Li et al 04] Smallest LCA[Xu et al 05] Selecting and Connecting Keyword Matches Selecting and Connecting Keyword Matches Example I: Subtree Return Example I: Path Return Example I: XSeek Example II: Subtree Return, Path Return Example II: XSeek Contributions XSeek: automatically infers meaningful return information for XML keyword Search No elicitation from users or system administrators is required No schema information is required Inferring search semantics Analyzing XML data structure Analyzing keyword match pattern Determining search results based on node types and match types Efficient implementation of the search semantics Experimental verification on effectiveness and efficiency Roadmap Motivation Inferring search semantics Analyzing keyword match patterns Analyzing XML data structure Identifying search results XSeek architecture Experiments Conclusions Analyzing Keyword Match Patterns Identifying search predicates and return nodes in keywords Examples of keyword searches Q1: Mutombo, position Q2: Mutombo, center Q3: Rockets Analyzing XML Data Structure Three types of data nodes Entity nodes Attribute nodes Connection nodes Identifying Search Results Search results consist of Matches to search predicates This allows users to verify the relevance of search results Matches to return nodes This is what the user is searching for Matches are output according to node types Attribute node: display name, value Entity node: display name, attributes, optionally entity and connection descendants Connection node: display name, optionally entity and connection descendants Nodes