Skyline query has recently received a lot of attention in information service community.The TPAOSS (Three-Phase Algorithm for Optimizing Skyline Scalar) algorithm has two performance drawbacks:(1) in the third phase of TPAOSS

as the number of objects on net nodes increases

the length of bloom filter will increases exponentially

which will seriously influence the efficiency of obtaining replicated values and the occupation size of memory;(2) the TPAOSS algorithm does not consider the computation efficiency of local or global subspace skyline queries in each net node.Motivated by these facts

we propose EPSSQDN (Efficient Processing of Subspace Skyline Queries in Distributed Networks)

an algorithm for efficient processing of subspace skyline queries in SPA distributed networks.Moreover

in order to further reduce the computation cost of subspace skyline queries and decrease the volume of data transferred

we present an efficient optimized techniques.Furthermore

we present extensive experiments that demonstrate our method is more advantageous than the TPAOSS algorithm.