期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2012
卷号：3
期号：2
页码：694-700
语种：English
出版社：Ayushmaan Technologies
摘要：Efficient handling of multidimensional data is a challenging issue in P2P systems. P2P is a distributed application architecture that partitions tasks or workloads among peers. Peers are equally privileged, equipotent participants in the application. Each computer in the network is referred to a node. The owner of each computer on a P2P network would set aside a portion of its resources, such as processing power, disk storage or network bandwidth, directly available to other network participants, without the need for central coordination by servers or stable hosts. A P2P-based framework supporting the extraction of aggregates from historical multidimensional data is proposed, which provides efficient and robust query evaluation. When a data population is published, data are summarized in a synopsis, consisting of an index built on top of a set of subsynopses (storing compressed representations of distinct data portions). The index and the subsynopses are distributed across the network, and suitable replication mechanisms taking into account the query workload and network conditions are employed that provide the appropriate coverage for both the index and the subsynopses.
