skip to main content
10.1145/1096952.1096958acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
Article

Towards scatter/gather browsing in a hierarchical peer-to-peer network

Published: 04 November 2005 Publication History

Abstract

After their success in the area of file sharing and distributed storage, peer-to-peer networks are becoming more and more popular as platforms for fully fledged IR applications as well. Methods for intelligent search in such highly distributed environments are emerging, while other paradigms for information access are yet missing. Scatter/Gather is one of the most flexible and interactive browsing approaches existing. In this paper, we present a prototype implementation of Scatter/Gather browsing for hierarchical peer-to-peer networks and discuss some first experiments.

References

[1]
M. Chojnacki. Browsing in Multi-Level-Hypertext. Master's thesis, Universität Duisburg-Essen, 2004.]]
[2]
D. R. Cutting, D. R. Karger, and J. O. Pedersen. Constant interaction-time scatter/gather browsing of very large document collections. In Proceedings of the Sixteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 126--134, New York, 1993. ACM.]]
[3]
D. R. Cutting, J. O. Pedersen, D. Karger, and J. W. Tukey. Scatter/gather: A cluster-based approach to browsing large document collections. In Proceedings of the Fifteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 318--329, New York, 1992. ACM.]]
[4]
M. Eisenhardt, W. Müller, and A. Henrich. Classifying documents by distributed P2P clustering. In K. R. Dittrich, W. König, A. Oberweis, K. Rannenberg, and W. Wahlster, editors, Proceedings Informatik 2003, GI, pages 286--291, 2003.]]
[5]
N. Fuhr, C.-P. Klas, A. Schaefer, and P. Mutschke. Daffodil: An integrated desktop for supporting high-level search activities in federated digital libraries. In Research and Advanced Technology for Digital Libraries. 6th European Conference, ECDL 2002, pages 597--612, Heidelberg et al., 2002. Springer.]]
[6]
J. A. Hartigan and M. A. Wong. A K-means clustering algorithm. Applied Statistics, 28:100--108, 1979.]]
[7]
I. A. Klampanos and J. M. Jose. An architecture for information retrieval over semi-collaborating peer-to-peer networks. In Proceedings of the 2004 ACM symposium on Applied computing, pages 1078--1083, New York, NY, USA, 2004. ACM Press.]]
[8]
W. Müller, M. Eisenhardt, and A. Henrich. Efficient content-based P2P image retrieval using peer content descriptions. In S. Santini and R. Schettini, editors, Internet Imaging V, SPIE, pages 57--68. SPIE/IS&T, 2004.]]
[9]
H. Nottelmann, G. Fischer, A. Titarenko, and A. Nurzenski. An integrated approach for searching and browsing in heterogeneous peer-to-peer networks. In R. Baraglia, D. Laforenza, and F. Silvestri, editors, Proc. Heterogeneous and Distributed Information Retrieval, 2005.]]
[10]
S. E. Robertson, S. Walker, M. Hancock-Beaulieu, A. Gull, and M. Lau. Okapi at TREC. In Text REtrieval Conference, pages 21--30, 1992.]]
[11]
J. Vendrig, M. Worring, and A. W. M. Smeulders. Filter image browsing - exploiting interaction in image retrieval. In VISUAL 99: Proceedings of the Third International Conference on Visual Information and Information Systems, pages 147--154, London, UK, 1999. Springer.]]

Cited By

View all
  • (2018)Search and browse services for heterogeneous collections with the peer-to-peer network PepperInformation Processing and Management: an International Journal10.1016/j.ipm.2006.09.00643:3(624-642)Online publication date: 29-Dec-2018
  • (2013)Studying the clustering paradox and scalability of search in highly distributed environmentsACM Transactions on Information Systems10.1145/2457465.245746831:2(1-36)Online publication date: 17-May-2013
  • (2012)Decentralized Search and the Clustering Paradox in Large Scale Information NetworksNext Generation Search Engines10.4018/978-1-4666-0330-1.ch002(29-46)Online publication date: 2012
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
P2PIR '05: Proceedings of the 2005 ACM workshop on Information retrieval in peer-to-peer networks
November 2005
58 pages
ISBN:1595931643
DOI:10.1145/1096952
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 November 2005

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. browsing
  2. clustering
  3. peer-to-peer networks
  4. scatter/gather

Qualifiers

  • Article

Conference

CIKM05
Sponsor:

Upcoming Conference

CIKM '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2018)Search and browse services for heterogeneous collections with the peer-to-peer network PepperInformation Processing and Management: an International Journal10.1016/j.ipm.2006.09.00643:3(624-642)Online publication date: 29-Dec-2018
  • (2013)Studying the clustering paradox and scalability of search in highly distributed environmentsACM Transactions on Information Systems10.1145/2457465.245746831:2(1-36)Online publication date: 17-May-2013
  • (2012)Decentralized Search and the Clustering Paradox in Large Scale Information NetworksNext Generation Search Engines10.4018/978-1-4666-0330-1.ch002(29-46)Online publication date: 2012
  • (2007)Hunt the Cluster: A Scalable, Interactive Time Bayesian Image Browser for P2P NetworksNinth IEEE International Symposium on Multimedia Workshops (ISMW 2007)10.1109/ISM.Workshops.2007.60(317-322)Online publication date: Dec-2007

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media