Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
On boosting holism in XML twig pattern matching using structural indexing techniques
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
From region encoding to extended dewey: on efficient processing of XML twig pattern matching
VLDB '05 Proceedings of the 31st international conference on Very large data bases
On the complexity of managing probabilistic XML data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Matching twigs in probabilistic XML
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Query efficiency in probabilistic XML models
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Modeling and querying probabilistic XML data
ACM SIGMOD Record
Holistically Twig Matching in Probabilistic XML
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
On the expressiveness of probabilistic XML models
The VLDB Journal — The International Journal on Very Large Data Bases
Query evaluation over probabilistic XML
The VLDB Journal — The International Journal on Very Large Data Bases
Matching top-k answers of twig patterns in probabilistic XML
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Hi-index | 0.00 |
In practice, uncertainty of data is inherent. Probabilistic XML has been proposed to manage semistructured uncertain data. In this paper, we study twig query evaluation over probabilistic XML with probability thresholds. First we propose an encoding scheme for probabilistic XML. Then we design a novel streaming scheme which enables us to prune off useless inputs. Based on the encoding scheme and streaming scheme, we develop an algorithm to evaluate twig queries over probabilistic XML. Finally, we conduct experiments to study the performance of our algorithm.