{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:35:41Z","timestamp":1761917741212,"version":"3.33.0"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:00:00Z","timestamp":1182816000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:00:00Z","timestamp":1182816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s00778-007-0057-y","type":"journal-article","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T14:06:29Z","timestamp":1182780389000},"page":"291-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network"],"prefix":"10.1007","volume":"17","author":[{"given":"Josiane Xavier","family":"Parreira","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Castillo","sequence":"additional","affiliation":[]},{"given":"Debora","family":"Donato","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Michel","sequence":"additional","affiliation":[]},{"given":"Gerhard","family":"Weikum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,6,26]]},"reference":[{"key":"57_CR1","doi-asserted-by":"crossref","unstructured":"Aberer, K.: P-grid: a self-organizing access structure for p2p information systems. In: CoopIS, pp. 179\u2013194 (2001)","DOI":"10.1007\/3-540-44751-2_15"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Aberer, K., Wu, J.: A framework for decentralized ranking in web information retrieval. In: APWeb, pp. 213\u2013226 (2003)","DOI":"10.1007\/3-540-36901-5_23"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Preda, M., Cobena, G.: Adaptive on-line page importance computation. In: WWW Conference, pp. 280\u2013290. ACM Press (2003)","DOI":"10.1145\/775152.775192"},{"key":"57_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1120717.1120721","volume":"5","author":"Z. Abrams","year":"2005","unstructured":"Abrams Z., McGrew R. and Plotkin S. (2005). A non-manipulable trust system based on eigentrust. SIGecom Exch. 5: 21\u201330","journal-title":"SIGecom Exch."},{"key":"57_CR5","unstructured":"Becchetti, L., Castillo, C., Donato, D., Fazzone, A.: A comparison of sampling techniques for web characterization. In: LinkKDD (2006)"},{"key":"57_CR6","unstructured":"Becchetti, L., Castillo, C., Donato, D., Leonardi, S., Baeza-Yates, R.: Using rank propagation and probabilistic counting for link-based spam detection. In: WebKDD. ACM Press, Pennsylvania (2006)"},{"key":"57_CR7","unstructured":"Bencz\u00far, A.A., Csalog\u00e1ny, K., Sarl\u00f3s, T., Uher, M.: Spamrank: \u00c2 fully automatic link spam detection. In: AIRWeb. Chiba (2005)"},{"key":"57_CR8","unstructured":"Bender, M., Michel, S., Parreira, J.X., Crecelius, T.: P2P web search: make it light, make it fly. In: CIDR 07, p. 6. Asilomar (2007)"},{"key":"57_CR9","unstructured":"Bender, M., Michel, S., Triantafillou, P., Weikum, G.: Global document frequency estimation in peer-to-peer web search. In: WebDB 2006, Chicago (2006)"},{"key":"57_CR10","unstructured":"Bender, M., Michel, S., Triantafillou, P., Weikum, G., Zimmer, C.: Minerva: collaborative p2p search. In: VLDB, pp. 1263\u20131266 (2005)"},{"issue":"1","key":"57_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1080\/15427951.2005.10129098","volume":"2","author":"P. Berkhin","year":"2005","unstructured":"Berkhin P. (2005). A survey on pagerank computing. Internet Math. 2(1): 73\u2013120","journal-title":"Internet Math."},{"issue":"7","key":"57_CR12","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom B.H. (1970). Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7): 422\u2013426","journal-title":"Commun. ACM"},{"issue":"1","key":"57_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/1052934.1052942","volume":"5","author":"A. Borodin","year":"2005","unstructured":"Borodin A., Roberts G.O., Rosenthal J.S. and Tsaparas P. (2005). Link analysis ranking: algorithms, theory, and experiments. ACM TOIT 5(1): 231\u2013297","journal-title":"ACM TOIT"},{"key":"57_CR14","doi-asserted-by":"crossref","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: WWW7, pp. 107\u2013117 (1998)","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"57_CR15","unstructured":"Broder, A.: On the resemblance and containment of documents. In: SEQUENCES, p. 21. IEEE Computer Society, Washington (1997)"},{"issue":"3","key":"57_CR16","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"A.Z. Broder","year":"2000","unstructured":"Broder A.Z., Charikar M., Frieze A.M. and Mitzenmacher M. (2000). Min-wise independent permutations. J. Comput. System Sci. 60(3): 630\u2013659","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"57_CR17","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10791-006-7146-1","volume":"9","author":"A.Z. Broder","year":"2006","unstructured":"Broder A.Z., Lempel R., Maghoul F. and Pedersen J.O. (2006). Efficient pagerank approximation via graph aggregation. Inf. Retr. 9(2): 123\u2013138","journal-title":"Inf. Retr."},{"key":"57_CR18","unstructured":"Canright, G., Engo-Monsen, K., Jelasity, M.: Efficient and robust fully distributed power method with an application to link analysis. Tech. Rep. UBLCS-2005-17, University of Bologna, Department of Computer Science, Bologna (2005)"},{"key":"57_CR19","unstructured":"Chakrabarti, S.: Mining the Web: Discovering Knowledge from Hypertext Data. Morgan-Kauffman (2002)"},{"key":"57_CR20","doi-asserted-by":"crossref","unstructured":"Chen, Y.Y., Gan, Q., Suel, T.: Local methods for estimating pagerank values. In: CIKM, pp. 381\u2013389. ACM Press (2004)","DOI":"10.1145\/1031171.1031248"},{"issue":"3","key":"57_CR21","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1080\/15427951.2004.10129090","volume":"1","author":"S. Chien","year":"2004","unstructured":"Chien S., Dwork C., Kumar R., Simon D.R. and Sivakumar D. (2004). Link evolution: analysis and algorithm. Internet Math. 1(3): 277\u2013304","journal-title":"Internet Math."},{"key":"57_CR22","unstructured":"Cho, G., Meyer, C.: Markov chain sensitivity measured by mean first passage times. Tech. rep., NCSU Technical Report #112242-0199 (1999)"},{"key":"57_CR23","volume-title":"Decomposability: Queueing and Computer System Applications","author":"P. Courtois","year":"1977","unstructured":"Courtois P. (1977). Decomposability: Queueing and Computer System Applications. Academic, New York"},{"key":"57_CR24","unstructured":"Cuenca-Acuna, F.M., Peery, C., Martin, R.P., Nguyen, T.D.: Planetp: using gossiping to build content addressable peer-to-peer information sharing communities. In: HPDC, p. 236. IEEE Computer Society, Washington, (2003)"},{"issue":"3","key":"57_CR25","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/572326.572328","volume":"2","author":"S. Dill","year":"2002","unstructured":"Dill S., Kumar R., Mccurley K.S., Rajagopalan S., Sivakumar D. and Tomkins A. (2002). Self-similarity in the web. ACM Trans. Inter. Tech. 2(3): 205\u2013223","journal-title":"ACM Trans. Inter. Tech."},{"key":"57_CR26","doi-asserted-by":"crossref","unstructured":"Drost, I., Scheffer, T.: Thwarting the nigritude ultramarine: learning to identify link spam. In: ECML, Lecture Notes in Artificial Intelligence, vol. 3720, pp. 233\u2013243. Porto (2005)","DOI":"10.1007\/11564096_14"},{"key":"57_CR27","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. In: SIAM Discrete Algorithms (2003)","DOI":"10.1137\/S0895480102412856"},{"issue":"3","key":"57_CR28","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L. Fan","year":"2000","unstructured":"Fan L., Cao P., Almeida J. and Broder A.Z. (2000). Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM TON 8(3): 281\u2013293","journal-title":"IEEE\/ACM TON"},{"issue":"2","key":"57_CR29","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"Flajolet P. and Martin G.N. (1985). Probabilistic counting algorithms for data base applications. J. Comput. System Sci. 31(2): 182\u2013209","journal-title":"J. Comput. System Sci."},{"key":"57_CR30","doi-asserted-by":"crossref","unstructured":"Guha, R., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: WWW, pp. 403\u2013412. ACM Press, New York (2004)","DOI":"10.1145\/988672.988727"},{"key":"57_CR31","unstructured":"Gy\u00f6ngyi, Z., Berkhin, P., Garcia-Molina, H., Pedersen, J.: Link spam detection based on mass estimation. In: VLDB, pp. 439\u2013450 (2006)"},{"key":"57_CR32","unstructured":"Gy\u00f6ngyi, Z., Garcia-Molina, H.: Web spam taxonomy. In: AIRWeb (2005)"},{"key":"57_CR33","doi-asserted-by":"crossref","unstructured":"Gy\u00f6ngyi, Z., Molina, H.G., Pedersen, J.: Combating web spam with trustrank. In: VLDB, pp. 576\u2013587. Morgan Kaufmann, Toronto (2004)","DOI":"10.1016\/B978-012088469-8\/50052-8"},{"issue":"3","key":"57_CR34","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1145\/1082469.1082470","volume":"23","author":"M. Jelasity","year":"2005","unstructured":"Jelasity M., Montresor A. and Babaoglu O. (2005). Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3): 219\u2013252","journal-title":"ACM Trans. Comput. Syst."},{"issue":"1","key":"57_CR35","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.is.2004.09.003","volume":"31","author":"P. Kalnis","year":"2006","unstructured":"Kalnis P., Ng W.S., Ooi B.C. and Tan K.L. (2006). Answering similarity queries in peer-to-peer networks. Inf. Syst. 31(1): 57\u201372","journal-title":"Inf. Syst."},{"key":"57_CR36","unstructured":"Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Exploiting the block structure of the web for computing pagerank. Technical report, Stanford University (2003)"},{"key":"57_CR37","doi-asserted-by":"crossref","unstructured":"Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in p2p networks. In: WWW, pp. 640\u2013651. ACM Press, New York (2003)","DOI":"10.1145\/775152.775242"},{"key":"57_CR38","volume-title":"Finite Markov Chains","author":"J.G. Kemeny","year":"1963","unstructured":"Kemeny J.G. and Snell J.L. (1963). Finite Markov Chains. Van Nostrand, Toronto \u2013 New York"},{"key":"57_CR39","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: FOCS, p. 482. IEEE Computer Society, Washington (2003)"},{"key":"57_CR40","doi-asserted-by":"crossref","unstructured":"Kempe, D., McSherry, F.: A decentralized algorithm for spectral analysis. In: STOC, pp. 561\u2013568. ACM Press, New York (2004)","DOI":"10.1145\/1007352.1007438"},{"issue":"5","key":"57_CR41","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg J.M. (1999). Authoritative sources in a hyperlinked environment. J. ACM 46(5): 604\u2013632","journal-title":"J. ACM"},{"key":"57_CR42","volume-title":"Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers","author":"L. Lamport","year":"2002","unstructured":"Lamport L. (2002). Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley Longman, Boston"},{"key":"57_CR43","unstructured":"Langville, A., Meyer, C.: Updating the stationary vector of an irreducible markov chain with an eye on google\u2019s pagerank. In: SIMAX (2005)"},{"issue":"3","key":"57_CR44","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"A.N. Langville","year":"2004","unstructured":"Langville A.N. and Meyer C.D. (2004). Deeper inside pagerank. Internet Math. 1(3): 335\u2013400","journal-title":"Internet Math."},{"issue":"3","key":"57_CR45","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"A.N. Langville","year":"2004","unstructured":"Langville A.N. and Meyer C.D. (2004). Deeper inside pagerank. Internet Math. 1(3): 335\u2013400","journal-title":"Internet Math."},{"key":"57_CR46","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4946-7","volume-title":"Asymptotic Methods in Statistical Theory","author":"L. Le Cam","year":"1986","unstructured":"Le Cam L. (1986). Asymptotic Methods in Statistical Theory. Springer, New York"},{"key":"57_CR47","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the evolution of peer-to-peer systems. In: PODC, pp. 233\u2013242. ACM Press, New York (2002)","DOI":"10.1145\/571825.571863"},{"issue":"4","key":"57_CR48","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.comnet.2005.07.011","volume":"50","author":"S. Marti","year":"2006","unstructured":"Marti S. and Garcia-Molina H. (2006). Taxonomy of trust: categorizing p2p reputation systems. Comput. Netw. 50(4): 472\u2013484","journal-title":"Comput. Netw."},{"key":"57_CR49","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719512","volume-title":"Matrix Analysis and Applied Linear Algebra","author":"C. Meyer","year":"2000","unstructured":"Meyer C. (2000). Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia"},{"key":"57_CR50","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/PTP.2004.1334938","volume":"00","author":"N. Ntarmos","year":"2004","unstructured":"Ntarmos N. and Triantafillou P. (2004). Seal: Managing accesses and data in peer-to-peer sharing networks. Peer-to-Peer Comput. 00: 116\u2013123","journal-title":"Peer-to-Peer Comput."},{"key":"57_CR51","unstructured":"Parreira, J.X., Donato, D., Michel, S., Weikum, G.: Efficient and decentralized pagerank approximation in a peer-to-peer web search network. In: VLDB. Seoul (2006)"},{"key":"57_CR52","unstructured":"Parreira, J.X., Weikum, G.: Jxp: Global authority scores in a p2p network. In: WebDB, pp. 31\u201336 (2005)"},{"key":"57_CR53","doi-asserted-by":"crossref","unstructured":"Podnar, I., Rajman, M., Luu, T., Klemm, F., Aberer, K.: Scalable peer-to-peer web retrieval with highly discriminative keys. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.368968"},{"key":"57_CR54","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A scalable content-addressable network. In: SIGCOMM, pp. 161\u2013172 (2001)","DOI":"10.1145\/964723.383072"},{"key":"57_CR55","doi-asserted-by":"crossref","unstructured":"Rowstron, A.I.T., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: IFIP\/ACM Middleware, pp. 329\u2013350 (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"issue":"3","key":"57_CR56","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1023\/B:GRID.0000035202.38582.c8","volume":"1","author":"K. Sankaralingam","year":"2003","unstructured":"Sankaralingam K., Yalamanchi M., Sethumadhavan S. and Browne J.C. (2003). Pagerank computation and keyword search on distributed systems and p2p networks. J. Grid Comput. 1(3): 291\u2013307","journal-title":"J. Grid Comput."},{"key":"57_CR57","unstructured":"Shi, S., Yu, J., Yang, G., Wang, D.: Distributed page ranking in structured p2p networks. In: ICPP (2003)"},{"key":"57_CR58","unstructured":"Sizov, S., Theobald, M., Siersdorfer, S., Weikum, G., Graupmann, J., Biwer, M., Zimmer, P.: The bingo! system for information portal generation and expert web search. In: CIDR (2003)"},{"key":"57_CR59","doi-asserted-by":"crossref","unstructured":"Stakhanova, N., Basu, S., Wong, J., Stakhanov, O.: Trust framework for p2p networks using peer-profile based anomaly technique. In: ICDCS Workshops, pp. 203\u2013209 (2005)","DOI":"10.1109\/ICDCSW.2005.137"},{"key":"57_CR60","doi-asserted-by":"crossref","unstructured":"Steinmetz, R., Wehrle, K. (eds.): Peer-to-peer systems and applications, Lecture Notes in Computer Science, vol. 3485. Springer (2005)","DOI":"10.1007\/11530657"},{"key":"57_CR61","volume-title":"Introduction to the Numerical Solution of Markov Chains","author":"W. Stewart","year":"1994","unstructured":"Stewart W. (1994). Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton"},{"key":"57_CR62","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM, pp. 149\u2013160. ACM Press, New York (2001)","DOI":"10.1145\/964723.383071"},{"key":"57_CR63","unstructured":"Suel, T., Mathur, C., Wen Wu, J., Zhang, J., Delis, A., Kharrazi, M., Long, X., Shanmugasundaram, K.: Odissea: a peer-to-peer architecture for scalable web search and information retrieval. In: WWW (2003)"},{"key":"57_CR64","doi-asserted-by":"crossref","unstructured":"Wang, Y., DeWitt, D.J.: Computing pagerank in a distributed internet search system. In: VLDB (2004)","DOI":"10.1016\/B978-012088469-8.50039-5"},{"key":"57_CR65","unstructured":"Wu, B., Goel, V., Davison, B.D.: Propagating trust and distrust to demote web spam. In: Workshop on Models of Trust for the Web. Edinburgh, Scotland (2006)"},{"key":"57_CR66","unstructured":"Wu, J., Aberer, K.: Using a layered markov model for distributed Web ranking computation. In: ICDCS (2005)"},{"issue":"7","key":"57_CR67","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1109\/TKDE.2004.1318566","volume":"16","author":"L. Xiong","year":"2004","unstructured":"Xiong L. and Liu L. (2004). Peertrust: supporting reputation-based trust for peer-to-peer electronic communities. IEEE Trans. on Knowl. Data Eng. 16(7): 843\u2013857","journal-title":"IEEE Trans. on Knowl. Data Eng."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-007-0057-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-007-0057-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-007-0057-y.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-007-0057-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T18:30:36Z","timestamp":1737138636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-007-0057-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,26]]},"references-count":67,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["57"],"URL":"https:\/\/doi.org\/10.1007\/s00778-007-0057-y","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2007,6,26]]},"assertion":[{"value":"16 February 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2007","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}