Efficient Compression of Web Graphs
スポンサーリンク
概要
- 論文の詳細を見る
Several methods have been proposed for compressing the linkage data of a Web graph. Among them, the method proposed by Boldi and Vigna is known as the most efficient one. In the paper, we propose a new method to compress a Web graph. Our method is more efficient than theirs with respect to the size of the compressed data. For example, our method needs only 1.99bits per link to compress a Web graph containing 3, 216, 152 links connecting 325, 557 pages, while the method of Boldi and Vigna needs 2.84bits per link to compress the same Web graph.
- （社）電子情報通信学会の論文
- 2009-10-01
著者
-
Nishizeki Takao
Graduate School Of Information Sciences Tohoku University
-
Nishizeki Takao
Graduate School Of Information Sciences
-
ASANO Yasuhito
Graduate School of Informatics, Kyoto University
-
MIYAWAKI Yuya
Graduate School of Information Sciences, Tohoku University
-
Miyawaki Yuya
Graduate School Of Information Sciences Tohoku University
-
Asano Yasuhito
Graduate School Of Informatics Kyoto University
関連論文
- List Edge-Colorings of Series-Parallel Graphs
- Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs (Special Issue on Selected Papers from LA Symposium)
- Quantum Card Dealing
- Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups(Special Issue on Selected Papers from LA Symposium)
- Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs(Discrete Mathematics and Its Applications)
- Algorithms for Drawing Plane Graphs(Foundations of Computer Science)
- 平面グラフの格子短形描画
- On the One-Way Algebraic Homomorphism (Special Section on Cryprography and Information Security)
- Cost Total Colorings of Trees(Foundations of Computer Science)
- LA-10 A Linear Algorithm for Rectangular Drawings of Planar Graphs
- LA-9 Rectangle-of-Influence Drawings of Four-Connected Plane Graphs
- Edge-Coloring Problems for Graphs
- Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework(Data Mining)
- Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size(Graph Algorithms,Foundations of Computer Science)
- Algorithms for Multicolorings of Partial ★-Trees (Special Issue on Selected Papers from LA Symposium)
- Convex Drawings of Internally Triconnected Plane Graphs on O(n^2) Grids
- Best Security Index for Digital Fingerprinting(Information Hiding, Cryptography and Information Security)
- Efficient Compression of Web Graphs
- Generalized Edge-Rankings of Trees
- One-Way Functions over Finite Near-Rings
- Compact Encoding of the Web Graph Exploiting Various Power Distributions(Discrete Mathematics and Its Applications)
- Finding Neighbor Communities in the Web Using an Inter-Site Graph(Database)
- PRACTICAL EFFICIENCY OF THE LINEAR-TIME ALGORITHM FOR THE SINGLE SOURCE SHORTEST PATH PROBLEM
- How can the Web help Wikipedia? A Study of Information Complementation of Wikipedia by the Web
- Re-ranking Content Based Social Image Search Results by Multi Modal Relevance Feedback
- Mining and Explaining Relationships in Wikipedia
- Mining Knowledge on Relationships between Objects from the Web