ppt课件-a research studyon maintenanceof x m l updates（一个研究胜负maintenanceof x m l更新）.pptVIP

Range and kNN Searching in P2P Manesh Subhash Ni Yuan Sun Chong Outline Range query searching in P2P one dimension range query multi-dimension range query comparison of range query searching in P2P kNN searching in P2P scalable nearest neighbor searching PierSearch Conclusion Motivation Most P2P systems support only simple lookup queries The DHT based approaches such as Chord, CAN are not suitable for range queries More complicated queries such as range query and kNN searching is needed P-Tree [APJ+04] B+-tree is widely used for efficiently evaluating range queries in c