{"id":"https://openalex.org/W2028008873","doi":"https://doi.org/10.1109/bigdata.congress.2013.34","title":"SPTI: Efficient Answering the Shortest Path Query on Large Graphs","display_name":"SPTI: Efficient Answering the Shortest Path Query on Large Graphs","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2028008873","doi":"https://doi.org/10.1109/bigdata.congress.2013.34","mag":"2028008873"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata.congress.2013.34","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.congress.2013.34","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Congress on Big Data","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100386934","display_name":"Yifei Zhang","orcid":"https://orcid.org/0000-0002-4646-7699"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yifei Zhang","raw_affiliation_strings":["College of Information Science and Engineering, Northeastern University, Shenyang, China","[College of Information Science & Engineering, Northeastern University, Shenyang, CHINA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Northeastern University, Shenyang, China","institution_ids":["https://openalex.org/I9224756"]},{"raw_affiliation_string":"[College of Information Science & Engineering, Northeastern University, Shenyang, CHINA]","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054991337","display_name":"Guoren Wang","orcid":"https://orcid.org/0000-0002-0181-8379"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guoren Wang","raw_affiliation_strings":["College of Information Science and Engineering, Northeastern University, Shenyang, China","[College of Information Science & Engineering, Northeastern University, Shenyang, CHINA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Northeastern University, Shenyang, China","institution_ids":["https://openalex.org/I9224756"]},{"raw_affiliation_string":"[College of Information Science & Engineering, Northeastern University, Shenyang, CHINA]","institution_ids":["https://openalex.org/I9224756"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I9224756"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":null,"first_page":"195","last_page":"202"},"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9966999888420105,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9958999752998352,"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.7403472661972046},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.7290456295013428},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6313768029212952},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5694294571876526},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.48749542236328125},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46270421147346497},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.41422784328460693},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37504392862319946},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.19458219408988953},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.12823879718780518},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.07998695969581604}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7403472661972046},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7290456295013428},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6313768029212952},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5694294571876526},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.48749542236328125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46270421147346497},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.41422784328460693},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37504392862319946},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.19458219408988953},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.12823879718780518},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.07998695969581604}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata.congress.2013.34","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.congress.2013.34","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Congress on Big Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.800000011920929,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W950821216","https://openalex.org/W1493214567","https://openalex.org/W1502577746","https://openalex.org/W1533934163","https://openalex.org/W1994924587","https://openalex.org/W2006097619","https://openalex.org/W2015370254","https://openalex.org/W2021325937","https://openalex.org/W2086729610","https://openalex.org/W2102563702","https://openalex.org/W2120063789","https://openalex.org/W2141938776","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W6629442825","https://openalex.org/W6629989097","https://openalex.org/W6675162021"],"related_works":["https://openalex.org/W3032870653","https://openalex.org/W3149063625","https://openalex.org/W2357644463","https://openalex.org/W1996697202","https://openalex.org/W94062305","https://openalex.org/W4287775348","https://openalex.org/W2237480599","https://openalex.org/W4388031360","https://openalex.org/W2018146256","https://openalex.org/W2009448154"],"abstract_inverted_index":{"The":[0],"shortest":[1,82],"path":[2,83],"distance":[3,84],"computing":[4],"between":[5],"any":[6],"two":[7],"vertices":[8,57,93],"in":[9,23,150],"large":[10,50],"scale":[11,51],"graphs":[12,52,137],"is":[13,42],"an":[14,74],"essential":[15],"problem,":[16],"e.g.,":[17],"social":[18],"network":[19],"analysis,":[20],"route":[21],"planning":[22],"road":[24],"map,":[25],"and":[26,58,76,114,142,158],"has":[27],"been":[28],"studied":[29],"over":[30,147],"the":[31,37,40,81,95,111,132],"past":[32],"few":[33],"decades.":[34],"To":[35,66],"answer":[36],"query":[38,77,159],"efficiently,":[39],"index":[41,115,153,156],"widely":[43],"used.":[44],"However,":[45],"when":[46],"it":[47],"comes":[48],"to":[49,98],"composed":[53],"of":[54,56,64,92,102,104,140,152],"millions":[55,139],"edges,":[59],"they":[60],"suffer":[61],"from":[62,94],"drawbacks":[63],"scalability.":[65],"solve":[67],"these":[68],"problems,":[69],"we":[70],"put":[71],"forward":[72],"SPTI,":[73],"indexing":[75],"processing":[78],"framework":[79],"for":[80],"computing.":[85],"We":[86],"only":[87,108],"select":[88],"a":[89],"small":[90],"part":[91],"original":[96],"graph":[97],"construct":[99],"index,":[100],"instead":[101],"all":[103],"them.":[105],"It":[106],"not":[107],"can":[109,120,134],"reduce":[110],"construction":[112,154],"time":[113],"size":[116,157],"dramatically,":[117],"but":[118],"also":[119],"help":[121],"speed":[122],"up":[123],"the-state-of-the-art":[124],"approaches":[125,149],"significantly.":[126],"Our":[127],"experimental":[128],"results":[129],"demonstrate":[130],"that":[131],"SPTI":[133],"perform":[135],"on":[136],"with":[138],"vertices/edges":[141],"offers":[143],"apparent":[144],"performance":[145],"improvement":[146],"existing":[148],"term":[151],"time,":[155],"time.":[160]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}