Peer-to-peer (P2P) databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large-scale ad hoc analysis queries, for example, aggregation queries, on these databases poses unique challenges. Exact solutions can be time consuming and difficult to implement, for the distributed and dynamic nature of P2P databases. In this paper, we have presented novel sampling-based techniques for approximate answering of ad hoc aggregation queries in such databases. Computing a high-quality random sample of the database efficiently in the P2P environment is complicated due to several factors: the data is distributed (usually in uneven quantities) across many peers, within each peer the data is often highly correlated and moreover, even collecting a random sample of the peers is difficult to accomplish. To formulate these problems, developed software uses approach, based on random walks of the P2P graph, as well as block-level sampling techniques. We have presented here extensive experimental evaluations to demonstrate the feasibility of our solution. The modules that are included in this project are: 1. Peer-to-Peer Node Construction 2. Random Selection of Node 3. Selection of Records 4. Performance Evaluation
목차
Abstract 1. Introduction 2. Problem Definition 3. Literature Survey 4. Our Approach 4.1 AQP Phases 4.2 Basic Terms 4.3. Challenges 5. Research Methodology 5.1 Unstructured P2P Network 5.2. Query Processing 6. Random-walk Algorithm 7. Proposed Modules 8. Experimental Evaluation 8.1. Evaluation Metrics 8.2 Input Parameters 9. Experiments 9.1. P2P Databases 9.2. A Typical model for AQP in P2P Network 9.3. Graph Plots 10. Conclusion References
키워드
Peer-to-peer (P2P) databasesApproximationAggregationDistributed databasesQuery processingDistributed systems
저자
Ratnmala Bhimanpallewar [ Department Of Computer Engg, Pune University, VIIT, Kondhawa, Pune Symbiosis Institute of Computer Studies and Research, Pune Maharashtra, India ]
Pravin Metkewar [ Department Of Computer Engg, Pune University, VIIT, Kondhawa, Pune Symbiosis Institute of Computer Studies and Research, Pune Maharashtra, India ]
보안공학연구지원센터(IJDTA) [Science & Engineering Research Support Center, Republic of Korea(IJDTA)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Database Theory and Application
간기
격월간
pISSN
2005-4270
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Database Theory and Application Vol.5 No.3