Graph aggregation is a technology that aggregates a large-scale graph into a compact and small-scale graph while retaining the structure and attribute information of the original graph. With the increasing size of graph

graph data becomes difficult to query and store. Distance-based queries

such as shortest path queries

depend heavily on the size of graph.In this paper

a distance query-oriented attribute weighted graph aggregation algorithm is proposed

which not only guarantees the similarity of structure and attributes between nodes

but also preserves the distance between nodes

and effectively reduces the size of the graph. The experiments prove that this method is effective and efficient in the query tasks.