Mining Tree-Based Association Rules for XML Query Answering
Arundhati Birari, Ranjit Gawande · 2013
Abstract: The database research field has concentrated on the Extensible Markup Language (XML) due to its flexible hierarchical nature which can use to represent huge amounts of data, also it doesn’t have absolute and fixed schema, but having possibly irregular and incomplete structure. It is a very hard task to extract information from semi structured documents and is going to become more and more difficult as the amount of digital information available on the Internet grows. Actually, the data set returned as answer to a query may be too big to convey interpretable knowledge, as documents are often so large. An approach based on Tree-Based Association Rules (TARs), which provide approximate, intentional information about the structure and the contents of XML documents both, as well as it can be stored in XML format. This mined knowledge is used to provide, a concise idea of both the structure and the content of the XML document and quick, approximate answers to queries whenever required. Key words: Extensible markup Language (XML), approximate query answering, data mining, intentional information, Tree-Based Association Rules. 1.