A Novel Efficient Approximate Query Processing in P2P Network
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, given the distributed and dynamic nature of P2P databases. In this paper, the authors presented novel sampling-based techniques for approximate answering of ad hoc aggregation queries in such databases.