A general framework for searching in distributed data repositories

Spiridon Bakiras, Panos Kalnis, Thanasis Loukopoulos, Wee Siong Ng

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

This 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.

Original languageEnglish
Title of host publicationProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)0769519261, 9780769519265
DOIs
Publication statusPublished - 2003
Externally publishedYes
EventInternational Parallel and Distributed Processing Symposium, IPDPS 2003 - Nice, France
Duration: 22 Apr 200326 Apr 2003

Other

OtherInternational Parallel and Distributed Processing Symposium, IPDPS 2003
CountryFrance
CityNice
Period22/4/0326/4/03

Fingerprint

Digital libraries
Repository
Digital Libraries
Caching
Music
Experimental Evaluation
Update
Scenarios
Demonstrate
Framework

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Software

Cite this

Bakiras, S., Kalnis, P., Loukopoulos, T., & Ng, W. S. (2003). A general framework for searching in distributed data repositories. In Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003 [1213117] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPDPS.2003.1213117

A general framework for searching in distributed data repositories. / Bakiras, Spiridon; Kalnis, Panos; Loukopoulos, Thanasis; Ng, Wee Siong.

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003. Institute of Electrical and Electronics Engineers Inc., 2003. 1213117.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bakiras, S, Kalnis, P, Loukopoulos, T & Ng, WS 2003, A general framework for searching in distributed data repositories. in Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003., 1213117, Institute of Electrical and Electronics Engineers Inc., International Parallel and Distributed Processing Symposium, IPDPS 2003, Nice, France, 22/4/03. https://doi.org/10.1109/IPDPS.2003.1213117
Bakiras S, Kalnis P, Loukopoulos T, Ng WS. A general framework for searching in distributed data repositories. In Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003. Institute of Electrical and Electronics Engineers Inc. 2003. 1213117 https://doi.org/10.1109/IPDPS.2003.1213117
Bakiras, Spiridon ; Kalnis, Panos ; Loukopoulos, Thanasis ; Ng, Wee Siong. / A general framework for searching in distributed data repositories. Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003. Institute of Electrical and Electronics Engineers Inc., 2003.
@inproceedings{60d9431862fb4c2cb1fa5e92e7fbb29c,
title = "A general framework for searching in distributed data repositories",
abstract = "This 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.",
author = "Spiridon Bakiras and Panos Kalnis and Thanasis Loukopoulos and Ng, {Wee Siong}",
year = "2003",
doi = "10.1109/IPDPS.2003.1213117",
language = "English",
booktitle = "Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - A general framework for searching in distributed data repositories

AU - Bakiras, Spiridon

AU - Kalnis, Panos

AU - Loukopoulos, Thanasis

AU - Ng, Wee Siong

PY - 2003

Y1 - 2003

N2 - This 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.

AB - This 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.

UR - http://www.scopus.com/inward/record.url?scp=84947272823&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947272823&partnerID=8YFLogxK

U2 - 10.1109/IPDPS.2003.1213117

DO - 10.1109/IPDPS.2003.1213117

M3 - Conference contribution

AN - SCOPUS:84947272823

BT - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

PB - Institute of Electrical and Electronics Engineers Inc.

ER -