P2P OLAP: Data model, implementation and case study

被引:6
作者
Vaisman, Alejandro A. [1 ]
Minuto Espil, Mauricio [2 ]
Paradela, Martin [1 ]
机构
[1] Univ Buenos Aires, RA-1428 Buenos Aires, DF, Argentina
[2] Univ Catolica Argentina, Buenos Aires, DF, Argentina
关键词
Data warehousing; OLAP; Dimensions; Hierarchies; Peer-to-peer;
D O I
10.1016/j.is.2008.07.001
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
It is a common situation nowadays that business groups own different companies that operate in an autonomous way. Nevertheless, these companies must be requested to provide the headquarters with summarized information for decision-making. An architecture for cooperative interchange of decision-making information seems to be a natural solution for this problem. We propose the use of a peer-to-peer (P2P) architecture for addressing the problem of processing OLAP data in a distributed environment, in a way that all companies involved can maintain full autonomy over the use of its own data resources. In a scenario like this, data exchange between peers occurs when one of them, in the role of a local peer, receives a query and, for answering it, requests data available in other nodes, denoted acquaintances. No global schema is assumed to exist for any data under this computing paradigm. Henceforth, data provided by an acquaintance of a local peer must be adapted, in a manner that answers to queries posed by local peer users conform the view those users have of their data. Because multidimensional data normally consist of a collection of views of aggregated data, a careful translation process is needed in this case, in order to transform any summary concept that appears in a peer acquaintance into a summary concept meaningful to the requesting peer. We first present a model for multidimensional data distributed in a P2P network, and a query rewriting technique, that allows a local peer to propagate OLAP queries among its acquaintances, obtaining a meaningful and correct answer. Mappings are performed using a novel technique called revise and map, based on belief revision concepts. Revising a dimension instance allows to produce consistent aggregations when an OLAP query is answered at more than one node. We then describe an implementation of a P2P system for answering OLAP queries over a network of data warehouses. We apply our proposal to a real-world case study of an insurance group. Finally, we report the results of an experimental evaluation of our implementation, and discuss the issues that must be accounted for in this setting. (c) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:231 / 257
页数:27
相关论文
共 24 条
  • [1] ARAI B, 2006, ICDE, P42
  • [2] Efficient approximate query processing in peer-to-peer networks
    IEEE
    不详
    不详
    [J]. IEEE Trans Knowl Data Eng, 2007, 7 (919-933): : 919 - 933
  • [3] BERTOSSI L, 2004, P 1 INT WORKSH PEER
  • [4] Cabibbo L., 2004, Proceedings of the Twelfth Italian Symposium on Advanced Database Systems, P6
  • [5] Calvanese D, 2005, LECT NOTES COMPUT SC, V3774, P90
  • [6] CALVANESE D, 2004, LOGICAL FDN PEER TO, P241
  • [7] Colazzo D, 2005, LECT NOTES COMPUT SC, V3774, P74
  • [8] CONSENS MP, 1990, LECT NOTES COMPUT SC, V470, P379
  • [9] Franconi E, 2004, LECT NOTES COMPUT SC, V2944, P64
  • [10] GRIBBLE S, 2001, P 4 INT WORKSH WEB D, P31