Abstract: The present application relates to a method and system for storing data in a graph database. The method includes: separating a key-value structure of the storage engine and separately storing a graph structure and a graph property of graph data; and reading, by the compute engine, the graph structure, caching the graph structure for a short term in a single query request scenario, and caching the graph structure for a long term in a read-only analysis scenario. The present application resolves problems that engineering is complex and deep graph traversal performance is poor when graph data is processed, reduces engineering complexity, and improves the deep graph traversal performance.

Abstract: The present application provides a device protection method, and devices. Said method comprises: acquiring multiple pieces of first security event information generated by an edge security device during operation; performing statistical analysis on the multiple pieces of first security event information, so as to obtain first statistical analysis information; sending the first statistical analysis information to a central security device, so that the central security device generates a first target protection template according to the first statistical analysis information, the first target protection template comprising a security protection policy generated on the basis of the first statistical analysis information; receiving the first target protection template sent by the central security device; and protecting the edge security device according to the security protection policy in the first target protection template.

Abstract: The present application relates to a method and system for storing data in a graph database. The method includes: separating a key-value structure of the storage engine and separately storing a graph structure and a graph property of graph data; and reading, by the compute engine, the graph structure, caching the graph structure for a short term in a single query request scenario, and caching the graph structure for a long term in a read-only analysis scenario. The present application resolves problems that engineering is complex and deep graph traversal performance is poor when graph data is processed, reduces engineering complexity, and improves the deep graph traversal performance.

Abstract: According to an example, a service coordination apparatus may include a processor that is to determine whether each GLB node-pair in a node-pair state table is at a normal state after receiving a DNS request. If a GLB node-pair in the node-pair state table is not at the normal state, a second DNS response may be sent to a node sending the DNS request according to a DNS parsing list. If each GLB node-pair in the node-pair state table is at the normal state, a proximity list may be inquired. If a record corresponding to the DNS request is searched out from the proximity list, a first DNS response may be sent to the node sending the DNS request according to the searched out record. If not, a second DNS response may be sent to the node sending the DNS request according to the DNS parsing list.

Abstract: According to an example, a service coordination apparatus may include a processor that is to determine whether each GLB node-pair in a node-pair state table is at a normal state after receiving a DNS request. If a GLB node-pair in the node-pair state table is not at the normal state, a second DNS response may be sent to a node sending the DNS request according to a DNS parsing list. If each GLB node-pair in the node-pair state table is at the normal state, a proximity list may be inquired. If a record corresponding to the DNS request is searched out from the proximity list, a first DNS response may be sent to the node sending the DNS request according to the searched out record. If not, a second DNS response may be sent to the node sending the DNS request according to the DNS parsing list.