Abstrait

INFORMATION RETRIEVAL USING INDEXING SCHEME FOR TREE PATTERN FRAMEWORK

Muthukumar. R C. Chandrasekar

Indexing an XML database in data warehouse is a complex problem. The major rationale for indexing XML database in data warehouse is owing to the heterogeneous and structural environment of XML data that can construct query pattern tedious. Existing techniques focused on clustering methods based on integrating the data warehouse with web data for Online Analytical Processing (OLAP) techniques. Through clustering process, fast retrieval of information is impossible because clustering technique exactly used for tree pattern building framework. Most XML indexing strategies split it into several sub-queries, and subsequently connect their results to present the response to the unique query. Join operations have been determined as the mainly time-consuming component in XML query processing for information retrieval. To enhance the search criteria in XML database present in the data warehouse, in this paper, an indexing scheme is used which separates the data based on the objective. An indexing technique XSeq is presented based on the tree structure pattern framework. XSeq constructs its indexing infrastructure framework on a much simpler and symbolize both XML data and XML queries as formation encoded sequences. Furthermore, the XSeq infrastructure unites both the content and the construction of XML documents, thus it attains a further presentation over indexing both just content and construction, or indexing them individually. A reliable performance improvement is achieved with the proposed IRIS (Information Retrieval using Indexing Scheme) in XML database to data warehouse, compared to an existing SDC technique for OLAP, in terms of search path length, search cost, Maintenance.