文章基本信息

标题：CB-Pattern Trees : Identifying Distributed Nodes Where Materialization is Available
本地全文：下载
作者：K.Dhanasree ; C. Shoba Bindu
期刊名称：International Journal of Data Mining & Knowledge Management Process
印刷版ISSN：2231-007X
电子版ISSN：2230-9608
出版年度：2016
卷号：6
期号：1
页码：13
DOI：10.5121/ijdkp.2016.6102
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：The role of materialized views is becoming vital in today’s distributed Data warehouses. Materialization iswhere parts of the data cube are pre-computed. Some of the real time distributed architectures aremaintaining materialization transparencies in the sense the users are not known with the materialization ata node. Usually what all followed by them is a cache maintenance mechanism where the query results arecached. When a query requesting materialization arrives at a distributed node it checks in its cache and ifthe materialization is available answers the query. What if materialization is not available- the nodecommunicates the query in the network until a node answering the requested materialization is available.This type of network communication increases the number of query forwarding’s between nodes. The aimof this paper is to reduce the multiple redirects. In this paper we propose a new CB-pattern tree indexing toidentify the exact distributed node where the needed materialization is available.
关键词：Distributed Data warehouse; Materialized views; vertical fragments; pattern trees; multiple redirects.