文章基本信息

标题：An Approach to Extract Information Based on Tree-Based Association Rules (TARS) Mined Rules From XML Documents
本地全文：下载
作者：K.S.P.Keerthi ; B.Kishore
期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2014
卷号：5
期号：4
页码：209-211
语种：English
出版社：Ayushmaan Technologies
摘要：The database research field has determined on the Extensible Markup Language (XML) as a supple hierarchical model appropriate to represent huge amounts of data with no complete and fixed schema and a probably uneven and imperfect structure. There are two main approaches to XML document access keyword-based search and query-answering. The first one comes from the tradition of information reclamation where most searches are carried out on the textual content of the document this means that no advantage is imitative from the semantics conveyed by the document structure.As for query-answering since query languages for semi structured data depend on the document structure to convey its semantics in order for query formulation to be effectual users need to know this structure in advance which is often not the case. When users state queries without knowing the document structure they may fail to retrieve information which was there but under a different structure. This restraint is a critical issue which did not come out in the context of relational database management systems.
关键词：XML;Approximate Query-Answering;Data Mining;Intentional Information;Succinct Answers