loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)
A Multi-Resolution Compression Scheme for EfficientWindow Queries over Road Network Databases
Hong Kong, China
December 18-December 22
ISBN: 0-7695-2702-7
Ali Khoshgozaran, University of Southern California Los Angeles, CA
Ali Khodaei, University of Southern California Los Angeles, CA
Mehdi Sharifzadeh, University of Southern California Los Angeles, CA
Cyrus Shahabi, University of Southern California Los Angeles, CA
Vector data and in particular road networks are being queried, hosted, and processed by many application domains such as mobile computing. However, many hosting/ processing clients such as PDAs cannot afford this bulky data due to their storage and transmission limitations. In particular, the result of a typical spatial query such as window query is too huge for a transfer-and-store scenario. While several general vector data compression schemes have been studied by different communities, we propose a novel approach in vector data compression which is easily integrated within a geospatial query processing system. It uses line aggregation to reduce the number of relevant tuples and Huffman compression to achieve a multi-resolution compressed representation of a road network database. Our empirical results verify that our approach exhibits both a high compression ratio and fast query processing.
Citation:
Ali Khoshgozaran, Ali Khodaei, Mehdi Sharifzadeh, Cyrus Shahabi, "A Multi-Resolution Compression Scheme for EfficientWindow Queries over Road Network Databases," icdmw, pp.355-360, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.