文章基本信息

标题：Approximate Processing of Queries in P2P Networks
本地全文：下载
作者：Suraj N. Arya ; Rajesh V. Argiddi
期刊名称：International Journal of Engineering and Computer Science
印刷版ISSN：2319-7242
出版年度：2015
卷号：4
期号：9
页码：14436-14438
DOI：10.18535/ijecs/v4i9.64
出版社：IJECS
摘要：Peer-to-peer (P2P) databases are mostly used on the Internet for distribution and sharing of documents, applications, and otherdata. Finding answers to large-scale ad hoc queries like aggregation queries on these databases gives rise to many new challenges. Findingthe exact solutions can consume a large amount of time and is also difficult to implement since the P2P databases are distributed anddynamic. In this paper, an approach for approximately answering of ad hoc queries in such databases is presented. Generally, the data isdistributed across many peers in a distributed environment, and most of the times, within each peer, the data is highly correlated. This factis taken advantage of and an approach to process the queries in such an environment is proposed in this work.
关键词：distributed query processing; ad hoc queries; peer-to-peer databases; aggregation queries