This paper presents a structured P2P overlay SCAN that augments CAN overlay with long links based on Kleinberg's small-world model in a d-dimensional Cartesian space. The construction of long links does not require the estimate of network size. Queries in multi-dimensional data space can achieve O(log n) hops by equipping each node with O(log n) long links and O(d) short links. Categories and Subject Descriptors H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval ? Search process. General Terms Algorithms, Design, Experimentation. Keywords P2P, small-world, multi-dimensional queries.