Journal: VLDB J.

Volume 31, Issue 2

201 -- 202Angela Bonifati, Hannes Voigt. Special issue on big graph data management and processing
203 -- 226Kai Wang 0037, Xuemin Lin 0001, Lu Qin 0001, Wenjie Zhang 0001, Ying Zhang 0001. Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs
227 -- 252Qingyuan Linghu, Fan Zhang 0036, Xuemin Lin 0001, Wenjie Zhang 0001, Ying Zhang 0001. Anchored coreness: efficient reinforcement of social networks
253 -- 286Da Yan 0001, Wenwen Qu, Guimu Guo, Xiaoling Wang, Yang Zhou 0001. PrefixFPM: a parallel framework for general-purpose mining of frequent and closed patterns
287 -- 320Da Yan 0001, Guimu Guo, Jalal Khalil, M. Tamer Özsu, Wei-Shinn Ku, John C. S. Lui. G-thinker: a general distributed framework for finding qualified subgraphs in a big graph with load balancing
321 -- 346Aisha Mohamed, Ghadeer AbuOda, Abdurrahman Ghanem, Zoi Kaoudi, Ashraf Aboulnaga. RDFFrames: knowledge graph access for machine learning tools
347 -- 373Tomer Sagi, Matteo Lissandrini, Torben Bach Pedersen, Katja Hose. A design space for RDF data representations
375 -- 401Christopher Rost, Kevin Gómez, Matthias Täschner, Philip Fritzsche, Lucas Schons, Lukas Christ, Timo Adameit, Martin Junghanns, Erhard Rahm. Distributed temporal graph analytics with GRADOOP
403 -- 429Glenn S. Bevilacqua, Laks V. S. Lakshmanan. A fractional memory-efficient approach for online continuous-time influence maximization