Efficient Subgraph Search on Large Anonymized Graphs

Foreword to the special issue of green cloud computing: Methodology and practice

“…Large‐scale data processing is a problem that must be faced in green cloud computing. Ding et al consider the data structure of the graph and propose an index structure named Closure + ‐tree to process the subgraph query efficiently. Wang et al consider the shortcoming of collaborative filtering in processing large‐scale data and propose a new method for training autoencoder‐based CF.…”