The quest for correct information on the Web: hyper search engines
Selected papers from the sixth international conference on World Wide Web
The connectivity server: fast access to linkage information on the Web
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
The stochastic approach for link-structure analysis (SALSA) and the TKC effect
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Min-wise independent permutations
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Compression and Coding Algorithms
Compression and Coding Algorithms
Handbook of massive data sets
The Link Database: Fast Access to Graphs of the Web
DCC '02 Proceedings of the Data Compression Conference
Towards Compressing Web Graphs
DCC '01 Proceedings of the Data Compression Conference
Compressing the Graph Structure of the Web
DCC '01 Proceedings of the Data Compression Conference
The WebGraph Framework II: Codes For The World-Wide Web
DCC '04 Proceedings of the Conference on Data Compression
The webgraph framework I: compression techniques
Proceedings of the 13th international conference on World Wide Web
Hits on the web: how does it compare?
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Comparing the effectiveness of hits and salsa
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Link analysis for Web spam detection
ACM Transactions on the Web (TWEB)
A scalable pattern mining approach to web graph compression with communities
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Using the wisdom of the crowds for keyword generation
Proceedings of the 17th international conference on World Wide Web
Efficient and effective link analysis with precomputed salsa maps
Proceedings of the 17th ACM conference on Information and knowledge management
Less is more: sampling the neighborhood graph makes SALSA better and faster
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Using bloom filters to speed up HITS-like ranking algorithms
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
A sketch-based distance oracle for web-scale graphs
Proceedings of the third ACM international conference on Web search and data mining
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
HipG: parallel processing of large-scale graphs
ACM SIGOPS Operating Systems Review
Scalable manipulation of archival web graphs
Proceedings of the 9th workshop on Large-scale and distributed informational retrieval
Of hammers and nails: an empirical comparison of three paradigms for processing large graphs
Proceedings of the fifth ACM international conference on Web search and data mining
Towards effective partition management for large graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Managing large graphs on multi-cores with graph awareness
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Naiad: a timely dataflow system
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
| Hi-index | 0.00 |
This paper describes the Scalable Hyperlink Store, a distributed in-memory "database" for storing large portions of the web graph. SHS is an enabler for research on structural properties of the web graph as well as new link-based ranking algorithms. Previous work on specialized hyperlink databases focused on finding efficient compression algorithms for web graphs. By contrast, this work focuses on the systems issues of building such a database. Specifically, it describes how to build a hyperlink database that is fast, scalable, fault-tolerant, and incrementally updateable.