Using integrity constraints to provide intensional answers to relational queries
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mining Association Rules from XML Data
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
A Graphical Environment to Query XML Data with XQuery
WISE '03 Proceedings of the Fourth International Conference on Web Information Systems Engineering
Mining interesting XML-enabled association rules with templates
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
| Hi-index | 0.00 |
XML is a representation of data which may require huge amounts of storage space and query processing time. Summarized representations of XML data provide succinct information which can be directly queried, either when fast yet approximate answers are sufficient, or when the actual dataset is not available. In this work we show which kinds of XQuery expressions admit a partial answer by using association rules extracted from XML datasets. Such partial information provide intensional answers to queries formulated as XQuery expressions.