Compressed graph construction method and device based on relational data

The invention discloses a compressed graph construction method and device based on relational data, and particularly relates to the field of computers, and the method comprises the following steps: S1, merging query information; performing similar merging on the query requests generated by the SQL, and merging the query requests oriented to the same data set into one query instruction for query; s3, selecting a processing node; allocating processing nodes to the plurality of merging requests; s4, reading hard disk data; reading corresponding data from a hard disk according to various tasks processed by the nodes, and combining the data into a query result set; s5, sending valid data; and S4, sending the query result set synthesized in the step S4 to a query requester to complete the whole query request. According to the method, the to-be-queried requests are merged in the same type and then searched, so that the system operation amount is reduced, and the relational data query speed is increased; and nodes ar