| 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.
|
 Additional Information
|
Citation:
Susanne Bürklen, Pedro José Marrón, Kurt Rothermel,
"An Enhanced Hoarding Approach Based on Graph Analysis,"
mdm,
p. 358,
2004 IEEE International Conference on Mobile Data Management (MDM'04),
2004
|
