{"id":"https://openalex.org/W2035057445","doi":"https://doi.org/10.1145/2618243.2618282","title":"Efficient temporal shortest path queries on evolving social graphs","display_name":"Efficient temporal shortest path queries on evolving social graphs","publication_year":2014,"publication_date":"2014-06-24","ids":{"openalex":"https://openalex.org/W2035057445","doi":"https://doi.org/10.1145/2618243.2618282","mag":"2035057445"},"language":"en","primary_location":{"id":"doi:10.1145/2618243.2618282","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2618243.2618282","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th International Conference on Scientific and Statistical Database Management","raw_type":"proceedings-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/A5028412846","display_name":"Wenyu Huo","orcid":"https://orcid.org/0009-0005-0349-0636"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Wenyu Huo","raw_affiliation_strings":["University of California, Riverside, Riverside, CA"],"affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, CA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000947547","display_name":"Vassilis J. Tsotras","orcid":"https://orcid.org/0000-0001-5462-9451"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vassilis J. Tsotras","raw_affiliation_strings":["University of California, Riverside, Riverside, CA"],"affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, CA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028412846"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":null,"apc_paid":null,"fwci":4.7106,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.95569368,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"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.9987999796867371,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.998199999332428,"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/T11478","display_name":"Caching and Content Delivery","score":0.9979000091552734,"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.7820159792900085},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7635555267333984},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6174637675285339},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5669602751731873},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5186535716056824},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.4653646945953369},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.46461737155914307},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.41665756702423096},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4070979058742523},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23715761303901672},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.20161128044128418},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09653571248054504}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7820159792900085},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7635555267333984},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6174637675285339},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5669602751731873},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5186535716056824},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4653646945953369},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.46461737155914307},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.41665756702423096},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4070979058742523},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23715761303901672},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.20161128044128418},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09653571248054504},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2618243.2618282","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2618243.2618282","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th International Conference on Scientific and Statistical Database Management","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.587.1767","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.587.1767","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucr.edu/~whuo/SSDBM14_huo.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4699999988079071}],"awards":[{"id":"https://openalex.org/G4531600625","display_name":null,"funder_award_id":"IIS-0910859, IIS-1161997","funder_id":"https://openalex.org/F4320337389","funder_display_name":"Division of Information and Intelligent Systems"}],"funders":[{"id":"https://openalex.org/F4320337389","display_name":"Division of Information and Intelligent Systems","ror":"https://ror.org/053a2cp42"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W37716794","https://openalex.org/W330407472","https://openalex.org/W1964338930","https://openalex.org/W2054736275","https://openalex.org/W2078210269","https://openalex.org/W2148831787","https://openalex.org/W2154875162","https://openalex.org/W2168148394","https://openalex.org/W2169528473","https://openalex.org/W2183424036","https://openalex.org/W2395448265","https://openalex.org/W4235968347"],"related_works":["https://openalex.org/W4285687848","https://openalex.org/W223921116","https://openalex.org/W2982088850","https://openalex.org/W3216780016","https://openalex.org/W4402599120","https://openalex.org/W78690942","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2886722595"],"abstract_inverted_index":{"Graph-like":[0],"data":[1],"appears":[2],"in":[3,15,53],"many":[4],"applications,":[5],"such":[6,98],"as":[7,99],"social":[8,38],"networks,":[9],"internet":[10],"hyperlinks,":[11],"roadmaps,":[12],"etc.":[13],"and":[14,57,127,134,141],"most":[16],"cases,":[17],"graphs":[18],"are":[19,43],"dynamic,":[20],"evolving":[21,37,110],"through":[22],"time.":[23],"In":[24],"this":[25,67],"work,":[26],"we":[27,72,93,104],"study":[28],"the":[29,54,74,109,114,132],"problem":[30],"of":[31,69,136],"efficient":[32,139],"shortest-path":[33,41,80],"query":[34,91],"evaluation":[35],"on":[36,123],"graphs.":[39],"Our":[40],"queries":[42],"\"temporal\":":[44],"they":[45],"can":[46],"refer":[47],"to":[48,78,107],"any":[49],"time-point":[50,84],"or":[51,85],"time-interval":[52],"graph's":[55],"evolution,":[56],"corresponding":[58],"valid":[59],"answers":[60],"should":[61],"be":[62],"returned.":[63],"To":[64,88],"efficiently":[65],"support":[66],"type":[68],"temporal":[70,118],"query,":[71],"extend":[73],"traditional":[75],"Dijkstra's":[76],"algorithm":[77],"compute":[79],"distance(s)":[81],"for":[82],"a":[83,86],"time-interval.":[87],"speed":[89],"up":[90],"processing,":[92],"explore":[94],"preprocessing":[95],"index":[96,115],"techniques":[97,140],"Contraction":[100],"Hierarchies":[101],"(CH).":[102],"Moreover,":[103],"examine":[105],"how":[106],"maintain":[108],"graph":[111],"along":[112],"with":[113],"by":[116],"utilizing":[117],"partition":[119],"strategies.":[120],"Experimental":[121],"evaluations":[122],"real":[124],"world":[125],"datasets":[126,130],"large":[128],"synthetic":[129],"demonstrate":[131],"feasibility":[133],"scalability":[135],"our":[137],"proposed":[138],"optimizations.":[142]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}