{"id":"https://openalex.org/W2571682840","doi":"https://doi.org/10.1007/s41019-016-0023-z","title":"Distance-Aware Selective Online Query Processing Over Large Distributed Graphs","display_name":"Distance-Aware Selective Online Query Processing Over Large Distributed Graphs","publication_year":2017,"publication_date":"2017-01-18","ids":{"openalex":"https://openalex.org/W2571682840","doi":"https://doi.org/10.1007/s41019-016-0023-z","mag":"2571682840"},"language":"en","primary_location":{"id":"doi:10.1007/s41019-016-0023-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41019-016-0023-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s41019-016-0023-z.pdf","source":{"id":"https://openalex.org/S2486411021","display_name":"Data Science and Engineering","issn_l":"2364-1185","issn":["2364-1185","2364-1541"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Science and Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007/s41019-016-0023-z.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001241928","display_name":"Xiaofei Zhang","orcid":"https://orcid.org/0000-0003-2633-9929"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Xiaofei Zhang","raw_affiliation_strings":["University of Waterloo, Waterloo, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100333516","display_name":"Lei Chen","orcid":"https://orcid.org/0000-0002-8257-5806"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]},{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Lei Chen","raw_affiliation_strings":["Hong Kong University of Science & Technology, Clear Water Bay, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hong Kong University of Science & Technology, Clear Water Bay, Hong Kong","institution_ids":["https://openalex.org/I200769079","https://openalex.org/I889458895"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001241928"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":1290,"currency":"USD","value_usd":1290},"apc_paid":{"value":1290,"currency":"USD","value_usd":1290},"fwci":0.8535,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.78636287,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"2","issue":"1","first_page":"2","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"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/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9980000257492065,"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/computer-science","display_name":"Computer science","score":0.8749651908874512},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.6081880331039429},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6028262972831726},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.49073731899261475},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4230455160140991},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3930525779724121},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.14747673273086548}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8749651908874512},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6081880331039429},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6028262972831726},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.49073731899261475},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4230455160140991},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3930525779724121},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.14747673273086548},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s41019-016-0023-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41019-016-0023-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s41019-016-0023-z.pdf","source":{"id":"https://openalex.org/S2486411021","display_name":"Data Science and Engineering","issn_l":"2364-1185","issn":["2364-1185","2364-1541"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Science and Engineering","raw_type":"journal-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-97332","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-97332","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:repository.ust.hk:1783.1-97332","is_oa":false,"landing_page_url":"http://www.scopus.com/record/display.url?eid=2-s2.0-85031908257&origin=inward","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1007/s41019-016-0023-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41019-016-0023-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s41019-016-0023-z.pdf","source":{"id":"https://openalex.org/S2486411021","display_name":"Data Science and Engineering","issn_l":"2364-1185","issn":["2364-1185","2364-1541"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Science and Engineering","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","display_name":"No poverty","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2571682840.pdf","grobid_xml":"https://content.openalex.org/works/W2571682840.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W45098741","https://openalex.org/W73304046","https://openalex.org/W217817341","https://openalex.org/W1512819151","https://openalex.org/W1527104720","https://openalex.org/W1883226873","https://openalex.org/W1914199066","https://openalex.org/W1964305977","https://openalex.org/W1975283025","https://openalex.org/W1994924587","https://openalex.org/W2034501275","https://openalex.org/W2046526098","https://openalex.org/W2054476043","https://openalex.org/W2070232376","https://openalex.org/W2072485026","https://openalex.org/W2076515192","https://openalex.org/W2087811943","https://openalex.org/W2101196063","https://openalex.org/W2111607365","https://openalex.org/W2121041488","https://openalex.org/W2126021606","https://openalex.org/W2133156458","https://openalex.org/W2147393894","https://openalex.org/W2151187166","https://openalex.org/W2151954369","https://openalex.org/W2153319198","https://openalex.org/W2156454290","https://openalex.org/W2160459668","https://openalex.org/W2164041305","https://openalex.org/W2169140571","https://openalex.org/W2170261811","https://openalex.org/W2170616854","https://openalex.org/W2172107427","https://openalex.org/W2214884049","https://openalex.org/W2229053133","https://openalex.org/W2259576664","https://openalex.org/W2270949707","https://openalex.org/W2764587448","https://openalex.org/W2951113132"],"related_works":["https://openalex.org/W1556451512","https://openalex.org/W1555349535","https://openalex.org/W4234091740","https://openalex.org/W4213350282","https://openalex.org/W2230171082","https://openalex.org/W2583128298","https://openalex.org/W2389214306","https://openalex.org/W2369125128","https://openalex.org/W2022275305","https://openalex.org/W2571250724"],"abstract_inverted_index":{"Performing":[0],"online":[1,85,112],"selective":[2,86],"queries":[3,17,88],"against":[4],"graphs":[5,49],"is":[6,31,105],"a":[7,29,51,108],"challenging":[8],"problem":[9],"due":[10],"to":[11,20,34,106,117,134],"the":[12,38,67,73,91,129,154],"unbounded":[13],"nature":[14],"of":[15,69,72,137,157],"graph":[16,30,87,120,149],"which":[18,96,146],"leads":[19],"poor":[21],"computation":[22],"locality.":[23],"It":[24],"becomes":[25],"even":[26],"difficult":[27],"when":[28],"too":[32],"large":[33,48],"be":[35,132],"fit":[36],"in":[37,50,100],"memory.":[39],"Although":[40],"there":[41],"have":[42],"been":[43],"emerging":[44],"efforts":[45],"on":[46,90],"managing":[47],"distributed":[52],"and":[53,59,116,142,152],"parallel":[54],"setting,":[55],"e.g.,":[56],"Pregel,":[57],"HaLoop":[58],"etc,":[60],"these":[61],"computing":[62],"frameworks":[63],"are":[64,147],"designed":[65],"from":[66],"perspective":[68],"scalability":[70],"instead":[71],"query":[74,114],"efficiency.":[75],"In":[76],"this":[77],"work,":[78],"we":[79],"present":[80],"our":[81],"solution":[82,130],"methodology":[83],"for":[84,111],"based":[89],"shortest":[92],"path":[93],"distance":[94,140],"semantic,":[95],"finds":[97],"various":[98],"applications":[99],"practice.":[101],"The":[102],"essential":[103],"intuition":[104],"build":[107],"distance-aware":[109],"index":[110],"distance-based":[113,148],"processing":[115],"eliminate":[118],"redundant":[119],"traversal":[121],"as":[122,124],"much":[123],"possible.":[125],"We":[126],"discuss":[127],"how":[128],"can":[131],"applied":[133],"two":[135],"types":[136],"research":[138],"problems,":[139],"join":[141],"vertex":[143],"set":[144],"bonding,":[145],"pattern":[150],"discovery":[151],"finding":[153],"structure-wise":[155],"bonding":[156],"vertices,":[158],"respectively.":[159]},"counts_by_year":[{"year":2023,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}