## Neighbor Query Friendly Compression of Social Networks ∗

Citations: | 8 - 1 self |

### BibTeX

@MISC{Maserrat_neighborquery,

author = {Hossein Maserrat and Jian Pei},

title = {Neighbor Query Friendly Compression of Social Networks ∗},

year = {}

}

### OpenURL

### Abstract

Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they still can be queried efficiently without decompression. Arguably, neighbor queries, which search for all neighbors of a query vertex, are the most essential operations on social networks. Can we compress social networks effectively in a neighbor query friendly manner, that is, neighbor queries still can be answered in sublinear time using the compression? In this paper, we develop an effective social network compression approach achieved by a novel Eulerian data structure using multi-position linearizations of directed graphs. Our method comes with a nontrivial theoretical bound on the compression rate. To the best of our

### Citations

8557 |
Introduction to Algorithms
- Cormen, Leiserson, et al.
- 2001
(Show Context)
Citation Context .../2, 1}. Please note that the induction in the proof of Lemma 1 also gives an algorithm to find an optimal MP1 linearization of a graph G. Since the complexity of finding an Eulerian path is O(|E(G)|) =-=[9]-=-, finding an optimal MP1 linearization of a graph G is also of the same complexity. Example 6. In Figure 2, ¯ G2 has 6 vertices of odd degrees, namely v1, v2, v4, v5, v7 and v8. Therefore, the lower b... |

