Segmentation-Based Caching for Mobile Auctions

  • Authors:
  • Stefan Böttcher;Sebastian Obermeier;Adelhard Türling;Jan Henrik Wiesner

  • Affiliations:
  • University of Paderborn, Fürstenallee 11, 33102 Paderborn, Germany, {stb | so | mellow | henry}@uni-paderborn.de;University of Paderborn, Fürstenallee 11, 33102 Paderborn, Germany, {stb | so | mellow | henry}@uni-paderborn.de;University of Paderborn, Fürstenallee 11, 33102 Paderborn, Germany, {stb | so | mellow | henry}@uni-paderborn.de;University of Paderborn, Fürstenallee 11, 33102 Paderborn, Germany, {stb | so | mellow | henry}@uni-paderborn.de

  • Venue:
  • Proceedings of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Whenever e-commerce applications want to distribute XML data over mobile networks, the limitted battery power requires to reduce the amount of exchanged data. Therefore, we propose a technique to identify parts of the database that are more frequently queried than other parts, to cache these parts, and to reuse them for answering following queries. In this paper, we present a data shipping strategy based on a segmentation of an XML database that not only reduces the amount of transferred data within the whole network, but also simplifies the method of testing whether an intermediate participant that routes a query can contribute to this query. Furthermore, we use the XMark benchmark for experimentally evaluating how the use of our segmentation within a typical mobile auction scenario can reduce the total amount of transferred data.