Abstract: Advanced query processing is a critical problem for the application of DHT networks. It has attracted much attention from both academic and industrial community. This paper presented a technique for multi-dimensional complex query processing based on Kademlia. It takes user's preference into consideration so that homogeneous data is relevantly indexed. Furthermore, the index maintenance brings no extra communication cost by piggybacking on routing table recovery, besides the advantages in resilience and load balance. The analysis and simulation results show that it implemenu multi-dimensional complex query processing with O(logN) query length and low cost.

Key words: Multi-dimensional ctuery, Complex c}uert', Distributed hash table, Peer-to-peer