{"id":"https://openalex.org/W2793388925","doi":"https://doi.org/10.3233/jifs-169458","title":"ex-FTCD: A novel mapreduce model for distributed multi source shortest path problem","display_name":"ex-FTCD: A novel mapreduce model for distributed multi source shortest path problem","publication_year":2018,"publication_date":"2018-03-22","ids":{"openalex":"https://openalex.org/W2793388925","doi":"https://doi.org/10.3233/jifs-169458","mag":"2793388925"},"language":"en","primary_location":{"id":"doi:10.3233/jifs-169458","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-169458","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","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/A5048118020","display_name":"R. Gayathri","orcid":null},"institutions":[{"id":"https://openalex.org/I81556334","display_name":"Amrita Vishwa Vidyapeetham","ror":"https://ror.org/03am10p12","country_code":"IN","type":"education","lineage":["https://openalex.org/I81556334"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"R.G. Gayathri","raw_affiliation_strings":["Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Amritapuri, Tamil Nadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Amritapuri, Tamil Nadu, India","institution_ids":["https://openalex.org/I81556334"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041549614","display_name":"Jyothisha J. Nair","orcid":"https://orcid.org/0000-0002-8050-8896"},"institutions":[{"id":"https://openalex.org/I81556334","display_name":"Amrita Vishwa Vidyapeetham","ror":"https://ror.org/03am10p12","country_code":"IN","type":"education","lineage":["https://openalex.org/I81556334"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jyothisha J. Nair","raw_affiliation_strings":["Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Amritapuri, Tamil Nadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Amritapuri, Tamil Nadu, India","institution_ids":["https://openalex.org/I81556334"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048118020"],"corresponding_institution_ids":["https://openalex.org/I81556334"],"apc_list":null,"apc_paid":null,"fwci":0.9971,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.75880741,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"34","issue":"3","first_page":"1643","last_page":"1652"},"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.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8359245657920837},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8256305456161499},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7868226766586304},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6786277294158936},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.6735419034957886},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6471606492996216},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5370489954948425},{"id":"https://openalex.org/keywords/spark","display_name":"SPARK (programming language)","score":0.4588637053966522},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.43352869153022766},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4259440302848816},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.41052940487861633},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38514024019241333},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33663126826286316},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3076587915420532},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30491355061531067},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.11245131492614746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10700052976608276}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8359245657920837},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8256305456161499},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7868226766586304},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6786277294158936},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.6735419034957886},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6471606492996216},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5370489954948425},{"id":"https://openalex.org/C2781215313","wikidata":"https://www.wikidata.org/wiki/Q3493345","display_name":"SPARK (programming language)","level":2,"score":0.4588637053966522},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.43352869153022766},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4259440302848816},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.41052940487861633},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38514024019241333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33663126826286316},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3076587915420532},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30491355061531067},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.11245131492614746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10700052976608276},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/jifs-169458","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-169458","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.5899999737739563}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W947684766","https://openalex.org/W1736872950","https://openalex.org/W1969483458","https://openalex.org/W2007572995","https://openalex.org/W2019183416","https://openalex.org/W2022980325","https://openalex.org/W2034832755","https://openalex.org/W2035449679","https://openalex.org/W2040011014","https://openalex.org/W2041356704","https://openalex.org/W2048098617","https://openalex.org/W2053788000","https://openalex.org/W2085917651","https://openalex.org/W2090121768","https://openalex.org/W2097266580","https://openalex.org/W2097740541","https://openalex.org/W2150437713","https://openalex.org/W2159675211","https://openalex.org/W2168758837","https://openalex.org/W2169528473","https://openalex.org/W2173213060","https://openalex.org/W2227557434","https://openalex.org/W2261409732","https://openalex.org/W2465832610","https://openalex.org/W2513153275","https://openalex.org/W2519631390","https://openalex.org/W2522473921","https://openalex.org/W2570013196","https://openalex.org/W3122780781","https://openalex.org/W4210727445","https://openalex.org/W6726552090"],"related_works":["https://openalex.org/W4293054712","https://openalex.org/W2170980056","https://openalex.org/W4223969905","https://openalex.org/W2886722595","https://openalex.org/W2990531685","https://openalex.org/W3088868185","https://openalex.org/W2379804627","https://openalex.org/W2359532380","https://openalex.org/W2363342665","https://openalex.org/W78690942"],"abstract_inverted_index":{"Computing":[0],"the":[1,27,31,37,56,67,74,77,88,95,106,109,121,129,135,150],"all":[2,68],"pair":[3,69],"shortest":[4,70,84],"paths":[5],"in":[6,80,115],"a":[7,10,15],"graph":[8],"is":[9,101],"widely":[11],"used":[12,21],"solution,":[13],"but":[14,33],"time-consuming":[16],"process":[17,96],"too.":[18],"The":[19,146],"popularly":[20],"conventional":[22,122],"algorithms":[23],"rely":[24],"solely":[25],"on":[26,117,131],"computing":[28,98],"capability":[29,138],"of":[30,39,76,152],"CPU,":[32],"fail":[34],"to":[35],"meet":[36],"demand":[38],"real-time":[40],"processing":[41],"and":[42,87,100,112],"mostly":[43],"do":[44],"not":[45],"scale":[46],"well":[47],"for":[48,65,108,144,157],"larger":[49],"data.":[50],"In":[51],"this":[52],"paper,":[53],"we":[54],"propose":[55],"ex-FTCD":[57],"(extending":[58],"Full":[59],"Transitive":[60],"Closure":[61],"with":[62],"Dijkstra\u2019s)":[63],"algorithm":[64,107],"finding":[66],"path":[71,85],"by":[72],"merging":[73],"features":[75],"greedy":[78],"technique":[79],"Dijkstra\u2019s":[81],"single":[82],"source":[83],"method":[86],"transitive":[89],"closure":[90],"property.":[91],"Experiments":[92],"show":[93,148],"that":[94,119,133,149],"improves":[97],"speed":[99],"more":[102],"scalable.":[103],"We":[104],"re-designed":[105],"parallel":[110],"execution":[111],"implemented":[113],"it":[114],"mapreduce":[116],"Hadoop":[118],"supports":[120,134],"map/reduce":[123],"jobs.":[124],"This":[125],"work":[126],"also":[127],"includes":[128],"implementation":[130],"Spark":[132],"in-memory":[136],"computational":[137],"which":[139],"uses":[140],"Random":[141],"Access":[142],"Memory":[143],"computations.":[145],"experiments":[147],"numbers":[151],"iterations":[153],"are":[154],"relatively":[155],"small":[156],"even":[158],"large":[159],"networks.":[160]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}