M. Najork. HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia, New York, NY, USA, ACM, (July 2009)
Abstract
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.
%0 Conference Paper
%1 najork2009scalable
%A Najork, Marc
%B HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia
%C New York, NY, USA
%D 2009
%I ACM
%K database fp018 fullPaper graph ht2009 hyperlink scalability web
%T The Scalable Hyperlink Store
%X 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.
@inproceedings{najork2009scalable,
abstract = {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. },
added-at = {2009-06-16T15:00:02.000+0200},
address = {New York, NY, USA},
author = {Najork, Marc},
biburl = {https://www.bibsonomy.org/bibtex/2456eec518822c6e94fcb6d06ec9e8cf6/ht09},
booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia},
interhash = {4ddfe17ace38e0f40217fc7181285c6a},
intrahash = {456eec518822c6e94fcb6d06ec9e8cf6},
keywords = {database fp018 fullPaper graph ht2009 hyperlink scalability web},
month = {July},
paperid = {fp018},
publisher = {ACM},
session = {Full Paper},
timestamp = {2009-06-16T15:00:03.000+0200},
title = {The Scalable Hyperlink Store},
year = 2009
}