{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:36:17Z","timestamp":1761917777943,"version":"3.38.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,10,16]],"date-time":"2010-10-16T00:00:00Z","timestamp":1287187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00778-010-0204-8","type":"journal-article","created":{"date-parts":[[2010,10,15]],"date-time":"2010-10-15T18:38:11Z","timestamp":1287167891000},"page":"445-470","source":"Crossref","is-referenced-by-count":28,"title":["Index design and query processing for graph conductance search"],"prefix":"10.1007","volume":"20","author":[{"given":"Soumen","family":"Chakrabarti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Pathak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manish","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,16]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Preda, M., Cobena, G.: Adaptive on-line page importance computation. In: WWW Conference, pp. 280\u2013290 (2003)","key":"204_CR1","DOI":"10.1145\/775152.775192"},{"doi-asserted-by":"crossref","unstructured":"Adler, M., Mitzenmacher, M.: Towards compressing Web graphs. In: Data Compression Conference, pp. 203\u2013212 (2001)","key":"204_CR2","DOI":"10.1109\/DCC.2001.917151"},{"doi-asserted-by":"crossref","unstructured":"Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: A system for keyword-based search over relational databases. In: ICDE. IEEE, San Jose, CA (2002)","key":"204_CR3","DOI":"10.1145\/564691.564782"},{"doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Botev, C., Shanmugasundaram, J.: TeXQuery: A full-text search extension to XQuery. In: WWW Conference, pp. 583\u2013594. New York (2004)","key":"204_CR4","DOI":"10.1145\/988672.988751"},{"doi-asserted-by":"crossref","unstructured":"Babcock, B., Datar, M., Motwani, R., O\u2019Callaghan, L.: Maintaining variance and k-medians over data stream windows. In: PODS Conference, pp. 234\u2013243. ACM (2003)","key":"204_CR5","DOI":"10.1145\/773153.773176"},{"doi-asserted-by":"crossref","unstructured":"Balmin, A., Hristidis, V., Papakonstantinou, Y.: Authority-based keyword queries in databases using ObjectRank. In: VLDB Conference, Toronto (2004)","key":"204_CR6","DOI":"10.1016\/B978-012088469-8.50051-6"},{"doi-asserted-by":"crossref","unstructured":"Bar-Yossef, Z., Broder, A.Z., Kumar, R., Tomkins, A.: Sic Transit Gloria Telae: Towards an understanding of the Web\u2019s decay. In: WWW Conference, pp. 328\u2013337 (2004)","key":"204_CR7","DOI":"10.1145\/988672.988716"},{"doi-asserted-by":"crossref","unstructured":"Berkhin, P.: Bookmark-coloring approach to personalized pagerank computing. Internet Math. 3(1), (2007)","key":"204_CR8","DOI":"10.1080\/15427951.2006.10129116"},{"unstructured":"Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using BANKS. In: ICDE IEEE (2002)","key":"204_CR9"},{"doi-asserted-by":"crossref","unstructured":"Bharat, K., Br\u00f6der, A., Henzinger, M., Kumar, P., Venkatasubramanian, S.: The connectivity server: fast access to linkage information on the Web. In: WWW Conference, Brisbane, Australia (1998)","key":"204_CR10","DOI":"10.1016\/S0169-7552(98)80047-0"},{"unstructured":"Borthwick, A., Sterling, J., Agichtein, E., Grishman, R.: Exploiting diverse knowledge sources via maximum entropy in named entity recognition. In: Sixth Workshop on Very Large Corpora. Association for Computational Linguistics (1998)","key":"204_CR11"},{"doi-asserted-by":"crossref","unstructured":"Chakrabarti, S.: Dynamic personalized PageRank in entity-relation graphs. In: WWW Conference, Banff (2007)","key":"204_CR12","DOI":"10.1145\/1242572.1242650"},{"doi-asserted-by":"crossref","unstructured":"Chakrabarti, S., Agarwal, A.: Learning parameters in entity relationship graphs from ranking preferences. In: PKDD Conference, LNCS, vol. 4213, pp. 91\u2013102. Berlin (2006)","key":"204_CR13","DOI":"10.1007\/11871637_13"},{"doi-asserted-by":"crossref","unstructured":"Chakrabarti, S., Mirchandani, J., Nandi, A.: SPIN: Searching personal information networks. In SIGIR Conference, pp. 674\u2013674 (2005)","key":"204_CR14","DOI":"10.1145\/1076034.1076186"},{"doi-asserted-by":"crossref","unstructured":"Chakrabarti, S., Puniyani, K., Das, S.: Optimizing scoring functions and indexes for proximity search in type-annotated corpora. In: WWW Conference. Edinburgh (2006)","key":"204_CR15","DOI":"10.1145\/1135777.1135882"},{"issue":"6","key":"204_CR16","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1145\/355541.355554","volume":"47","author":"B. Chazelle","year":"2000","unstructured":"Chazelle B.: The soft heap: an approximate priority queue with optimal error rate. JACM 47(6), 1012\u20131027 (2000)","journal-title":"JACM"},{"unstructured":"Cohen, E.: Estimating the size of the transitive closure in linear time. In: FOCS Conference, pp. 190\u2013200 (1994)","key":"204_CR17"},{"doi-asserted-by":"crossref","unstructured":"Craswell, N., Szummer, M.: Random walks on the click graph. In: SIGIR Conference, pp. 239\u2013246. ACM (2007)","key":"204_CR18","DOI":"10.1145\/1277741.1277784"},{"doi-asserted-by":"crossref","unstructured":"Dalvi, B., Kshirsagar, M., Sudarshan, S.: Keyword search on external memory data graphs. In: VLDB Conference (2008)","key":"204_CR19","DOI":"10.14778\/1453856.1453982"},{"doi-asserted-by":"crossref","unstructured":"Doyle, P., Snell, L.: Random walk and electric networks. In: Mathematical Association of America (1984)","key":"204_CR20","DOI":"10.5948\/UPO9781614440222"},{"issue":"4","key":"204_CR21","first-page":"614","volume":"66","author":"R. Fagin","year":"2003","unstructured":"Fagin R., Lotem A., Naor M.: Optimal aggregation algorithms for middleware. JCSS 66(4), 614\u2013656 (2003)","journal-title":"JCSS"},{"unstructured":"Faloutsos, C., McCurley, K.S., Tomkins, A.: Connection subgraphs in social networks. In: Workshop on Link Analysis, Counterterrorism, and Privacy. SDM Conference (2004)","key":"204_CR22"},{"doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM, pp. 251\u2013262 (1999)","key":"204_CR23","DOI":"10.1145\/316194.316229"},{"issue":"3","key":"204_CR24","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","volume":"2","author":"D. Fogaras","year":"2005","unstructured":"Fogaras D., R\u00e1cz B., Csalog\u00e1ny K., Sarl\u00f3s T.: Towards scaling fully personalized PageRank: algorithms, lower bounds, and experiments. Internet Math. 2(3), 333\u2013358 (2005)","journal-title":"Internet Math."},{"issue":"2","key":"204_CR25","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/152610.152611","volume":"25","author":"G. Graefe","year":"1993","unstructured":"Graefe G.: Query evaluation techniques for large databases. ACM Computing Survey 25(2), 73\u2013170 (1993)","journal-title":"ACM Computing Survey"},{"doi-asserted-by":"crossref","unstructured":"Grishman, R., Sundheim, B.: Message understanding conference-6: A brief history. In: Proceedings of the 16th conference on Computational linguistics, pp. 466\u2013471. Association for Computational Linguistics (1996)","key":"204_CR26","DOI":"10.3115\/992628.992709"},{"doi-asserted-by":"crossref","unstructured":"Gupta, M., Pathak, A., Chakrabarti, S.: Fast algorithms for top-k personalized PageRank queries. In: WWW Conference, pp. 1225\u20131226 (2008)","key":"204_CR27","DOI":"10.1145\/1367497.1367738"},{"doi-asserted-by":"crossref","unstructured":"Gy\u00f6ngyi, Z., Garcia-Molina, H., Pedersen, J.: Combating web spam with TrustRank. In: VLDB Conference, pp. 576\u2013587. (2004)","key":"204_CR28","DOI":"10.1016\/B978-012088469-8.50052-8"},{"issue":"1","key":"204_CR29","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han J., Pei J., Yin Y., Mao R.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min Knowl Discov 8(1), 53\u201387 (2004)","journal-title":"Data Min Knowl Discov"},{"doi-asserted-by":"crossref","unstructured":"Hwang, H., Balmin, A., Reinwald, B., Nijkamp, E.: BinRank: scaling dynamic authority-based search using materialized subgraphs. In: ICDE, pp. 66\u201377. IEEE Computer Society (2009)","key":"204_CR30","DOI":"10.1109\/ICDE.2009.94"},{"doi-asserted-by":"crossref","unstructured":"J\u00e4rvelin, K., Kek\u00e4l\u00e4inen, J.: IR evaluation methods for retrieving highly relevant documents. In: SIGIR Conference, pp. 41\u201348 (2000)","key":"204_CR31","DOI":"10.1145\/345508.345545"},{"doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: WWW Conference, pp. 271\u2013279 (2003)","key":"204_CR32","DOI":"10.1145\/775152.775191"},{"doi-asserted-by":"crossref","unstructured":"Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Extrapolation methods for accelerating PageRank computations. In: WWW Conference, pp. 261\u2013270 (2003)","key":"204_CR33","DOI":"10.1145\/775189.775190"},{"issue":"5","key":"204_CR34","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg J.M.: Authoritative sources in a hyperlinked environment. JACM 46(5), 604\u2013632 (1999)","journal-title":"JACM"},{"doi-asserted-by":"crossref","unstructured":"Koren, Y., North, S.C., Volinsky, C.: Measuring and extracting proximity in networks. In: SIGKDD Conference, pp. 245\u2013255. ACM (2006)","key":"204_CR35","DOI":"10.1145\/1150402.1150432"},{"doi-asserted-by":"crossref","unstructured":"Koudas, N., Srivastava, D.: Data stream query processing. In: ICDE p. 1145 (2005)","key":"204_CR36","DOI":"10.1109\/ICDE.2005.43"},{"issue":"2","key":"204_CR37","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10791-005-5661-0","volume":"8","author":"R. Lempel","year":"2005","unstructured":"Lempel R., Moran S.: Rank-stability and rank-similarity of link-based web ranking algorithms in authority-connected graphs. Information Retrieval 8(2), 245\u2013264 (2005)","journal-title":"Information Retrieval"},{"key":"204_CR38","volume-title":"Foundations of Statistical Natural Language Processing","author":"C.D. Manning","year":"1999","unstructured":"Manning C.D., Sch\u00fctze H.: Foundations of Statistical Natural Language Processing. MIT, Cambridge (1999)"},{"doi-asserted-by":"crossref","unstructured":"McSherry, F.: A uniform approach to accelerated pagerank computation. In: WWW Conference, pp. 575\u2013582 (2005)","key":"204_CR39","DOI":"10.1145\/1060745.1060829"},{"unstructured":"Miller, G., Beckwith, R., FellBaum, C., Gross, D., Miller, K., Tengi, R.: Five Papers on WordNet. Princeton University (1993)","key":"204_CR40"},{"doi-asserted-by":"crossref","unstructured":"Minkov, E., Ng, A., Cohen, W.W.: Contextual search and name disambiguation in email using graphs. In: SIGIR Conference (2006)","key":"204_CR41","DOI":"10.1145\/1148170.1148179"},{"unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the Web. Manuscript, Stanford University (1998)","key":"204_CR42"},{"doi-asserted-by":"crossref","unstructured":"Pan, J.-Y., Yang, H.-J., Faloutsos, C., Duygulu, P.: Automatic multimedia cross-modal correlation discovery. In: SIGKDD Conference, pp. 653\u2013658 (2004)","key":"204_CR43","DOI":"10.1145\/1014052.1014135"},{"doi-asserted-by":"crossref","unstructured":"Pandurangan, G., Raghavan, P., Upfal, E.: Using PageRank to characterize web structure. In: COCOON, LNCS 2387, pp. 330\u2013339 (2002)","key":"204_CR44","DOI":"10.1007\/3-540-45655-4_36"},{"doi-asserted-by":"crossref","unstructured":"Pathak, A., Chakrabarti, S., Gupta, M.S.: Index design for dynamic personalized PageRank. In: ICDE, pp. 1489\u20131491 (2008)","key":"204_CR45","DOI":"10.1109\/ICDE.2008.4497599"},{"unstructured":"Sarkar, P., Moore, A.W.: A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In: UAI Conference (2007)","key":"204_CR46"},{"doi-asserted-by":"crossref","unstructured":"Sarkar, P., Moore, A.W., Prakash, A.: Fast incremental proximity search in large graphs. In: ICML, pp. 896\u2013903 (2008)","key":"204_CR47","DOI":"10.1145\/1390156.1390269"},{"unstructured":"Silverstein, C., Henzinger, M., Marais, H., Moricz, M.: Analysis of a very large AltaVista query log. Technical Report 1998-014, COMPAQ System Research Center (1998)","key":"204_CR48"},{"unstructured":"Sleator, D.D., Temperley, D.: Parsing English with a link grammar. In: Third International Workshop on Parsing Technologies (1993)","key":"204_CR49"},{"doi-asserted-by":"crossref","unstructured":"Theobald, M., Weikum, G., Schenkel, R.: Top-k query evaluation with probabilistic guarantees. In: VLDB Conference, pp. 648\u2013659 (2004)","key":"204_CR50","DOI":"10.1016\/B978-012088469-8\/50058-9"},{"doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C.: Center-piece subgraphs: problem definition and fast solutions. In: SIGKDD Conference (2006)","key":"204_CR51","DOI":"10.1145\/1150402.1150448"},{"doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Koren, Y.: Fast direction-aware proximity for graph mining. In: SIGKDD Conference, pp. 747\u2013756. ACM (2007)","key":"204_CR52","DOI":"10.1145\/1281192.1281272"},{"doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Pan, J.-Y.: Fast random walk with restart and its applications. In: ICDM (2006)","key":"204_CR53","DOI":"10.1109\/ICDM.2006.70"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-010-0204-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-010-0204-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-010-0204-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T20:31:18Z","timestamp":1740601878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-010-0204-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,16]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["204"],"URL":"https:\/\/doi.org\/10.1007\/s00778-010-0204-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2010,10,16]]}}}