| Distributed caching of multi-dimensional data in mobile environments |
| Full text |
Pdf
(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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 27, Citation Count: 1
|
|
|
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
|
Norbert Beckmann , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.322-331, May 23-26, 1990, Atlantic City, New Jersey, United States
|
| |
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
|
|
|