104 search results - page 1 / 21 » Query ranking in probabilistic XML data |
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
JDCTA
2010
12 years 11 months ago
2010
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
SIGMOD
2008
ACM
14 years 4 months ago
2008
ACM
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
SIGMOD
2003
ACM
14 years 4 months ago
2003
ACM
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...