Searching XML documents via XML fragments

Abstract

Most of the work on XML query and search has stemmed from the publishing and database communities, mostly for the needs of business applications. Recently, the Information Retrieval community began investigating the XML search issue to answer information discovery needs. Following this trend, we present here an approach where information needs can be expressed in an approximate manner as pieces of XML documents or "XML fragments" of the same nature as the documents that are being searched. We present an extension of the vector space model for searching XML collections via XML fragments and ranking results by relevance. We describe how we have extended a fulltext search engine to comply with this model. The value of the proposed method is demonstrated by the relative high precision of our system, which was among the top performers in the recent INEX workshop. Our results indicate that certain queries are more appropriate than others for the extended vector space model. Specifically, queries with relatively specific contexts but vague information needs are best situated to reap the benefit of this model. Finally our results show that one method may not fit all types of queries and that it could be worthwhile to use different solutions for different applications.

Schema matching for integrating multimedia metadata

“…The ancestor context similarity ancSim between two nodes (n i , n j ) is based on the resemblance measure between their paths (p i , p j ). This is done by calculating three scores established in [30]. These scores are combined and weighted by the linguistic similarity between (n i , n j ) to compute the ancestor context similarity:…”

Towards structural Web Services matching based on Kernel methods

“…Let us advert that in VSM model, two documents are presented in a space whose dimensions correspond each to a distinct indexing unit [2]. Indexing units are words that are in their root forms.…”

The Importance of Length Normalization for XML Retrieval

“…At INEX 2002), a broad spectrum of techniques was used to exploit non-content aspects of XML documents in addressing the XML element retrieval task. For instance, the JuruXML system by Mass et al (2003) and Carmel et al (2003) extends the traditional vector space model by allowing XML collections to be searched through so-called "XML fragments" which combine content and structure features. Similarly, Gövert et al (2003) exploit content and structure features to identify relevant elements and to redistribute relevancy from elements to their enclosing elements.…”