{"id":"https://openalex.org/W2803328829","doi":"https://doi.org/10.14778/3204028.3204029","title":"Indexed fast network proximity querying","display_name":"Indexed fast network proximity querying","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2803328829","doi":"https://doi.org/10.14778/3204028.3204029","mag":"2803328829"},"language":"en","primary_location":{"id":"doi:10.14778/3204028.3204029","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3204028.3204029","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087032049","display_name":"Mustafa Co\u015fkun","orcid":"https://orcid.org/0000-0003-4805-1416"},"institutions":[{"id":"https://openalex.org/I58956616","display_name":"Case Western Reserve University","ror":"https://ror.org/051fd9666","country_code":"US","type":"education","lineage":["https://openalex.org/I58956616"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mustafa Co\u015fkun","raw_affiliation_strings":["Case Western Reserve University and HBKU, Doha, Qatar"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Case Western Reserve University and HBKU, Doha, Qatar","institution_ids":["https://openalex.org/I58956616"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019202832","display_name":"Ananth Grama","orcid":"https://orcid.org/0000-0002-9378-9244"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ananth Grama","raw_affiliation_strings":["Purdue University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035558591","display_name":"Mehmet Koyut\u00fcrk","orcid":"https://orcid.org/0000-0002-3434-5512"},"institutions":[{"id":"https://openalex.org/I58956616","display_name":"Case Western Reserve University","ror":"https://ror.org/051fd9666","country_code":"US","type":"education","lineage":["https://openalex.org/I58956616"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mehmet Koyut\u00fcrk","raw_affiliation_strings":["Case Western Reserve University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Case Western Reserve University","institution_ids":["https://openalex.org/I58956616"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6651,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.6856547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"11","issue":"8","first_page":"840","last_page":"852"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7187522649765015},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.6139976382255554},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6129103302955627},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5726352334022522},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.5628906488418579},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.5101990699768066},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4955846071243286},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48852455615997314},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37659940123558044},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.2313109040260315},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.21195504069328308},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1648024022579193},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.09659948945045471}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7187522649765015},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6139976382255554},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6129103302955627},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5726352334022522},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.5628906488418579},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.5101990699768066},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4955846071243286},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48852455615997314},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37659940123558044},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.2313109040260315},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.21195504069328308},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1648024022579193},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.09659948945045471},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/3204028.3204029","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3204028.3204029","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W103340358","https://openalex.org/W1506342804","https://openalex.org/W1760551737","https://openalex.org/W1784780955","https://openalex.org/W1854214752","https://openalex.org/W1973234918","https://openalex.org/W1978030011","https://openalex.org/W1981760490","https://openalex.org/W1990223774","https://openalex.org/W1994024161","https://openalex.org/W1997219719","https://openalex.org/W2014617013","https://openalex.org/W2014730252","https://openalex.org/W2023488486","https://openalex.org/W2037933327","https://openalex.org/W2038122249","https://openalex.org/W2039118116","https://openalex.org/W2049028959","https://openalex.org/W2051381393","https://openalex.org/W2057958327","https://openalex.org/W2070232376","https://openalex.org/W2083676493","https://openalex.org/W2086254934","https://openalex.org/W2089750292","https://openalex.org/W2110684048","https://openalex.org/W2122799790","https://openalex.org/W2126124689","https://openalex.org/W2127607093","https://openalex.org/W2133299088","https://openalex.org/W2142184646","https://openalex.org/W2143131337","https://openalex.org/W2153190022","https://openalex.org/W2162432120","https://openalex.org/W2171774716","https://openalex.org/W2275703773","https://openalex.org/W2296319761","https://openalex.org/W2374439971","https://openalex.org/W2755088640","https://openalex.org/W4213135654","https://openalex.org/W4239881334","https://openalex.org/W4240572128","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2027972911","https://openalex.org/W2146343568","https://openalex.org/W2013643406","https://openalex.org/W2157978810","https://openalex.org/W2597809628","https://openalex.org/W2499279132"],"abstract_inverted_index":{"Node":[0],"proximity":[1,17,41,87,171,229],"queries":[2,42,172,230],"are":[3],"among":[4],"the":[5,69,127,141,163,194,201,209,232,254],"most":[6],"common":[7,13],"operations":[8],"on":[9,107,150],"network":[10],"databases.":[11,154],"A":[12],"measure":[14],"of":[15,38,53,61,65,71,102,111,144,166,205,214,222,253],"node":[16,86,170],"is":[18],"random":[19,103,167],"walk":[20,168],"based":[21,40,85,169,181],"proximity,":[22],"which":[23],"has":[24,76],"been":[25,77,124],"shown":[26],"to":[27,31,68,79,93,114,136,160],"be":[28],"less":[29],"susceptible":[30],"noise":[32],"and":[33,55,109,140,211,224,226],"missing":[34],"data.":[35],"Real-time":[36],"processing":[37,189,203],"random-walk":[39,84],"poses":[43],"significant":[44,74],"computational":[45,164],"challenges":[46],"for":[47,83,262],"larger":[48],"graphs":[49],"with":[50,173,183,208,220],"over":[51,193],"billions":[52,221],"nodes":[54,223],"edges,":[56,225],"since":[57],"it":[58,248],"involves":[59],"solution":[60],"large":[62,152],"linear":[63],"systems":[64],"equations.":[66],"Due":[67],"importance":[70],"this":[72],"operation,":[73],"effort":[75],"devoted":[78],"developing":[80],"efficient":[81],"methods":[82,90],"computations.":[88],"These":[89],"either":[91],"aim":[92],"speed":[94],"up":[95],"iterative":[96,131,185,215,255],"computations":[97,186],"by":[98,130],"exploiting":[99],"numerical":[100],"properties":[101],"walks,":[104],"or":[105],"rely":[106],"computation":[108,116],"storage":[110,142,212,260],"matrix":[112],"inverses":[113],"avoid":[115],"during":[117,187],"query":[118,138,188,202],"processing.":[119],"Although":[120],"both":[121],"approaches":[122,132,146],"have":[123],"well":[125],"studied,":[126],"speedup":[128],"achieved":[129],"does":[133],"not":[134],"translate":[135],"real-time":[137],"processing,":[139],"requirements":[143,261],"inversion-based":[145],"prohibit":[147],"their":[148],"use":[149],"very":[151],"graph":[153],"We":[155],"present":[156],"a":[157],"novel":[158],"approach":[159,177,199],"significantly":[161,243],"reducing":[162,259],"cost":[165],"scalable":[174],"indexing.":[175,263],"Our":[176],"combines":[178,200],"domain":[179],"graph-partitioning":[180],"indexing":[182],"fast":[184],"using":[190],"Chebyshev":[191],"polynomials":[192],"complex":[195],"elliptic":[196],"plane.":[197],"This":[198],"benefits":[204,213],"inversion":[206],"techniques":[207],"memory":[210],"approache.":[216],"Using":[217],"real-world":[218],"networks":[219],"top-":[227],"k":[228],"as":[231],"benchmark":[233],"problem,":[234],"we":[235],"show":[236],"that":[237],"our":[238],"algorithm,":[239],"I-C":[240],"hopper":[241],",":[242],"outperforms":[244],"existing":[245],"methods.":[246],"Specifically,":[247],"drastically":[249],"reduces":[250],"convergence":[251],"time":[252],"procedure,":[256],"while":[257],"also":[258]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}