TY - CHAP
T1 - Aggregate estimations over location based services
AU - Liu, Weimo
AU - Rahman, Md Farhadur
AU - Thirumuruganathan, Saravanan
AU - Zhang, Nan
AU - Das, Gautam
PY - 2015
Y1 - 2015
N2 - Location based services (LBS) have become very popular in recent years. They range from map services (e.g., Google Maps) that store geographic locations of points of interests, to online social networks (e.g., WeChat, Sina Weibo, FourSquare) that leverage user geographic locations to enable various recommendation functions. The public query interfaces of these services may be abstractly modeled as a kNN interface over a database of two dimensional points on a plane: given an arbitrary query point, the system returns the k points in the database that are nearest to the query point. In this paper we consider the problem of obtaining approximate estimates of SUM and COUNT aggregates by only querying such databases via their restrictive public interfaces. We distinguish between interfaces that return location information of the returned tuples (e.g., Google Maps), and interfaces that do not return location information (e.g., SinaWeibo). For both types of interfaces, we develop aggregate estimation algorithms that are based on novel techniques for precisely computing or approximately estimating the Voronoi cell of tuples. We discuss a comprehensive set of real-world experiments for testing our algorithms, including experiments on Google Maps, WeChat, and Sina Weibo.
AB - Location based services (LBS) have become very popular in recent years. They range from map services (e.g., Google Maps) that store geographic locations of points of interests, to online social networks (e.g., WeChat, Sina Weibo, FourSquare) that leverage user geographic locations to enable various recommendation functions. The public query interfaces of these services may be abstractly modeled as a kNN interface over a database of two dimensional points on a plane: given an arbitrary query point, the system returns the k points in the database that are nearest to the query point. In this paper we consider the problem of obtaining approximate estimates of SUM and COUNT aggregates by only querying such databases via their restrictive public interfaces. We distinguish between interfaces that return location information of the returned tuples (e.g., Google Maps), and interfaces that do not return location information (e.g., SinaWeibo). For both types of interfaces, we develop aggregate estimation algorithms that are based on novel techniques for precisely computing or approximately estimating the Voronoi cell of tuples. We discuss a comprehensive set of real-world experiments for testing our algorithms, including experiments on Google Maps, WeChat, and Sina Weibo.
UR - http://www.scopus.com/inward/record.url?scp=84953872869&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84953872869&partnerID=8YFLogxK
U2 - 10.14778/2824032.2824034
DO - 10.14778/2824032.2824034
M3 - Chapter
AN - SCOPUS:84953872869
T3 - Proceedings of the VLDB Endowment
SP - 1334
EP - 1345
BT - Proceedings of the VLDB Endowment
PB - Association for Computing Machinery
T2 - 3rd Workshop on Spatio-Temporal Database Management, STDBM 2006, Co-located with the 32nd International Conference on Very Large Data Bases, VLDB 2006
Y2 - 11 September 2006 through 11 September 2006
ER -