{10} D. Aldous. On the Markov chain simulation method for uniform combinatorial distributed and simulated annealing. Probability in the Engineering and Informational Sciences, 1: 33-46, 1987.

Crossref

Google Scholar

[11]

{11} K. Bharat and A. Broder. A technique for measuring the relative size and overlap of public Web search engines. In Proceedings of the 7th International World Wide Web Conference (WWW7), pages 379-388, April 1998.

Digital Library

Google Scholar

[12]

{12} A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web: experiments and models. In Proceedings of the 9th International World Wide Web Conference (WWW9), May 2000.

Digital Library

Google Scholar

[13]

{13} D. Gilman. A Chernoff bound for random walks on expander graphs. SIAM J. on Computing, 27(4):1203-1220, 1998.

Digital Library

Google Scholar

[14]

{14} M.R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najrok. Measuring index quality using random walks on the Web. In Proceedings of the 8th International World Wide Web Conference (WWW8), pages 213-225, May 1999.

Digital Library

Google Scholar

[15]

{15} M.R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najrok. On Near-Uniform URL Sampling. In Proceedings of the 9th International World Wide Web Conference (WWW9), pages 295-308, May 2000.

Digital Library

Google Scholar

[16]

{16} N. Kahale. Large deviation for Markov chains. Combinatorics, Probability and Computing , 6:465-474, 1997.

Digital Library

Google Scholar

[17]

{17} S. Lawrence and C.L. Giles. Searching the World Wide Web. Science, 5360(280):98, 1998.

Google Scholar

[18]

{18} S. Lawrence and C.L. Giles. Accessibility of information on the web. Nature, 400:107-109, 1999.

Crossref

Google Scholar

Cited By

View all

Li HShao YDu JCui BChen L(2022)An I/O-efficient disk-based graph system for scalable second-order random walk of large graphsProceedings of the VLDB Endowment10.14778/3529337.352934615:8(1619-1631)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.14778/3529337.3529346
Wang RLi YXie HXu YLui JGavrilovska AZadok E(2020)GraphWalkerProceedings of the 2020 USENIX Conference on Usenix Annual Technical Conference10.5555/3489146.3489184(559-571)Online publication date: 15-Jul-2020
https://dl.acm.org/doi/10.5555/3489146.3489184
Lee CKang MEun D(2019)Non-Markovian Monte Carlo on Directed GraphsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/3322205.33110863:1(1-31)Online publication date: 26-Mar-2019
https://dl.acm.org/doi/10.1145/3322205.3311086
Show More Cited By

Approximating Aggregate Queries about Web Pages via Random Walks
1. Information systems
2. Mathematics of computing
  1. Mathematical analysis
    1. Functional analysis

Recommendations

Approximating expressive queries on graph-modeled data

We present GeX for the approximate matching of complex queries on graph-modeled data.GeX generalizes existing approaches and allows for querying any graph-based datasets.GeX query language supports queries ranging from keyword-based to complex ones.GeX ...
Processing Aggregate Queries with Materialized Views in Data Warehouse Environment

Materialized views, which are derived from base relations and stored in the database, offer opportunities for significant performance gain in query evaluation by providing quick access to the pre-computed data. A materialized view can be utilized in ...
Web communities identification from random walks
ECMLPKDD'06: Proceedings of the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases

We propose a technique for identifying latent Web communities based solely on the hyperlink structure of the WWW, via random walks. Although the topology of the Directed Web Graph encodes important information about the content of individual Web pages, ...

Comments

Information & Contributors

Information

Published In

VLDB '00: Proceedings of the 26th International Conference on Very Large Data Bases

September 2000

724 pages

ISBN:1558607153

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 10 September 2000

Qualifiers

Article

Conference

VLDB00

VLDB00: Very Large Data Bases

September 10 - 14, 2000

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li HShao YDu JCui BChen L(2022)An I/O-efficient disk-based graph system for scalable second-order random walk of large graphsProceedings of the VLDB Endowment10.14778/3529337.352934615:8(1619-1631)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.14778/3529337.3529346
Wang RLi YXie HXu YLui JGavrilovska AZadok E(2020)GraphWalkerProceedings of the 2020 USENIX Conference on Usenix Annual Technical Conference10.5555/3489146.3489184(559-571)Online publication date: 15-Jul-2020
https://dl.acm.org/doi/10.5555/3489146.3489184
Lee CKang MEun D(2019)Non-Markovian Monte Carlo on Directed GraphsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/3322205.33110863:1(1-31)Online publication date: 26-Mar-2019
https://dl.acm.org/doi/10.1145/3322205.3311086
Yin HWang WZhang XLyu YMin GGuo D(2017)UMCRACM Transactions on Intelligent Systems and Technology10.1145/31022929:1(1-19)Online publication date: 13-Sep-2017
https://dl.acm.org/doi/10.1145/3102292
Chiericetti FDasgupta AKumar RLattanzi SSarlós TBourdeau JHendler JNkambou RHorrocks IZhao B(2016)On Sampling Nodes in a NetworkProceedings of the 25th International Conference on World Wide Web10.1145/2872427.2883045(471-481)Online publication date: 11-Apr-2016
https://dl.acm.org/doi/10.1145/2872427.2883045
Zhang MWang CBu JYu ZLu YZhang RChen CCarriço LMirri SGuerreiro TThiessen P(2015)An optimal sampling method for web accessibility quantitative metricProceedings of the 12th International Web for All Conference10.1145/2745555.2746663(1-4)Online publication date: 18-May-2015
https://dl.acm.org/doi/10.1145/2745555.2746663
Thomas P(2012)To what problem is distributed information retrieval the solution?Journal of the American Society for Information Science and Technology10.1002/asi.2268463:7(1471-1476)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1002/asi.22684
Dalvi NKumar RMachanavajjhala ARastogi VApte CGhosh JSmyth P(2011)Sampling hidden objects using nearest-neighbor oraclesProceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining10.1145/2020408.2020606(1325-1333)Online publication date: 21-Aug-2011
https://dl.acm.org/doi/10.1145/2020408.2020606
Bar-Yossef ZGurevich M(2011)Efficient Search Engine MeasurementsACM Transactions on the Web10.1145/2019643.20196455:4(1-48)Online publication date: 1-Oct-2011
https://dl.acm.org/doi/10.1145/2019643.2019645
Backstrom LKleinberg JSadagopan SRamamritham KKumar ARavindra MBertino EKumar R(2011)Network bucket testingProceedings of the 20th international conference on World wide web10.1145/1963405.1963492(615-624)Online publication date: 28-Mar-2011
https://dl.acm.org/doi/10.1145/1963405.1963492
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Approximating expressive queries on graph-modeled data

Processing Aggregate Queries with Materialized Views in Data Warehouse Environment

Web communities identification from random walks

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations