English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Challenges of Distributed Search Across Digital Libraries

MPS-Authors
/persons/resource/persons44113

Bender,  Matthias
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45041

Michel,  Sebastian
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45720

Weikum,  Gerhard
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45808

Zimmer,  Christian
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45720

Weikum,  Gerhard
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bender, M., Michel, S., Weikum, G., & Zimmer, C. (2005). Challenges of Distributed Search Across Digital Libraries. In Proceedings of the 8th International Workshop of the DELOS Network of Excellence on Digital Libraries on Future Digital Library Management Systems (System Architecture & Information Access) (pp. 55-59). Dagstuhl, Germany: Information Society Techonologies.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2604-3
Abstract
We present the MINERVA project that tackles the problem of collaborative search across a large number of digital libraries. The search engine is layered on top of a Chord-style peer-to-peer overlay network that connects an a-priori unlimited number of peers or digital libraries. Each library posts a small amount of metadata to a conceptually global, but physically distributed directory. This directory is is used to efficiently select promising libraries to execute a query based on their local data. The paper discusses current challenges regarding replication, caching and proactive dissemination, query routing based on local user profiles such as bookmarks, and benefit/cost models for query routing.