Graph @ EDBT

2012

• 
  • 
  • 
  • 
  • 
  João B. Rocha-Junior, Kjetil Nørvåg:
  Top-k spatial keyword queries on road networks. 168-179
• 
  • 
  • 
  • 
  • 
  Chuan Shi, Xiangnan Kong, Philip S. Yu, Sihong Xie, Bin Wu:
  Relevance search in heterogeneous networks. 180-191

• 
• 
• 
• 

Takuya Akiba, Christian Sommer, Ken-ichi Kawarabayashi:
Shortest-path queries for complex networks: exploiting low tree-width outside the core. 144-155

• 
  • 
  • 
  • 
  • 
  Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Hong Cheng:
  Finding top-k similar graphs in graph databases. 456-467
• 
  • 
  • 
  • 
  • 
  Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Qing Zhu, Xiaofang Zhou:
  I/O cost minimization: reachability queries processing over massive graphs. 468-479
• 
  • 
  • 
  • 
  • 
  Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang, Baichen Chen, Jianxin Li:
  Finding maximal k-edge-connected subgraphs from a large graph. 480-491

2013

• 
  • 
  • 
  • 
  • 
  Karam Gouda, Mosab Hassaan:
  Compressed feature-based filtering and verification approach for subgraph search. 287-298
• 
  • 
  • 
  • 
  • 
  François Goasdoué, Ioana Manolescu, Alexandra Roatis:
  Efficient query answering against dynamic RDF databases. 299-310
• 
  • 
  • 
  • 
  • 
  Haichuan Shang, Masaru Kitsuregawa:
  Efficient breadth-first search on large graphs with skewed degree distributions. 311-322

• 
• 
• 
• 

Andreas Wagner, Veli Bicer, Thanh Tran:
Selectivity estimation for hybrid queries over text-rich data graphs. 383-394

2014

• 
  • 
  • 
  • 
  • 
  Tamir Tassa, Francesco Bonchi:
  Privacy Preserving Estimation of Social Influence. 559-570
• 
  • 
  • 
  • 
  • 
  Zach Jorgensen, Ting Yu:
  A Privacy-Preserving Framework for Personalized, Social Recommendations. 571-582
• 
  • 
  • 
  • 
  • 
  Sadegh Nobari, Panagiotis Karras, Hweehwa Pang, Stéphane Bressan:
  L-opacity: Linkage-Aware Graph Anonymization. 583-594
• 
  • 
  • 
  • 
  • 
  Aston Zhang, Xing Xie, Kevin Chen-Chuan Chang, Carl A. Gunter, Jiawei Han, XiaoFeng Wang:
  Privacy Risk in Anonymized Heterogeneous Information Networks. 595-606

• 
  • 
  • 
  • 
  • 
  Renê Rodrigues Veloso, Loïc Cerf, Wagner Meira Jr., Mohammed J. Zaki:
  Reachability Queries in Very Large Graphs: A Fast Refined Online Search Approach. 511-522
• 
  • 
  • 
  • 
  • 
  Dritan Bleco, Yannis Kotidis:
  Graph Analytics on Massive Collections of Small Graphs. 523-534
• 
  • 
  • 
  • 
  • 
  Arijit Khan, Francesco Bonchi, Aristides Gionis, Francesco Gullo:
  Fast Reliability Search in Uncertain Graphs. 535-546
• 
  • 
  • 
  • 
  • 
  Francesco Bonchi, Aristides Gionis, Francesco Gullo, Antti Ukkonen:
  Distance oracles in edge-labeled graphs. 547-558

• 
  • 
  • 
  • 
  • 
  Chenghui Ren, Luyi Mo, Ben Kao, Reynold Cheng, David W. Cheung:
  CLUDE: An Efficient Algorithm for LU Decomposition Over a Sequence of Evolving Graphs. 319-330
• 
  • 
  • 
  • 
  • 
  Mojgan Pourrajabi, Davoud Moulavi, Ricardo J. G. B. Campello, Arthur Zimek, Jörg Sander, Randy Goebel:
  Model Selection for Semi-Supervised Clustering. 331-342
• 
  • 
  • 
  • 
  • 
  Tarique Anwar, Chengfei Liu, Hai L. Vu, Christopher Leckie:
  Spatial Partitioning of Large Urban Road Networks. 343-354

2015

• 
  • 
  • 
  • 
  • 
  Yongrui Qin, Quan Z. Sheng, Wei Emma Zhang:
  SIEF: Efficiently Answering Distance Queries for Failure Prone Graphs. 145-156
• 
  • 
  • 
  • 
  • 
  Sutanay Choudhury, Lawrence B. Holder, George Chin Jr., Khushbu Agarwal, John Feo:
  A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs. 157-168
• 
  • 
  • 
  • 
  • 
  Padmashree Ravindra, Kemafor Anyanwu:
  Scaling Unbound-Property Queries on Big RDF Data Warehouses using MapReduce. 169-180

• 
  • 
  • 
  • 
  • 
  Angela Bonifati, Radu Ciucanu, Aurélien Lemay:
  Learning Path Queries on Graph Databases. 109-120
• 
  • 
  • 
  • 
  • 
  Konstantinos Semertzidis, Evaggelia Pitoura, Kostas Lillis:
  TimeReach: Historical Reachability Queries on Evolving Graphs. 121-132
• 
  • 
  • 
  • 
  • 
  Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, Jian Pei:
  Efficiently Computing Top-K Shortest Path Join. 133-144

• 
  • 
  • 
  • 
  • 
  Yongrui Qin, Quan Z. Sheng, Wei Emma Zhang:
  SIEF: Efficiently Answering Distance Queries for Failure Prone Graphs. 145-156
• 
  • 
  • 
  • 
  • 
  Sutanay Choudhury, Lawrence B. Holder, George Chin Jr., Khushbu Agarwal, John Feo:
  A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs. 157-168
• 
  • 
  • 
  • 
  • 
  Padmashree Ravindra, Kemafor Anyanwu:
  Scaling Unbound-Property Queries on Big RDF Data Warehouses using MapReduce. 169-180