Article in Proceedings INPROC-2004-01

BibliographyBürklen, Susanne; Marrón, Pedro José; Rothermel, Kurt: An Enhanced Hoarding Approach Based on Graph Analysis.
In: Proceedings of the 5th IEEE International Conference on Mobile Data Management (MDM 2004); Berkeley, California, USA; January 19-22, 2004.
University of Stuttgart : Collaborative Research Center SFB 627 (Nexus: World Models for Mobile Context-Based Systems).
pp. 358-369, english.
Los Alamitos: IEEE Computer Society, January 2004.
Article in Proceedings (Conference Paper).
CorporationInternational Conference on Mobile Data Management
CR-SchemaH.3.4 (Information Storage and Retrieval Systems and Software)
I.5.3 (Pattern Recognition Clustering)
Abstract

The proliferation of mobile devices has led to the creation of hoarding algorithms that attempt to mitigate the problems related with disconnected operation or with the operation in areas where bandwidth is either scarce or very expensive. Traditional hoarding approaches use probability access tables to determine what information needs to be sent to the mobile device, but fail to take the structured nature of data into account. In this paper, we present an enhanced hoarding approach for semistructured information that relies on the analysis of graphs to determine the information that needs to be hoarded. We show by means of experimental evaluations on webpages that our approach outperforms other hoarding algorithms that treat information as the combination of unrelated items.

Full text and
other links
Nexus Project
Contactbuerklse@informatik.uni-stuttgart.de
Department(s)University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems
Project(s)SFB-627, A2 (University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems)
Entry dateSeptember 15, 2003
   Publ. Department   Publ. Institute   Publ. Computer Science