Compared with former techniques, our approach can approximately answer the top-k queries efficiently. We verify this approach through a series of experiments, ...
Abstract. With the development of XML applications, such as Digital. Library, XML subscribe/publish system, and other XML repositories, top-k structural ...
In this paper, we propose XFinder, a system that efficiently searches top K XML subtrees that exactly or partially match input ordered tree pattern query in.
The fuzzy type ahead search in xml data returns the approximate results. The best similar prefixes are matched and returned. For this edit distance is used ...
... structural similarity search is to retrieve the top-k most similar doc- uments. Given an XML document corpus D, a query document Q and a similarity function ...
ABSTRACT: The rapid adoption of XML as a standard for data representation and exchange prefigures a massive increase in the amount of XML data collected, ...
In this paper, we study the problem of keyword proximity search in XML documents. We take the disjunctive semantics among the keywords into consideration ...
Measuring the structural similarity between an XML document and a DTD has many relevant applications that range from document classification and approximate ...
Abstract. XML documents on the web are often found without DTDs, par- ticularly when these documents have been created from legacy.
Missing: Top- | Show results with:Top-
Oct 30, 2012 · Abstract. Systems that produce ranked lists of results are abundant. For instance, Web search engines return ranked lists of Web pages.