Efficient data dissemination using locale covers

Authors:
Sandeep Gupta;Jinfeng Ni;Chinya V. Ravishankar
Affiliations:
University of California, Riverside, Riverside, CA;University of California, Riverside, Riverside, CA;University of California, Riverside, Riverside, CA
Venue:
Proceedings of the 14th ACM international conference on Information and knowledge management
Year:
2005

Citing 5
Cited 0

A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Broadcast disks: data management for asymmetric communication environments

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Scheduling data broadcast in asymmetric communication environments

Wireless Networks
Data on Air: Organization and Access

IEEE Transactions on Knowledge and Data Engineering
Search K Nearest Neighbors on Air

MDM '03 Proceedings of the 4th International Conference on Mobile Data Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Location-dependent data are central to many emerging applications, ranging from traffic information services to sensor networks. The standard pull- and push-based data dissemination models become unworkable since the data volumes and number of clients are high.We address this problem using locale covers, a subset of the original set of locations of interest, chosen to include at least one location in a suitably defined neighborhood of any client. Since location-dependent values are highly correlated with location, a query can be answered using a location close to the query point.We show that location-dependent queries may be answered satisfactorily using locale covers, with small loss of accuracy. Our approach is independent of locations and speeds of clients, and is applicable to mobile clients.