ACM Home Page
Please provide us with feedback. Feedback
Distributed caching of multi-dimensional data in mobile environments
Full text PdfPdf (307 KB)
Source International Conference On Mobile Data Management archive
Proceedings of the 6th international conference on Mobile data management table of contents
Ayia Napa, Cyprus
SESSION: Dissemination of data and context table of contents
Pages: 229 - 233  
Year of Publication: 2005
ISBN:1-59593-041-8
Authors
Bin Liu  Hong Kong University of Science and Technology, Clearwater Bay, Hong Kong
Wang-Chien Lee  Pennsylvania State University, University Park, PA
Dik Lun Lee  Hong Kong University of Science and Technology, Clearwater Bay, Hong Kong
Sponsors
: University of Cyprus
SIGMOD: ACM Special Interest Group on Management of Data
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 29,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1071246.1071281
What is a DOI?

ABSTRACT

Caching has been an important technique for saving network traffic and reducing response time, especially in mobile environments where bandwidth is often a scarce resource. In this paper, we propose a novel approach for caching multidimensional data in a cluster of mobile devices. In particular, we focus on the most common types of multi-dimensional queries, namely range and k-nearest neighbor queries, by computing a cacheable region for every query, caching the result at the client, and indexing it in an R*-tree at the cluster gateway. Subsequent queries are first issued to the R*-tree and only remainder queries or queries that cannot be guaranteed exact answers are sent to the remote data server. To the best of our knowledge, our work is the first to study caching results from complex multi-dimensional queries (e.g., kNN query) and propose to build an R*-tree on previously fetched query results in a cluster of mobile devices. Rigorous experiments show that our approach significantly reduces network traffic and response time.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
Liu, B., Lee, W., Lee, D. Distributed Caching of Multi-dimensional Data in Mobile Environments. (available at http://ihome.ust.hk/~liubin).
5
 
6
 
7
 
8


Collaborative Colleagues:
Bin Liu: colleagues
Wang-Chien Lee: colleagues
Dik Lun Lee: colleagues