File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A general framework for searching in distributed data repositories

TitleA general framework for searching in distributed data repositories
Authors
KeywordsComputers
Electronic data processing
Issue Date2003
PublisherIEEE, Computer Society.
Citation
IEEE Symposium on Parallel and Distributed Processing Proceedings, Nice, France, 22-26 April 2003, p. 34-41 How to Cite?
AbstractThis paper proposes a general framework for searching large distributed repositories. Examples of such repositories include sites with music/video content, distributed digital libraries, distributed caching systems, etc. The framework is based on the concept of neighborhood; each client keeps a list of the most beneficial sites according to past experience, which are visited first when the client searches for some particular content. Exploration methods continuously update the neighborhoods in order to follow changes in access patterns. Depending on the application, several variations of search and exploration processes are proposed. Experimental evaluation demonstrates the benefits of the framework in different scenarios.
Persistent Identifierhttp://hdl.handle.net/10722/46400
ISSN

 

DC FieldValueLanguage
dc.contributor.authorBakiras, Sen_HK
dc.contributor.authorKalnis, Pen_HK
dc.contributor.authorLoukopoulos, Ten_HK
dc.contributor.authorNg, WSen_HK
dc.date.accessioned2007-10-30T06:49:03Z-
dc.date.available2007-10-30T06:49:03Z-
dc.date.issued2003en_HK
dc.identifier.citationIEEE Symposium on Parallel and Distributed Processing Proceedings, Nice, France, 22-26 April 2003, p. 34-41en_HK
dc.identifier.issn1063-6374en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46400-
dc.description.abstractThis paper proposes a general framework for searching large distributed repositories. Examples of such repositories include sites with music/video content, distributed digital libraries, distributed caching systems, etc. The framework is based on the concept of neighborhood; each client keeps a list of the most beneficial sites according to past experience, which are visited first when the client searches for some particular content. Exploration methods continuously update the neighborhoods in order to follow changes in access patterns. Depending on the application, several variations of search and exploration processes are proposed. Experimental evaluation demonstrates the benefits of the framework in different scenarios.en_HK
dc.format.extent311888 bytes-
dc.format.extent2600 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE, Computer Society.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectComputersen_HK
dc.subjectElectronic data processingen_HK
dc.titleA general framework for searching in distributed data repositoriesen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1063-6374&volume=&spage=34&epage=41&date=2003&atitle=A+general+framework+for+searching+in+distributed+data+repositoriesen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/IPDPS.2003.1213117en_HK
dc.identifier.hkuros82617-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats