{"id":"https://openalex.org/W4385653222","doi":"https://doi.org/10.14778/3603581.3603594","title":"MITra: A Framework for Multi-Instance Graph Traversal","display_name":"MITra: A Framework for Multi-Instance Graph Traversal","publication_year":2023,"publication_date":"2023-06-01","ids":{"openalex":"https://openalex.org/W4385653222","doi":"https://doi.org/10.14778/3603581.3603594"},"language":"en","primary_location":{"id":"doi:10.14778/3603581.3603594","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3603581.3603594","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/files/370689075/MITra_LI_DOA23052023_AFV_CC_BY.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100648222","display_name":"Jia Li","orcid":"https://orcid.org/0000-0002-2956-2846"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jia Li","raw_affiliation_strings":["Edinburgh Research Centre, Huawei"],"affiliations":[{"raw_affiliation_string":"Edinburgh Research Centre, Huawei","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068554771","display_name":"Wenyue Zhao","orcid":"https://orcid.org/0009-0003-2941-2658"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Wenyue Zhao","raw_affiliation_strings":["University of Edinburgh"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021697915","display_name":"Nikos Ntarmos","orcid":"https://orcid.org/0000-0001-8676-0948"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikos Ntarmos","raw_affiliation_strings":["Edinburgh Research Centre, Huawei"],"affiliations":[{"raw_affiliation_string":"Edinburgh Research Centre, Huawei","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101426208","display_name":"Yang Cao","orcid":"https://orcid.org/0000-0001-7984-3219"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Yang Cao","raw_affiliation_strings":["University of Edinburgh"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087078518","display_name":"Peter Buneman","orcid":"https://orcid.org/0009-0004-9056-8587"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Peter Buneman","raw_affiliation_strings":["University of Edinburgh"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5100648222"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.597,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.68885728,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":"16","issue":"10","first_page":"2551","last_page":"2564"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9991999864578247,"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.9991999864578247,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9991000294685364,"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.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.8825986385345459},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.882442831993103},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.7785056233406067},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7712797522544861},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.602921724319458},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.5770859718322754},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5654466152191162},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5529940128326416},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5007193088531494},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4868130385875702},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4296380579471588},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37938761711120605},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.22260820865631104}],"concepts":[{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.8825986385345459},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.882442831993103},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.7785056233406067},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7712797522544861},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.602921724319458},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.5770859718322754},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5654466152191162},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5529940128326416},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5007193088531494},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4868130385875702},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4296380579471588},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37938761711120605},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.22260820865631104},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.14778/3603581.3603594","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3603581.3603594","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/f71ee3df-4cea-4ef7-852c-6584758f97fe","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/f71ee3df-4cea-4ef7-852c-6584758f97fe","pdf_url":"https://www.research.ed.ac.uk/files/370689075/MITra_LI_DOA23052023_AFV_CC_BY.pdf","source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li, J, Zhao, W, Ntarmos, N, Cao, Y & Buneman, P 2023, 'MITra: A Framework for Multi-Instance Graph Traversal', Proceedings of the VLDB Endowment, vol. 16, no. 10, pp. 2551-2564. https://doi.org/10.14778/3603581.3603594","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:publications/f71ee3df-4cea-4ef7-852c-6584758f97fe","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/f71ee3df-4cea-4ef7-852c-6584758f97fe","pdf_url":"https://www.research.ed.ac.uk/files/370689075/MITra_LI_DOA23052023_AFV_CC_BY.pdf","source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li, J, Zhao, W, Ntarmos, N, Cao, Y & Buneman, P 2023, 'MITra: A Framework for Multi-Instance Graph Traversal', Proceedings of the VLDB Endowment, vol. 16, no. 10, pp. 2551-2564. https://doi.org/10.14778/3603581.3603594","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2864483227","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320320005","funder_display_name":"Royal Academy of Engineering"},{"id":"https://openalex.org/G8945877392","display_name":null,"funder_award_id":"RF\\201920\\19\\319","funder_id":"https://openalex.org/F4320320005","funder_display_name":"Royal Academy of Engineering"}],"funders":[{"id":"https://openalex.org/F4320320005","display_name":"Royal Academy of Engineering","ror":"https://ror.org/0526snb40"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4385653222.pdf"},"referenced_works_count":49,"referenced_works":["https://openalex.org/W41893858","https://openalex.org/W78077100","https://openalex.org/W217817341","https://openalex.org/W1981202432","https://openalex.org/W2005945380","https://openalex.org/W2026102093","https://openalex.org/W2053076698","https://openalex.org/W2057112598","https://openalex.org/W2058978608","https://openalex.org/W2069153192","https://openalex.org/W2095223744","https://openalex.org/W2096544401","https://openalex.org/W2112765151","https://openalex.org/W2132375650","https://openalex.org/W2138621811","https://openalex.org/W2151772234","https://openalex.org/W2170616854","https://openalex.org/W2170628445","https://openalex.org/W2259576664","https://openalex.org/W2266577329","https://openalex.org/W2394534308","https://openalex.org/W2500377098","https://openalex.org/W2524623326","https://openalex.org/W2578829886","https://openalex.org/W2604270491","https://openalex.org/W2614759802","https://openalex.org/W2738095401","https://openalex.org/W2768307041","https://openalex.org/W2885251087","https://openalex.org/W2981181577","https://openalex.org/W3007641860","https://openalex.org/W3126890733","https://openalex.org/W3158279442","https://openalex.org/W3199050025","https://openalex.org/W3199378187","https://openalex.org/W3209244307","https://openalex.org/W4210390422","https://openalex.org/W4233982390","https://openalex.org/W4246219036","https://openalex.org/W4372267129","https://openalex.org/W6601648906","https://openalex.org/W6628673860","https://openalex.org/W6632352731","https://openalex.org/W6638233953","https://openalex.org/W6639055396","https://openalex.org/W6756222080","https://openalex.org/W6997193469","https://openalex.org/W7029321148","https://openalex.org/W7056850826"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4230405657","https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W3183956626","https://openalex.org/W2152421698","https://openalex.org/W2366394613"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"MITra,":[3],"a":[4,19,25,42],"framework":[5],"for":[6,135],"composing":[7],"multi-instance":[8,28,65,95],"graph":[9,137],"algorithms":[10,67,96],"that":[11,30,45,91,119],"traverse":[12],"from":[13,68,76,87],"multiple":[14],"source":[15],"vertices":[16],"simultaneously":[17],"over":[18],"single":[20],"thread.":[21],"Underlying":[22],"MITra":[23,40,92,120],"is":[24,121,140],"model":[26,44],"of":[27,114,126],"traversal":[29,33,66],"uniformly":[31],"captures":[32],"sharing":[34,81],"across":[35,83],"instances.":[36],"Based":[37],"on":[38,122,132],"this,":[39],"provides":[41],"programming":[43],"allows":[46],"users":[47],"to":[48,111,142],"express":[49],"traversals":[50],"by":[51],"declaring":[52],"vertex":[53,70],"ranks":[54,71],"and":[55,72,85,139],"specify":[56],"computation":[57,82],"logic":[58],"via":[59],"an":[60,124],"edge":[61,73],"function.":[62],"It":[63],"synthesizes":[64],"declared":[69],"functions":[74],"adopted":[75],"classic":[77],"single-instance":[78],"algorithms,":[79,138],"automatically":[80],"instances":[84],"benefiting":[86],"SIMD.":[88],"We":[89],"show":[90],"can":[93],"generate":[94],"provably":[97],"better":[98],"than":[99,106,129],"existing":[100,133],"ones,":[101],"while":[102],"being":[103],"more":[104],"expressive":[105],"traditional":[107],"frameworks.":[108],"In":[109],"addition":[110],"the":[112,143],"ease":[113],"programming,":[115],"we":[116],"experimentally":[117],"verify":[118],"average":[123],"order":[125],"magnitude":[127],"faster":[128],"approaches":[130],"based":[131],"frameworks":[134],"common":[136],"comparable":[141],"state-of-the-art":[144],"highly":[145],"optimized":[146],"one-off":[147],"algorithms.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}