ACM Home Page
Please provide us with feedback. Feedback
Distinct value estimation on peer-to-peer networks
Full text PdfPdf (320 KB)
Source PETRA; Vol. 282 archive
Proceedings of the 1st international conference on PErvasive Technologies Related to Assistive Environments table of contents
Athens, Greece
SESSION: Networking technologies for healthcare information storage, transmission, processing, and feedback table of contents
Article No. 26  
Year of Publication: 2008
ISBN:978-1-60558-067-8
Authors
Zubin Joseph  UT Arlington
Gautam Das  UT Arlington
Leonidas Fegaras  UT Arlington
Sponsors
: NSF
NIST : National Institue of Standards & Technology
SERC : SERC
Motorola : Motorola
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 49,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1389586.1389617
What is a DOI?

ABSTRACT

Peer-to-Peer networks have become very popular on the Internet, with millions of peers all over the world sharing large volumes of data. In the assistive healthcare sector, it is likely that P2P networks will develop that interconnect and allow the controlled sharing of patient databases of various hospitals, clinics, and research laboratories. However, the sheer scale of these networks has made it difficult to gather statistics that could be used for building new features. In this paper, we present a technique to obtain estimations of the number of distinct values matching a query on the network. We evaluate the technique experimentally and provide a set of results that demonstrate its effectiveness, as well as its flexibility in supporting a variety of queries and applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Arai, B., Das, G., Gunopulos, D., and Kalogeraki, V. Approximating Aggregation Queries in Peer-to-Peer Networks. ICDE 2006 (April 3--8, Atlanta, GA, 2006)
3
4
5
 
6
Java Universal Network/Graph Framework (JUNG) Website. http://jung.sourceforge.net.
 
7
Metropolis, N., Rosenbluth A, Rosenbluth, M., Teller, A., and Teller, E., Equations of state calculations by fast computing machines. J. of Chemical Physics, 21:1087--1091, 1953.
 
8
W. Hastings. Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57(1):97--109, 1970.
 
9
 
10
Gnutella Development website: rfc-gnutella.sourceforge.net
11
 
12
Baset, S. A., and Schulzrinne, H. An analysis of the Skype peer-to-peer Internet telephony protocol. Technical Report CUCS-039-04, Computer Science Department, Columbia University, September 2004.
 
13
KazaA website: kazaa.com
14
 
15
 
16
Tsoumakos, D., and Roussopoulos, N. - A Comparison of Peer-to-Peer Search Methods In Proceedings of the Sixth International Workshop on Web and Databases, San Diego, California (June 12--13, 2003)
17
 
18
19
 
20
 
21
22
23
 
24
 
25
 
26
 
27
L. Goodman. On the estimation of the number of classes in a population. Annals of Math. Stat., 20:572--579, 1949.
 
28
K. Burnham and W. Overton. Robust estimation of population size when capture probabilities vary among animals. Ecology, 60:927--936, 1979.
 
29
Shlosser A. On estimation of the size of the dictionary of a long text on the basis of a sample. Engrg. Cybernetics, 19:97--102, 1981.
 
30
Zipf, G. E. Human Behavior and the Principle of Least Effort. Addison-Wesley Press, Inc., 1949.
31
32
33
 
34
Le Fessant, F., Handurukande, S., Kermarrec, A.-M., and Massoulié, L. Clustering in Peer-to-Peer File Sharing Workloads. 3rd Intl. Workshop on Peer-to-Peer Systems IPTPS 2004
35
 
36

Collaborative Colleagues:
Zubin Joseph: colleagues
Gautam Das: colleagues
Leonidas Fegaras: colleagues