1918 |
Collective dynamics of ‘small-world’ networks
- Watts, Strogatz
- 1998
(Show Context)
Citation Context ...{{u1, u2} ∈ E( ¯ G)|u1, u2 ∈ Nv} be the set of edges between the vertices in Nv. For a directed graph G we use its underlying undirected graph ¯ G to define Acc(G), the average clustering coefficient =-=[16]-=-, as Acc(G) = Acc( ¯ G) = 1 |V ( ¯ G)| X v∈V ( ¯ G) 2|Ev| |Nv|(|Nv| − 1) Moreover, we define Gcc(G), the global clustering coefficient [14], as Gcc(G) = Gcc( ¯ 2 G) = P v∈V ( ¯ G) |Ev| P |Nv|(|Nv| − 1... |

1671 |
Social Network Analysis: Methods and Applications
- Wasserman, Faust
- 2010
(Show Context)
Citation Context ...aph ¯ G to define Acc(G), the average clustering coefficient [16], as Acc(G) = Acc( ¯ G) = 1 |V ( ¯ G)| X v∈V ( ¯ G) 2|Ev| |Nv|(|Nv| − 1) Moreover, we define Gcc(G), the global clustering coefficient =-=[14]-=-, as Gcc(G) = Gcc( ¯ 2 G) = P v∈V ( ¯ G) |Ev| P |Nv|(|Nv| − 1) v∈V ( ¯ G) 3.2 Neighbor Queries in Directed Graphs In a directed graph G, there are two types of neighbors. For a vertex u ∈ V (G), v1 ∈ ... |

195 | Minwise independent permutations
- Broder, Charikar, et al.
(Show Context)
Citation Context ...t al. [8] extended the Web graph compression framework [4, 5] by Boldi and Vigna (the BV schema) to compress social networks. The central idea is to introduce an ordering based on Jaccard coefficient =-=[6]-=-. By integrating this ordering into the BV schema, they introduced a compression schema for social networks. They further exploited the reciprocal edges. However, one drawback is that their method can... |

174 | Representing Web Graphs
- Raghavan, Molina
- 2003
(Show Context)
Citation Context ...ion, Boldi et al. [3] further developed new orderings combining host information and Gray/lexicographic orderings. Orthogonal to the exploitation of lexicographic ordering, Raghavan and Garcia-Molina =-=[12]-=- decomposed a Web graph into a hierarchical structure. They used the notion of S-node to capture the locality property of Web graphs. Suel and Yuan [15] also used the structural decomposition techniqu... |

161 | The webgraph framework I: Compression techniques
- Boldi, Vigna
(Show Context)
Citation Context ... of URLs of Web pages for compressing the graph. Their method takes advantage of the fact that many hyperlinks are intra-host, and many pages on the same host have similar hyperlinks. Boldi and Vigna =-=[4, 5]-=- further exploited the properties of Web pages in lexicographic ordering to achieve better compression. Specifically, their method takes advantage of the lexicographic locality in Web graphs. That is,... |

118 | A survey of graph layout problems
- Diaz, Petit, et al.
- 2002
(Show Context)
Citation Context ...inear time. Our study is also related to the family of graph layout (or graph ordering) problems, where the goal is to find an ordering of the nodes minimizing a given objective function. Díaz et al. =-=[10]-=- presented a nice survey. In particular, Papadimitriou [11] proved the NP-hardness of the minimum bandwidth problem, where the objective is to minimize the maximum stretch of the edges. 3. PRELIMINARI... |

81 | Towards compressing web graphs
- Adler, Mitzenmacher
- 2001
(Show Context)
Citation Context ...hs has received substantial research interest. A Web graph typically contains a huge number of Web pages as vertices, and an even larger number of hyperlinks as directed edges. Adler and Mitzenmacher =-=[1]-=- gave a Web graph compression method by finding nodes with similar sets of neighbors. Randall et al. [13] were the first to use the lexicographic ordering of URLs of Web pages for compressing the grap... |

74 |
The np-completeness of the bandwidth minimization problem
- Papadimitriou
- 1976
(Show Context)
Citation Context ...h layout (or graph ordering) problems, where the goal is to find an ordering of the nodes minimizing a given objective function. Díaz et al. [10] presented a nice survey. In particular, Papadimitriou =-=[11]-=- proved the NP-hardness of the minimum bandwidth problem, where the objective is to minimize the maximum stretch of the edges. 3. PRELIMINARIES In this section, we review the essential notions used in... |

49 | Compressing the graph structure of the web
- Suel, Yuan
- 2001
(Show Context)
Citation Context ...icographic ordering, Raghavan and Garcia-Molina [12] decomposed a Web graph into a hierarchical structure. They used the notion of S-node to capture the locality property of Web graphs. Suel and Yuan =-=[15]-=- also used the structural decomposition technique in some sense by distinguishing between local and global links. Recently, Apostolico and Drovandi [2] introduced a BFS-based method. Their approach al... |

35 | On compressing social networks
- Chierichetti, Kumar, et al.
- 1997
(Show Context)
Citation Context ...links in the lexicographic order of web pages. Can social networks, which do not have a natural lexicographic order for the vertices, be compressible to the same degree? Recently, Chierichetti et al. =-=[8]-=- extended the Web graph compression framework [4, 5] by Boldi and Vigna (the BV schema) to compress social networks. The central idea is to introduce an ordering based on Jaccard coefficient [6]. By i... |

35 | The link database: Fast access to graphs of the web
- Randall, Stata, et al.
- 2001
(Show Context)
Citation Context ... as vertices, and an even larger number of hyperlinks as directed edges. Adler and Mitzenmacher [1] gave a Web graph compression method by finding nodes with similar sets of neighbors. Randall et al. =-=[13]-=- were the first to use the lexicographic ordering of URLs of Web pages for compressing the graph. Their method takes advantage of the fact that many hyperlinks are intra-host, and many pages on the sa... |

27 | The webgraph framework ii: Codes for the world-wide web
- Boldi, Vigna
- 2004
(Show Context)
Citation Context ... of URLs of Web pages for compressing the graph. Their method takes advantage of the fact that many hyperlinks are intra-host, and many pages on the same host have similar hyperlinks. Boldi and Vigna =-=[4, 5]-=- further exploited the properties of Web pages in lexicographic ordering to achieve better compression. Specifically, their method takes advantage of the lexicographic locality in Web graphs. That is,... |

21 |
A scalable pattern mining approach to web graph compression with communities
- Buehrer, Chellapilla
- 2008
(Show Context)
Citation Context ...cal and global links. Recently, Apostolico and Drovandi [2] introduced a BFS-based method. Their approach also encodes the gaps between links, but uses a more general setting. Buehrer and Chellapilla =-=[7]-=- used a data mining approach to tackle the problem of compressing Web graphs. Using frequent item-set mining techniques they mined the complete bipartite subgraphs and replaced the edges of those subg... |

10 | Permuting Web Graphs
- Boldi, Santini, et al.
- 2009
(Show Context)
Citation Context ...ly, their method takes advantage of the lexicographic locality in Web graphs. That is, proximal pages in URL lexicographic order often have similar neighborhoods. For better compression, Boldi et al. =-=[3]-=- further developed new orderings combining host information and Gray/lexicographic orderings. Orthogonal to the exploitation of lexicographic ordering, Raghavan and Garcia-Molina [12] decomposed a Web... |

7 |
Graph compression by BFS
- Apostolico, Drovandi
(Show Context)
Citation Context ... locality property of Web graphs. Suel and Yuan [15] also used the structural decomposition technique in some sense by distinguishing between local and global links. Recently, Apostolico and Drovandi =-=[2]-=- introduced a BFS-based method. Their approach also encodes the gaps between links, but uses a more general setting. Buehrer and Chellapilla [7] used a data mining approach to tackle the problem of co... |