The Optimal-Location Query最优位置查询.pptVIP

Donghui Zhang et al. Optimal Location Query Progressive Computation of The Min-Dist Optimal-Location Query Donghui Zhang, Yang Du, Tian Xia, Yufei Tao* Northeastern University * Chinese University of Hong Kong Motivation “What is the optimal location in Boston area to build a new McDonald’s store?” Suppose a customer drives to the closest McDonald’s. Optimality: Minimize AVG driving distance. Who will be interested? Corporations Chained restaurants (e.g. McDonald’s, Burger King, Starbucks) Supermarkets (e.g. Wal-Mart, Costco, Stop Shop) Location-based service providers (e.g. Verizon, ATT) Computer Scientists especially in Databases Computational Geometry Algorithms min-dist OL min-dist OL min-dist OL Formal Definition Given a set S of sites, a set O of objects, and a query range Q , min-dist OL is a location l ? Q which minimizes Challenging There are infinite number of locations in Q! How to produce a finite set of candidates (yet keeping optimality)? How to avoid computing AD(l) for all candidates? Solution Highlights Algorithm to compute AD(l). Theorems to limit #candidates. Lower-bound of AD(l) for all locations l in a cell C. Progressive algorithm. L1 Distance 1. Compute AD(l) Remember 1. Compute AD(l) Remember 1. Compute AD(l) Remember 1. Compute AD(l) How to compute RNN(l)? How to compute RNN(l)?(1) Compute Voronoi cell How to compute RNN(l)?(2) Retrieve objects 2. Limit #candidates 2. Limit #candidates 2. Limit #candidates 2. VCU(Q) 2. Further Limit #candidates 2. Further Limit #candidates 2. Further Limit #candidates Na?ve Algorithm Derive candidates. Compute AD(l) for each. Pick smallest. Progressive Idea Treat Q as a cell and consider its corners. Progressive Idea Divide the cell. Progressive Idea Divide the cell. Progressive Idea Recursively divide a sub-cell. Progressive Idea Recursively divide a sub-cell. Progressive Idea Q: What do you save? 3. LB(C): lower bound for AD(l), ?l?C 3. LB(C): lower bound for AD(l), ?l?C Theorem: 3. LB(C): low