{"id":"https://openalex.org/W4212967841","doi":"https://doi.org/10.1145/3487351.3489442","title":"Fast indexing algorithm for efficient <i>k</i> NN queries on complex networks","display_name":"Fast indexing algorithm for efficient <i>k</i> NN queries on complex networks","publication_year":2021,"publication_date":"2021-11-08","ids":{"openalex":"https://openalex.org/W4212967841","doi":"https://doi.org/10.1145/3487351.3489442"},"language":"en","primary_location":{"id":"doi:10.1145/3487351.3489442","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3487351.3489442","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3487351.3489442","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3487351.3489442","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067136197","display_name":"Suomi Kobayashi","orcid":null},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Suomi Kobayashi","raw_affiliation_strings":["University of Tsukuba, Tsukuba, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Tsukuba, Tsukuba, Japan","institution_ids":["https://openalex.org/I146399215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045284554","display_name":"Shohei Matsugu","orcid":null},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shohei Matsugu","raw_affiliation_strings":["University of Tsukuba, Tsukuba, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Tsukuba, Tsukuba, Japan","institution_ids":["https://openalex.org/I146399215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041427242","display_name":"Hiroaki Shiokawa","orcid":"https://orcid.org/0000-0002-8530-2651"},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroaki Shiokawa","raw_affiliation_strings":["University of Tsukuba, Tsukuba, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Tsukuba, Tsukuba, Japan","institution_ids":["https://openalex.org/I146399215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I146399215"],"apc_list":null,"apc_paid":null,"fwci":0.7239,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73583663,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"343","last_page":"347"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/search-engine-indexing","display_name":"Search engine indexing","score":0.8656812906265259},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8082839250564575},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5514088273048401},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5186266303062439},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5069106221199036},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4395500123500824},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.413927286863327},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40534090995788574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38244864344596863},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19667774438858032}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.8656812906265259},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8082839250564575},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5514088273048401},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5186266303062439},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5069106221199036},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4395500123500824},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.413927286863327},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40534090995788574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38244864344596863},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19667774438858032},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3487351.3489442","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3487351.3489442","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3487351.3489442","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3487351.3489442","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3487351.3489442","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3487351.3489442","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1948079895","display_name":"Real Time Graph Query Processing on Massively Parallel Environment","funder_award_id":"18K18057","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G4494870512","display_name":null,"funder_award_id":"JPMJPR2033","funder_id":"https://openalex.org/F4320338111","funder_display_name":"Precursory Research for Embryonic Science and Technology"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"},{"id":"https://openalex.org/F4320338111","display_name":"Precursory Research for Embryonic Science and Technology","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4212967841.pdf","grobid_xml":"https://content.openalex.org/works/W4212967841.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W206953779","https://openalex.org/W2153752762","https://openalex.org/W2160080073","https://openalex.org/W2168891622","https://openalex.org/W2243560673","https://openalex.org/W2602433152","https://openalex.org/W2755088640","https://openalex.org/W2945041458","https://openalex.org/W3174186474","https://openalex.org/W6763497363","https://openalex.org/W6785375975","https://openalex.org/W6785873451","https://openalex.org/W6802189035"],"related_works":["https://openalex.org/W3024364549","https://openalex.org/W4206019083","https://openalex.org/W2048865712","https://openalex.org/W1976265003","https://openalex.org/W2370378377","https://openalex.org/W4237510188","https://openalex.org/W2130160813","https://openalex.org/W2054476758","https://openalex.org/W2053683714","https://openalex.org/W2127316189"],"abstract_inverted_index":{"k":[0],"nearest":[1],"neighbor":[2],"(kNN)":[3],"query":[4,21,83,129],"is":[5],"an":[6],"essential":[7],"graph":[8,37,76],"data":[9,15],"management":[10],"tool":[11],"to":[12,18,29,49,58,119],"find":[13],"relevant":[14],"entities":[16],"suited":[17],"a":[19,31,74,80],"user-specified":[20],"node.":[22],"Graph":[23],"indexing":[24,38,77,123],"methods":[25,39],"have":[26],"the":[27,36,43,63,89,101,131],"potential":[28],"achieve":[30],"quick":[32],"kNN":[33,60,82,128],"search":[34],"response,":[35],"are":[40,66],"one":[41],"of":[42,97,104],"promising":[44],"approaches.":[45],"However,":[46],"they":[47],"struggle":[48],"handle":[50],"large-scale":[51,64],"complex":[52,105],"networks":[53,65],"since":[54],"constructing":[55],"indexes":[56,98],"and":[57,124],"querying":[59],"nodes":[61],"in":[62],"computationally":[67],"expensive.":[68],"In":[69],"this":[70],"paper,":[71],"we":[72],"propose":[73],"novel":[75],"algorithm":[78,93,116],"for":[79],"fast":[81],"on":[84,100,110],"large":[85],"networks.":[86,106],"To":[87],"overcome":[88],"aforementioned":[90],"limitations,":[91],"our":[92,115],"generates":[94],"two":[95],"types":[96],"based":[99],"topological":[102],"properties":[103],"Our":[107],"extensive":[108],"experiments":[109],"real-world":[111],"graphs":[112],"clarify":[113],"that":[114],"achieves":[117],"up":[118],"18,074":[120],"times":[121,126],"faster":[122,127],"146":[125],"than":[130],"state-of-the-art":[132],"methods.":[133]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}