Semantic Caching in Location-Dependent Query Processing

Publication Type

Conference Proceeding Article

Publication Date

7-2001

Abstract

A method is presented in this paper for answering location-dependent queries in a mobile computing environment. We investigate a common scenario where data objects (e.g., restaurants and gas stations) are stationary while clients that issue queries about the data objects are mobile. Our proposed technique constructs a Voronoi Diagram (VD) on the data objects to serve as an index for them. A VD defines, for each data object d, the region within which d is the nearest point to any mobile client within that region. As such, the VD can be used to answer nearest-neighbor queries directly. Furthermore, the area within which the answer is valid can be computed. Based on the VD, we develop a semantic caching scheme that records a cached item as well as its valid range. A simulation is conducted to study the performance of the proposed semantic cache in comparison with the traditional cache and the baseline case where no cache is used. We show that the semantic cache has a much better performance than the other two methods.

Keywords

Mobile radiocommunication, Mobility, Database query, Object location, Voronoï diagram, Nearest neighbour, Cache memory, Semantics, Spatial database

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing

Publication

Advances in Spatial and Temporal Databases: 7th International Symposium, SSTD 2001 Redondo Beach, CA, USA, July 12–15, 2001 Proceedings

Volume

2121

First Page

97

Last Page

116

ISBN

9783540477242

Identifier

10.1007/3-540-47724-1_6

Publisher

Springer Verlag

City or Country

LA, California

Additional URL

http://dx.doi.org/10.1007/3-540-47724-1_6

Link to Full Text

Share

COinS