A Novel Approach For Large-Scale D ata Processing Platform On Peer- To- Peer Based Bestpeer++

We introduce BestPeer++, a framework which conveys versatile information sharing administrations for corporate system applications in the cloud taking into account BestPeer—a distributed (P2P) based information administration stage. By incorporating distributed computing, database, and P2P innovations into one framework, BestPeer++provides a sparing, adaptable and versatile stage for corporate system applications and conveys information sharing administrations to members taking into account the broadly acknowledged pay-as-you-go plan of action. We assess BestPeer++ on Amazon EC2 Cloud stage. The benchmarking results demonstrate that BestPeer++ beats HadoopDB, an as of late proposed substantial scale information preparing framework, in execution when both frameworks are utilized to handle normal corporate system workloads

The ViP2P Platform: XML Views in P2P

The growing volumes of XML data sources on the Web or produced by enterprises, organizations etc. raise many performance challenges for data management applications. In this work, we are concerned with the distributed, peer-to-peer management of large corpora of XML documents, based on distributed hash table (or DHT, in short) overlay networks. We present ViP2P (standing for Views in Peer-to-Peer), a distributed platform for sharing XML documents based on a structured P2P network infrastructure (DHT). At the core of ViP2P stand distributed materialized XML views, defined by arbitrary XML queries, filled in with data published anywhere in the network, and exploited to efficiently answer queries issued by any network peer. ViP2P allows user queries to be evaluated over XML documents published by peers in two modes. First, a long-running subscription mode, when a query can be registered in the system and receive answers incrementally when and if published data matches the query. Second, queries can also be asked in an ad-hoc, snapshot mode, where results are required immediately and must be computed based on the results of other long-running, subscription queries. ViP2P innovates over other similar DHT-based XML sharing platforms by using a very expressive structured XML query language. This expressivity leads to a very flexible distribution of XML content in the ViP2P network, and to efficient snapshot query execution. ViP2P has been tested in real deployments of hundreds of computers. We present the platform architecture, its internal algorithms, and demonstrate its efficiency and scalability through a set of experiments. Our experimental results outgrow by orders of magnitude similar competitor systems in terms of data volumes, network size and data dissemination throughput.Comment: RR-7812 (2011

Similarity Search of Time Series with Moving Average Based Indexing

提出了基于移动均值的索引来解决子序列匹配中的"(-查询"问题;提出并证明了基于移动均值的缩距定理和缩距比关系定理,后者具有很好的"裁减"能力,可以在相似查询时淘汰大部分不符合条件的候选时间序列,从而达到快速相似查找的目的;引入了由Jagadish 等人提出的BATON*-树,并在此基础上适当修改,建立了MABI索引,极大地加快了相似查询过程;最后,在一个股票交易数据集上进行了实验,证明了MABI索引的良好性能.In this paper, a method called MABI (moving average based indexing) is proposed to effectively deal with the issue of (-search query in subsequence matching. Two important theorems, distance reduction theorem and DRR(distance reduction rate) relation theorem, are proposed here to be as the basis of MABI. DRR relation theorem has strong capability in "pruning" those unqualified candidate sequences so as to achieve of fast similarity search. Furthermore, by modifying BATON* introduced by Jagadish, et al., a multi-way balanced tree structure is introduced, to construct the index from time series, which significantly speeds up the similarity search. Extensive experiments over a stock exchange dataset show that MABI can achieve desirable performance.Supported by the National Natural Science Foundation of China under Grant No.60473051(国家自然科学基金); The National High-Tech Research and Development Plan of China under Grand Nos.2007AA01Z191, 2006AA01Z230 (国家高技术研究与发展计划(863)

Data handover on a peer-to-peer system

This paper presents the DHO API and its integration into apeer-to-peer Grid architecture. It provides an efficientmanagement of critical data resources in an extensible distributedsetting consisting of a set of peers that may join or leave the system.Locking and mapping of such a resource are handled transparently forusers: they may access them through simple function calls.On the lowest level of the proposed architecture the Exclusive Locksfor Mobile Processes ELMP algorithm ensures data consistencyand guarantees the logical order of requests.All operations in our architecture have an amortized cost of O(logn). An experimental assessment validates the practicality of ourproposal

Speeding up search in peer-to-peer networks with a multi-way tree structure

10.1145/1142473.1142475Proceedings of the ACM SIGMOD International Conference on Management of Data1-1