Representing web graphs

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2003, Pages 405-416

  Raghavan, Sriram ^a   Garcia Molina, Hector ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; ENCODING (SYMBOLS); ITERATIVE METHODS; QUERY LANGUAGES; WEBSITES;

GRAPH REPRESENTATION SCHEMES; SUPER-NODE REPRESENTATION; WEB GRAPHS;

DATABASE SYSTEMS;

EID: 0344927784     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. M. Adler and M. Mitzenmacher. Towards compressing Web graphs. In Proc. of IEEE Data Compression Conf., 2001.
2. K. Alsabti, S. Ranka, and V. Singh. An efficient k-means clustering algorithm. In IPPS: 11th Intl. Parallel Processing Symposium, 1998.
3. A. Arasu et. al. Searching the Web. ACM Transactions on Internet Technology, 1(1):2-43, Aug. 2001.
4. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. In Proc. of the 7th Intl. WWW Conf., 1998.
5. A. Broder et. al. Graph structure in the Web: experiments and models. In Proc. of the 9th Intl. WWW Conf., 2000.
6. J. Dean and M. R. Henzinger. Finding related pages in the World Wide Web. Computer Networks, 31(11-16):1467-1479, 1999.
7. C. Gerlhof et. al. Partition-based clustering in object bases: From theory to practice. In Proc. of the Intl. Conf. on Foundations of Data Organization and Algorithms, 1993.
8. R. Goldman and J. Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. In Proc. of the 23rd Intl. Conf. on Very Large Databases, Aug. 1997.
9. A. Kemper and G. Moerkotte. Access support in object bases. In Proc. of the ACM-SIGMOD Intl. Conf. on Management of Data, 1990.
10. J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, Nov. 1999.
11. R. Kumar et. al. The Web as a graph. In Proc. of the 19th ACM Symposium on Principles of Database Systems, May 2000.
12. R. Kumar et. al. Trawling the Web for emerging cyber-communities. In Proc. of the 8th Intl. WWW Conf., 1999.
13. V. Kumar and E. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In Proc. of the 8th IEEE Symposium on Parallel and Distributed Processing, 1996.
14. T. Milo and D. Suciu. Index structures for path expressions. In Proc. of the 7th Intl. Conf. on Database Theory, Jan. 1999.
15. M. Najork and J. L. Wiener. Breadth-first search crawling yields high-quality pages. In Proc. of the 10th Intl. WWW Conf., May 2001.
16. S. Raghavan and H. Garcia-Molina. Representing Web graphs. Technical Report 2002-30, Stanford Univ, June 2002. Available at http://dbpubs.stanford.edu/pub/2002-30.
17. K. Randall et. al. The Link Database: Fast access to graphs of the Web. In Proc. of the Data Compression Conf., 2002.
18. T. Suel and J. Yuan. Compressing the graph structure of the Web. In Proc. of IEEE Data Compression Conf., 2001.
19. M. M. Tsangaris and J. F. Naughton. A stochastic approach for clustering in object bases. In Proc. of the ACM-SIGMOD Intl. Conf. on Management of Data, 1991.