The scalable hyperlink store

Proceedings of the 20th ACM Conference on Hypertext and Hypermedia, HT'09

Volumn , Issue , 2009, Pages 89-98

  Najork, Marc ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Hyperlink database; Scalability; Web graph

Indexed keywords

COMPRESSION ALGORITHMS; FAULT-TOLERANT; HYPERLINK DATABASE; HYPERLINKS; LINK-BASED RANKING; SYSTEMS ISSUES; WEB GRAPHS; WORK FOCUS;

HYPERTEXT SYSTEMS; SCALABILITY;

DATABASE SYSTEMS;

EID: 70450181204     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557914.1557933     Document Type: Conference Paper

References (25)

1. M. Adler and M. Mitzenmacher. Towards Compressing Web Graphs. In 11th IEEE Data Compression Conference, March 2001, pages 203-212.
2. L. Becchetti, C. Castillo, D. Donato, R. Baeza-Yates, and S. Leonardi. Link Analysis for Web Spam Detection. ACM Transactions on the Web, 2(1), 2008.
3. K. Bharat, A. Broder, M. Henzinger, P. Kumar, and S. Venkatasubramanian. The Connectivity Server: fast access to linkage information on the Web. In 7th International World Wide Web Conference, April 1998, pages 469-477.
4. P. Boldi and S. Vigna. The WebGraph Framework I: Compression Techniques. In 13th International World Wide Web Conference, May 2004, pages 595-601.
5. P. Boldi and S. Vigna. The WebGraph Framework II: Codes For The World-Wide Web. In 14th IEEE Data Compression Conference, March 2004, page 528.
6. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-Wise Independent Permutations. Journal of Computer and System Sciences 60(3):630-659, 2000.
7. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the Web. In 9th International World Wide Web Conference, May 2000, pages 309-320.
8. G. Buehrer and K. Chellapilla. A Scalable Pattern Mining Approach to Web Graph Compression with Communities. In 1st Intl. Conf. on Web Search and Data Mining, February 2008, pages 95-106.
9. A. Fuxman, P. Tsaparas, K. Achan, and R. Agrawal. Using the Wisdom of the Crowds for Keyword Generation. In 17th International World Wide Web Conference, April 2008, pages 61-70.
10. S. Gollapudi, M. Najork, and R. Panigrahy. Using Bloom Filters to Speed Up HITS-like Ranking Algorithms. In 5th Workshop on Algorithms and Models for the Web-Graph, December 2007, pages 195-201.
11. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. In 9th Annual ACM-SIAM Symposium on Discrete Algorithms, January 1998, pages 668-677.
12. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for Emerging Cyber-Communities. In 8th International World Wide Web Conference, May 1999, pages 11-16.
13. R. Lempel and S. Moran. The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Computer Networks and ISDN Systems, 33(1-6):387-401, 2000.
14. M. Marchiori. The quest for correct information on the Web: Hyper search engines. In Computer Networks and ISDN Systems, 29(8-13):1225-1236, 1997.
15. A. Moffat and A. Turpin. Compression and Coding Algorithms. Kluwer Academic Publishers, 2002.
16. M. Najork. System and method for maintaining a distributed database of hyperlinks. US Patent 7340467; filed April 2003, issued March 2008.
17. M. Najork. Comparing the Effectiveness of HITS and SALSA. In 16th ACM Conference on Information and Knowledge Management, November 2007, pages 157-164.
18. M. Najork and N. Craswell. Efficient and Effective Link Analysis with Precomputed SALSA Maps. In 17th ACM Conference on Information and Knowledge Management, October 2008, pages 53-61.
19. M. Najork, S. Gollapudi, and R. Panigrahy. Less is More: Sampling the Neighborhood Graph Makes SALSA Better and Faster. In 2nd ACM International Conference on Web Search and Data Mining, February 2009, pages 242-251.
20. M. Najork and A. Heydon. High-PerformanceWeb Crawling. In Handbook of Massive Data Sets, Kluwer Academic Publishers, 2002.
21. M. Najork, H. Zaragoza, and M. Taylor. HITS on the Web: How does it Compare? In 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, July 2007, pages 471-478.
22. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
23. K. Randall, R. Stata, R. Wickremesinghe, and J. Wiener. The Link Database: Fast Access to Graphs of the Web. In 12th IEEE Data Compression Conference, April 2002, pages 122-131.
24. T. Suel and J. Yuan. Compressing the Graph Structure of the Web. In 11th IEEE Data Compression Conference, March 2001, pages 213-222.
25. I. Witten, A. Moffat, and T. Bell. Managing Gigabytes (2nd edition). Academic Press, 1999.