<FONT face=Verdana>Skyline query processing in distributed environments has recently received a lot of attention in information retrieval community. However

most existing literatures do not consider how to efficiently reduce the transferring cost of skyline quereis on distributed networks. In this paper

we propose RTCSQDN(Reducing the Transferring Cost of Skyline Queries over Distributed Networks)

the efficient sound and complete algorithm for balancing the cost of transferring data and skyline computation cost on the distributed networks. Specially

the PDSQDN algorithm makes use of the semantic rela-tionship between parent-space skylines and child-space skylines

and transfers the data through three phases. Moreover

we present a novel policy

i.e. PTGPV (Policy for Transferring Grouping Position Values)

to transfer multi-dimensional objects. The PTGPV policy only transfers the position values of objects for most dimensional-spaces

and hence it can efficiently minimize the volume of data transferred. We also present detailed theoretical analyses and extensive experiments that dem-onstrate our algorithms are both efficient and effective.