Schema-Driven Evaluation of Approximate Tree-Pattern Queries

Schlieder, Torsten

doi:10.1007/3-540-45876-x_33

Cited by 38 publications

(25 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The approXQL [5] approach can also handle partial structural matchings. All the paths in the query are however required to occur in the document.…”

Section: Related Workmentioning

confidence: 99%

“…Starting from the user query, the approaches [2][3][4][5], for structural and content scoring of XML documents, generates relaxations of the query structure that preserve the ancestor-descendant relationships existing among nodes in the query. These relaxations do not consider the effective presence of such a structure in the collection of documents.…”

Section: Related Workmentioning

confidence: 99%

“…The number of variations to be evaluated is thus considerably reduced, still allowing for greater structural heterogeneity, as discussed in the previous section. Finally, in [2][3][4][5] constraints in the user queries are relaxed to augment the obtained results, whereas in our approach, we start from a completely relaxed query. We follow this approach because of the high degree of heterogeneity of the collection of documents we work on and we apply indexing structures for improving the performance.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Fragment-based approximate retrieval in highly heterogeneous XML collections

Sanz

Mesiti

Guerrini

et al. 2008

Data & Knowledge Engineering

View full text Add to dashboard Cite

Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents in a collection that are similar to a given pattern. Similarity involves both tags, that are not required to coincide, and structure, in which not all the relationships among nodes in the tree structure are strictly preserved.In this paper we present an efficient approach to the identification of similar subtrees, relying on ad-hoc indexing structures. The approach allows to quickly detect, in a heterogeneous document collection, the minimal portions that exhibit some similarity with the pattern. These candidate portions are then ranked according to their actual similarity. The approach supports different notions of similarity, thus it can be customized to different application domains. In the paper, three different similarity measures are proposed and compared. The approach is experimentally validated and the experimental results are extensively discussed.

show abstract

“…The approXQL [5] approach can also handle partial structural matchings. All the paths in the query are however required to occur in the document.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Fragment-based approximate retrieval in highly heterogeneous XML collections

Sanz

Mesiti

Guerrini

et al. 2008

Data & Knowledge Engineering

View full text Add to dashboard Cite

show abstract

“…Schlieder and Meuss (2000) extend the vector space model to term vectors consisting of structured terms by generalizing tf*idf-based term weights to structured terms. The language ApproXQL (Schlieder 2002) considers structural similarity between query graphs and XML data graphs based on graph transformation and matching. Guha et al (2002) apply a tree distance measure to implement approximate joins on XML data.…”

Section: Related Workmentioning

confidence: 99%

Semantic Similarity Search on Semistructured Data with the XXL Search Engine

2005

View full text Add to dashboard Cite

Abstract. Query languages for XML such as XPath or XQuery support Boolean retrieval: a query result is a (possibly restructured) subset of XML elements or entire documents that satisfy the search conditions of the query. This search paradigm works for highly schematic XML data collections such as electronic catalogs. However, for searching information in open environments such as the Web or intranets of large corporations, ranked retrieval is more appropriate: a query result is a ranked list of XML elements in descending order of (estimated) relevance. Web search engines, which are based on the ranked retrieval paradigm, do, however, not consider the additional information and rich annotations provided by the structure of XML documents and their element names.This article presents the XXL search engine that supports relevance ranking on XML data. XXL is particularly geared for path queries with wildcards that can span multiple XML collections and contain both exact-match as well as semantic-similarity search conditions. In addition, ontological information and suitable index structures are used to improve the search efficiency and effectiveness. XXL is fully implemented as a suite of Java classes and servlets. Experiments in the context of the INEX benchmark demonstrate the efficiency of the XXL search engine and underline its effectiveness for ranked retrieval.

show abstract

“…However, due to the large number and complexity (or heterogeneity) of XML documents, the retrieval process should be cooperative between system and user. Here approximate matches that allow to rank answers according to their relevance to the query [3,6,19,20] are more appropriate than exact match queries. Recently several proposals have therfore studied ranking methods that account for structure to score answers to XML queries.…”

Section: Introductionmentioning

confidence: 99%

Relaxing XML Preference Queries for Cooperative Retrieval

Cho

Balke

2009

Enterprise Information Systems

View full text Add to dashboard Cite

Abstract. Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been thoroughly researched. But given the ever growing amount of information available in different sources, also querying becomes more complex. In contrast to simple exact match retrieval, approximate matches become far more appropriate over collections of complex XML documents. Only recently approximate XML query processing has been proposed where structure and value are subject to necessary relaxations. All the possible query relaxations determined by the user's preferences are generated in a way that predicates are progressively relaxed until a suitable set of best possible results is retrieved. In this paper we present a novel framework for developing preference relaxations to the query permitting additional flexibility in order to fulfil a user's wishes. We also design IPX, an interface for XML preference query processing, that enables users to express and formulate complex user preferences, and provides a first solution for the aspects of XML preference query processing that allow preference querying and returning ranked answers.

show abstract

Schema-Driven Evaluation of Approximate Tree-Pattern Queries

Cited by 38 publications

References 8 publications

Fragment-based approximate retrieval in highly heterogeneous XML collections

Fragment-based approximate retrieval in highly heterogeneous XML collections

Semantic Similarity Search on Semistructured Data with the XXL Search Engine

Relaxing XML Preference Queries for Cooperative Retrieval

Contact Info

Product

Resources

About