A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities

In the future it is likely that peer communities will be routinely established for the purpose of sharing electronic resources and targeted information among groups of peers with common interests. This sharing will be possible by building on existing Internet technologies, such as web applications and services, and peer-to-peer networks. Today many peer-to-peer networks do not work well for sharing large heterogeneous collections among common home users. In this paper we present a model for organizing personal knowledge and a two-fold framework for improving methods of information sharing. Our framework is based on a) the creation of compact, portable, organizational objects through the ad-hoc structuring of knowledge on a personal computer, and b) the aggregation of these organizational objects into a visual catalog that can provide a peer community with a conceptual view of the information resources residing in the community. We call our model the BookQuest framework, and we show how it addresses several key information sharing issues, including space-efficient summarization, naming and locating resources in a peer community, and user interface and visualization issues. Our model introduces a variety of techniques for space-efficient representations, including use of generalized Bloom filters to support relevancy ranked keyword searches, and statistical sampling methods to support similarity comparisons between collections. We describe applications of our model to peer-based, inquiry orientated educational

[1]  Robin D. Burke,et al.  Salticus: guided crawling for personal digital libraries , 2001, JCDL '01.

[2]  Michael Mitzenmacher,et al.  Compressed bloom filters , 2001, PODC '01.

[3]  John Kubiatowicz,et al.  Probabilistic location and routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Wolfgang Nejdl Semantic Web and Peer-to-Peer Technologies for Distributed Learning Repositories , 2002, Intelligent Information Processing.

[5]  Tore Risch,et al.  EDUTELLA: a P2P networking infrastructure based on RDF , 2002, WWW.

[6]  Christiane Fellbaum,et al.  Book Reviews: WordNet: An Electronic Lexical Database , 1999, CL.

[7]  Steven Hazel,et al.  Achord: A Variant of the Chord Lookup Service for Use in Censorship Resistant Peer-to-Peer Publishing Systems , 2002 .

[8]  Christine L. Borgman NSF Workshop on Post-Digital Libraries Initiative Directions , 2003 .

[9]  Christine L Borgman Personal digital libraries: Creating individual spaces for innovation , 2005 .

[10]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[11]  Alan M. Frieze,et al.  Min-Wise Independent Permutations , 2000, J. Comput. Syst. Sci..

[12]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[13]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[14]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[15]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[16]  Randy H. Katz,et al.  SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network , 2002, Pervasive.

[17]  Ian Clarke,et al.  Protecting Free Expression Online with Freenet , 2002, IEEE Internet Comput..

[18]  Richard P. Martin,et al.  PlanetP: Infrastructure Support for P2P Information Sharing , 2001 .

[19]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[20]  Yossi Matias,et al.  Spectral bloom filters , 2003, SIGMOD '03.