Survey and taxonomy of lossless graph compression and space-efficient graph representations
Various graphs such as web or social networks may contain up to trillions of edges.
Compressing such datasets can accelerate graph processing by reducing the amount of I/O …
Compressing such datasets can accelerate graph processing by reducing the amount of I/O …
[BOOK][B] Google's PageRank and beyond: The science of search engine rankings
AN Langville, CD Meyer - 2006 - degruyter.com
Why doesn't your home page appear on the first page of search results, even when you
query your own name? How do other web pages always appear at the top? What creates …
query your own name? How do other web pages always appear at the top? What creates …
The webgraph framework I: compression techniques
Studying web graphs is often difficult due to their large size. Recently, several proposals
have been published about various techniques that allow tostore a web graph in memory in …
have been published about various techniques that allow tostore a web graph in memory in …
Deeper inside pagerank
AN Langville, CD Meyer - Internet Mathematics, 2004 - Taylor & Francis
This paper serves as a companion or extension to the" Inside PageRank" paper by Bianchini
et al.[Bianchini et al. 03]. It is a comprehensive survey of all issues associated with …
et al.[Bianchini et al. 03]. It is a comprehensive survey of all issues associated with …
A survey on PageRank computing
P Berkhin - Internet mathematics, 2005 - Taylor & Francis
This survey reviews the research related to PageRank computing. Components of a
PageRank vector serve as authority weights for web pages independent of their textual …
PageRank vector serve as authority weights for web pages independent of their textual …
Design and implementation of a high-performance distributed web crawler
V Shkapenyuk, T Suel - Proceedings 18th International …, 2002 - ieeexplore.ieee.org
Broad Web search engines as well as many more specialized search tools rely on Web
crawlers to acquire large collections of pages for indexing and analysis. Such a Web crawler …
crawlers to acquire large collections of pages for indexing and analysis. Such a Web crawler …
An analysis of American academic libraries' websites: 2000‐2010
N Aharony - The electronic library, 2012 - emerald.com
Purpose–The current study seeks to describe and analyze academic library websites in the
years 2000 and 2010, as they appear both in the Internet Archive and in current library …
years 2000 and 2010, as they appear both in the Internet Archive and in current library …
Graph summarization with bounded error
We propose a highly compact two-part representation of a given graph G consisting of a
graph summary and a set of corrections. The graph summary is an aggregate graph in which …
graph summary and a set of corrections. The graph summary is an aggregate graph in which …
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for
in memory adjacency queries, we study the extent to which a large network can be …
in memory adjacency queries, we study the extent to which a large network can be …
Towards goal-oriented semantic signal processing: Applications and future challenges
Advances in machine learning technology have enabled real-time extraction of semantic
information in signals which can revolutionize signal processing techniques and improve …
information in signals which can revolutionize signal processing techniques and improve …