Sciweavers

7 search results - page 1 / 2
» Research on Querying Node Probability Method in Probabilisti...
Sort
View
JDCTA
2010
151views more  JDCTA 2010»
12 years 11 months ago
Research on Querying Node Probability Method in Probabilistic XML Data Based on Possible World
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...
Jianwei Wang, Zhongxiao Hao
EDBT
2006
ACM
130views Database» more  EDBT 2006»
14 years 4 months ago
Querying and Updating Probabilistic Information in XML
Abstract. We present in this paper a new model for representing probabilistic information in a semi-structured (XML) database, based on the use of probabilistic event variables. Th...
Serge Abiteboul, Pierre Senellart
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 4 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ICDE
2011
IEEE
215views Database» more  ICDE 2011»
12 years 8 months ago
Top-k keyword search over probabilistic XML data
—Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
EDBT
2009
ACM
113views Database» more  EDBT 2009»
13 years 11 months ago
Query ranking in probabilistic XML data
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...
Lijun Chang, Jeffrey Xu Yu, Lu Qin