Broadcast Schedules and Query Processing for k Nearest Neighbors Search on Multi-dimensiona.pdfVIP

2006 IEEE Conference on Systems, Man, and Cybernetics October 8-11, 2006, Taipei, Taiwan 1-4244-0100-3/06/$20.00 ?2006 IEEE Broadcast Schedules and Query Processing for k Nearest Neighbors Search on Multi-dimensional Index Trees in a Multi-Channel Environment Shu-Yu Fu and Chuan-Ming Liu Abstract—Broadcasting data with an index is an effective way to disseminate public information to a large clients. For a server, using multiple channels to provide services (e.g., location-based services) makes the broadcast cycle shorter than using one channel. Among location-based services, t