ICDT '03 Proceedings of the 9th International Conference on Database Theory
A Probabilistic XML Approach to Data Integration
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Efficient keyword search for smallest LCAs in XML databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Multiway SLCA-based keyword search in XML data
Proceedings of the 16th international conference on World Wide Web
On the complexity of managing probabilistic XML data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ProTDB: probabilistic data in XML
VLDB '02 Proceedings of the 28th 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
Query ranking in probabilistic XML data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
On the expressiveness of probabilistic XML models
The VLDB Journal — The International Journal on Very Large Data Bases
Top-k keyword search over probabilistic XML data
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Querying and updating probabilistic information in XML
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Hi-index | 0.00 |
Probabilistic XML data is widely used in many web applications. Recent work has been mostly focused on structured query over probabilistic XML data. A few of work has been done about keyword query. However only the independent and the mutually-exclusive relationship among sibling nodes are discussed. This paper addresses the problem of keyword filtering over probabilistic XML data, and we propose PrXML{exp, ind, mux} model to represent a more general relationship among XML sibling nodes, for keywords filtering over probabilistic XML data. kdptab is defined as keyword distribution probability table of one subtree. The Dot product, Cartesian product, and addition operation of kdptab are also defined. In PrXML{exp, ind, mux} model, XML document is scanned bottom-up and achieve keyword filtering based on SLCA semantics efficiently in our method. Finally, the features and efficiency of our method are evaluated with extensive experimental results.