The Link Database: Fast access to graphs of the Web

Data Compression Conference Proceedings

Volumn 2002-January, Issue , 2002, Pages 122-131

  Randall, K H ^a   Stata, R ^a   Wickremesinghe, R G ^b   Wiener, J L ^a  

^a HEWLETT PACKARD COMPANY   (United States)

^b Duke University   (United States)

Author keywords

Computer science; Databases; Delay; Dictionaries; Mirrors; Random access memory; Read write memory; Uniform resource locators; Web pages; Writing

Indexed keywords

COMPUTER SCIENCE; DATABASE SYSTEMS; DIRECTED GRAPHS; GLOSSARIES; HYPERTEXT SYSTEMS; MIRRORS; RANDOM ACCESS STORAGE; TECHNICAL WRITING; WEBSITES;

COMPRESSION METHODS; COMPRESSION TECHNIQUES; DELAY; DIRECTED EDGES; GRAPH ALGORITHMS; RANDOM ACCESS MEMORY; SPACE REQUIREMENTS; STRONGLY CONNECTED COMPONENT;

DATA COMPRESSION;

EID: 84948402438     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2002.999950     Document Type: Conference Paper

References (22)

1. J. Abello, A. Buchsbaum, and J. Westbrook. A Functional Approach to External Graph Algorithms. Proc. Annual European Symposium on Algorithms, pages 332-343, 1998.
2. M. Adler and M. Mitzenmacher. Towards Compressing Web Graphs. Proceedings of IEEE Data Compression Conference (DCC), March 2001.
3. AltaVista Company, http://www.altavista.com/
4. K. Bharat, A. Broder, J. Dean, and M. Henzinger. A comparison of techniques to find mirrored hosts on the WWW. Proceedings of the ACM Conference on Digital Libraries, 1999.
5. K. Bharat, A. Broder, M. Henzinger, P. Kumar and S. Venkatasubramanian. The Connectivity Server: Fast access to linkage information on the Web. Proc. of 7th Intl World Wide Web Conference, 1998.
6. A. Bookstein and S. Klein. Compression of correlated bit-vectors. Information Systems, 16(4), 1991.
7. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopolan, R. Stata, A. Tomkins, and J. L. Wiener. Graph structure in the Web. Proceedings of 9th Intl World Wide Web Conference, May 2000.
8. S. Brin and L. Page. The Anatomy of a Large-Scale Hypertextual Web Search Engine. Proceedings of the 7th Intl World Wide Web Conference, April 1998.
9. R. Baeza-Yates and B. Tibeiro-Neto. Modern Information Retrieval. Addison-Wesley, NY, 1999.
10. Y. Chiang, M. Goodrich, E. Grove, R Tamassia, D Vengroff, and J. Vitter. External-Memory Graph Algorithms. Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 139-149, January 1995.
11. http://www.google.com
12. J. Goldstein, R. Ramakrishnan, and U. Shaft. Compressing relations and indexes. Proceedings of the IEEE Conference on Data Engineering, pages 370-379, 1998.
13. A. Heydon and M. Najork. Mercator: A scalable, extensible Web crawler. World Wide Web, 2(4), December 1999.
14. J. Kleinberg. Authoritative sources in a hyperlinked environment Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, January 1998.
15. V. Kumar and E. Schwabe. Improved Algorithms and Data Structures for Solving Graph Problems in External Memory. Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing, 1996.
16. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo, California 1992.
17. M. Najork and J. L. Wiener. Breadth-first search crawling yields high-quality pages. Proceedings of the 10th International World Wide Web Conference, May 2001.
18. K. H. Randall, R. Stata, R. G. Wickremesinghe, J. L. Wiener. The Link Database: Fast Access to Graphs of the Web. SRC Research Report 175, Compaq Systems Research Center, 2001.
19. T. Suel and J. Yuan. Compressing the Graph Structure of the Web. Proceedings of the IEEE Data Compression Conference (DCC), March 2001.
20. R. E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 1(2), 1972.
21. T. Westmann, D. Kossman, S. Helmer, G. Moerkotte. The implementation and performance of compressed databases. Sigmod Record, 29 (3), Sept., 2000, pp 55-67.
22. I. Witten, A. Moffat, and T. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishing, San Francisco, 1999.