In this paper we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data over an unstructured Peer-to-Peer overlay, without the use of any proprietary tool. Brown Dwarf manages to distribute a highly effective centralized structure among peers on-the-fly. Both point and aggregate queries are then naturally answered on-line through cooperating nodes that hold parts of a fully or partially materialized data cube. Updates are also performed on-line, eliminating the usually costly over-night process. Our initial evaluation on an actual testbed proves that Brown Dwarf manages to distribute the structure across the overlay nodes incurring only a small storage overhead compared to the centralized algorithm. Moreover, it accelerates cube creation up to 5 times and querying up to several tens of times by exploiting the capabilities of the available network nodes working in parallel.
[1]
Beng Chin Ooi,et al.
An adaptive peer-to-peer network for distributed caching of OLAP results
,
2002,
SIGMOD '02.
[2]
Jens Dittrich,et al.
Dwarfs in the rearview mirror: how big are they really?
,
2008,
Proc. VLDB Endow..
[3]
Laks V. S. Lakshmanan,et al.
QC-trees: an efficient summary structure for semantic OLAP
,
2003,
SIGMOD '03.
[4]
Dimitrios Tsoumakos,et al.
HiPPIS: an online P2P system for efficient lookups on d-dimensional hierarchies
,
2008,
WIDM '08.
[5]
François Goasdoué,et al.
WebContent: efficient P2P Warehousing of web data
,
2008,
Proc. VLDB Endow..
[6]
Yannis Sismanis,et al.
Dwarf: shrinking the PetaCube
,
2002,
SIGMOD '02.