Sigmod11 outsource shortest path

Neighborhood-Privacy Protected Shortest Distance Computing in Cloud Jun Gao , Jeffrey Yu Xu, Ruoming Jin, Jiashuai Zhou, Tengjiao Wang, Dongqing Yang 14 Jun, 2011, Greece, SIGMOD 2012

Outline ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Graph data management in cloud Co a uthor Network , from manyeyes.alphaworks.ibm.com ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Cloud Computing ,[object Object],[object Object],[object Object],[object Object],[object Object],Can we use the cloud serve to manage graph data , such as to answer shortest distance ?

Security issues in graph outsourcing ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],We have to strike a balance between the security and the computational cost saving using cloud server

Framework of graph outsourcing ,[object Object],[object Object],[object Object],Client Side Original Graph Graph Transformation Link graph Results Result Combination Cloud Server Outsourced Graph Query Evaluation Query Rewriting Query (2) (1) (3)

Structural Anonymization ,[object Object],[object Object],[object Object],Original graph 4-isomorphism Attacker’s query find 4 sub-graphs No shortest distance preservation No consideration of edge weight

Feature preservation graph transformation ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],No support of exact distance computing No explicit security guarantee

Shortest distance index ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],No security consideration

1- Neighborhood-d-Radius Graph ,[object Object],[object Object],[object Object],[object Object],( 1-neighborhood ): for any node pair u and v ∈ Vo, (u, v) ∉ E ( d-radius ): for any node pair u and v ∈ Vo, δ G (u, v) >= d. Original graph Attacker’s query 2-radius graph

1-Neighborhood-d-Radius Graph too strong? ,[object Object],[object Object],[object Object],Original graph non-2-radius graph

Utilization: Shortest Distance Computation ,[object Object],…… u v

Graph Transformation Problem ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Naive Method ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Greedy Method ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Step 1: Enumerate shortest path and benefit assignment ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Step 2: Generate one outsourced graph ,[object Object],[object Object],[object Object],[object Object],[object Object]

Graph transformation with approximate answer ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Relaxed outsourced graph construction ,[object Object],[object Object],[object Object],[object Object]

Estimation of average additive error ,[object Object],[object Object],[object Object],[object Object]

Heuristic outsourced node selection ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Experiment ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Time cost with cloud server Time cost without cloud server

Results related with exact answers ,[object Object],[object Object],[object Object],[object Object],[object Object]

Results related with exact answers (cont.) ,[object Object],[object Object],[object Object],[object Object],[object Object]

Results related with approximate answers ,[object Object],[object Object],[object Object],[object Object]

Results related with approximate answers(cont.) ,[object Object],[object Object],[object Object],[object Object]

Conclusion & Future work ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Sigmod11 outsource shortest path

Recomendados

Recomendados

Más contenido relacionado

La actualidad más candente

La actualidad más candente (19)

Destacado

Destacado (13)

Similar a Sigmod11 outsource shortest path

Similar a Sigmod11 outsource shortest path (20)

Último

Último (20)

Sigmod11 outsource shortest path

Notas del editor