Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about web pages via random walks. In Proceedings of Twenty-Sixth VLDB Conference, Cairo, Egypt, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Locating Information with Uncertainty in Fully.. - Kaporis.. (2001) (Correct)
....This is the part that can be easily explored by most Web users and search engines and contains the most useful content of the Web. This model of the Web has been adopted and used for the approximation of aggregate and selection queries about Web pages via random walks, mainly in the indexable Web [5]. Small modifications can be made to the natural Web graph to obtain an undirected, regular, and strongly connected graph. A crucial observation is that the minimum number of hops for moving from a node to any other node in the Web is bounded from above by a small constant [1] Since this constant ....
Ziv Bar-Yossef, Alexander Berg, Steve Chien, Jittat Fakcharoenphol, and Dror Weitz (2000) Approximating Aggregate Queries about Web Pages via Random Walks. In Proc. 26th International Conference on Very Large Databases, 535--544.
Design and Implementation of a High-Performance Distributed.. - Shkapenyuk, Suel (2002) (21 citations) (Correct)
....specialized collections that are significantly more up to date than a broad search engine. Random Walking and Sampling: Several techniques have been studied that use random walks on the web graph (or a slightly modified graph) to sample pages or estimate the size and quality of search engines [3, 15, 14]. Crawling the Hidden Web : A lot of the data accessible via the web actually resides in databases and can only be retrieved by posting appropriate queries and or filling out forms on web pages. Recently, a lot of interest has focused on automatic access to this data, also called the Hidden ....
Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about web pages via random walks. In Proc. of 26th Int. Conf. on Very Large Data Bases, September 2000.
Searching the Web - Arasu, Cho, Garcia-Molia, Paepcke.. (2001) (6 citations) (Correct)
....ability of search engines. For the last item, discriminating ability, it is possible to exploit the linkage among Web pages to better identify the truly relevant pages. There is no question that the Web is huge and challenging to deal with. Several studies have estimated the size of the Web [4, 42, 41, 6], and while they report slightly di#erent numbers, most of them agree that over a billion pages are available. Given that the average size of a Web page is around 5 10K bytes, just the textual data amounts to at least tens of terabytes. The growth rate of the Web is even more dramatic. According ....
Ziv Bar-Yossef, Alexander Berg, Steve Chien, and Jittat Fakcharoenphol Dror Weitz. Approximating aggregate queries about web pages via random walks. In Proceedings of the Twenty-sixth International Conference on Very Large Databases, 2000.
The Structure of Broad Topics on the Web - Chakrabarti, Joshi, Punera.. (2002) (13 citations) (Correct)
....almost 16 million pages. Our study reveals the following properties about communities of broad topics in the Web graph. Convergence of topic distribution on undirected random walks: Algorithms for sampling Web pages uar have been evaluated on structural properties such as degree distributions [2, 32]. Extending these techniques, we design a certain undirected random walk (i.e. assuming hyperlinks are bidirectional) to estimate the distribution of Web pages w.r.t. the Dmoz topics (3) We start from drastically di#erent topics, and as we strike out longer and longer random paths, the topic ....
....Rusmevichientong et al. 32] have enhanced this algorithm and proved that uniform sampling is achieved asymptotically. The Bar Yossef random walk: An alternative to the biased walk followed by the correction is to modify the graph so that the walk itself becomes unbiased. Bar Yossef et al. [2] achieve this by turning the Web graph into an undirected, regular graph, for which the PageRank vector is known to have identical values for all nodes. The links are made undirected by using the link: backlink query facility given by search engines. This strategy parasites on other people ....
[Article contains additional citation context not shown here]
Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about Web pages via random walks. In Proceedings of the 26th International Conference on Very Large Databases (VLDB), pages 535-- 544, 2000. Online at http://www.cs.berkeley.edu/~zivi/papers/ webwalker/webwalker.ps.gz.
Sic Transit Gloria Telae: Towards an Understanding of the .. - Bar-Yossef, Broder, al. (2004) (2 citations) Self-citation (Bar-yossef) (Correct)
No context found.
Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about web pages via random walks. In Proceedings of the 26th International Conference on Very Large Databases, pages 535--544, 2000.
A Study On The Evolution Of The Web - Alexandros Ntoulas Junghoo (Correct)
No context found.
Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about web pages via random walks. In Proceedings of Twenty-Sixth VLDB Conference, Cairo, Egypt, 2000.
Scaling Link-Based Similarity Search - Aniel Fogaras Budapest (2005) (Correct)
No context found.
Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about web pages via random walks. Proc. of VLDB, 2000.
What's New on the Web? The Evolution of the Web from a.. - Ntoulas, Cho, Olston (2004) (Correct)
No context found.
Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about web pages via random walks. In VLDB 2000.
Scaling Link-Based Similarity Search - Fogaras, Racz (2005) (Correct)
No context found.
Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about web pages via random walks. Proc. of VLDB, 2000.
Methods for Sampling Pages Uniformly from the World.. - Rusmevichientong.. (2001) (4 citations) (Correct)
No context found.
Bar-Yossef, Z.; Berg, A.; Chien, S.; and Fakcharoenphol, J. 2000. Approximating aggregate queries about web pages via random walks. In Proceedings of the 26th International Conference on Very Large Data Bases.
Efficient Algorithms for Sampling and Clustering of Large.. - Orponen, Schaeffer (Correct)
No context found.
Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about Web pages via random walks. In Proceedings of the 26th International Conference on Very Large Data Bases (VLDB'00), pages 535--544, Palo Alto, CA, 2000. Morgan Kaufmann.
Querying Web Data - The WebQA Approach - Lam, Özsu (Correct)
No context found.
Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about Web pages via random walks. In Proceedings of 26th International Conference on Very Large Data Bases (VLDB), pages 535--544, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC