{"id":"https://openalex.org/W3031338162","doi":"https://doi.org/10.1145/3318464.3380566","title":"Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees","display_name":"Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees","publication_year":2020,"publication_date":"2020-05-29","ids":{"openalex":"https://openalex.org/W3031338162","doi":"https://doi.org/10.1145/3318464.3380566","mag":"3031338162"},"language":"en","primary_location":{"id":"doi:10.1145/3318464.3380566","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3318464.3380566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","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/A5079421220","display_name":"Tashin Reza","orcid":null},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Tashin Reza","raw_affiliation_strings":["University of British Columbia, Vancouver, BC, Canada"],"affiliations":[{"raw_affiliation_string":"University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088755273","display_name":"Matei Ripeanu","orcid":"https://orcid.org/0000-0001-9839-3866"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Matei Ripeanu","raw_affiliation_strings":["University of British Columbia, Vancouver, BC, Canada"],"affiliations":[{"raw_affiliation_string":"University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089134354","display_name":"Geoffrey Sanders","orcid":"https://orcid.org/0000-0001-9145-1226"},"institutions":[{"id":"https://openalex.org/I1282311441","display_name":"Lawrence Livermore National Laboratory","ror":"https://ror.org/041nk4h53","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282311441","https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210138311"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Geoffrey Sanders","raw_affiliation_strings":["Lawrence Livermore National Laboratory, Livermore, CA, USA"],"affiliations":[{"raw_affiliation_string":"Lawrence Livermore National Laboratory, Livermore, CA, USA","institution_ids":["https://openalex.org/I1282311441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046256174","display_name":"Roger Pearce","orcid":"https://orcid.org/0009-0000-6449-6568"},"institutions":[{"id":"https://openalex.org/I1282311441","display_name":"Lawrence Livermore National Laboratory","ror":"https://ror.org/041nk4h53","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282311441","https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210138311"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roger Pearce","raw_affiliation_strings":["Lawrence Livermore National Laboratory, Livermore, CA, USA"],"affiliations":[{"raw_affiliation_string":"Lawrence Livermore National Laboratory, Livermore, CA, USA","institution_ids":["https://openalex.org/I1282311441"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5079421220"],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":null,"apc_paid":null,"fwci":0.5862,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.68416011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1115","last_page":"1131"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"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":1.0,"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.9990000128746033,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7633812427520752},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6233021020889282},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.49136629700660706},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4902408719062805},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4600697457790375},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.45142996311187744},{"id":"https://openalex.org/keywords/pipeline","display_name":"Pipeline (software)","score":0.44763267040252686},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4383493661880493},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41542771458625793},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3895200192928314},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33795297145843506},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1359405517578125},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.1052837073802948}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7633812427520752},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6233021020889282},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.49136629700660706},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4902408719062805},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4600697457790375},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.45142996311187744},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.44763267040252686},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4383493661880493},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41542771458625793},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3895200192928314},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33795297145843506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1359405517578125},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1052837073802948},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3318464.3380566","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3318464.3380566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":60,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W631140850","https://openalex.org/W1448681276","https://openalex.org/W1482680420","https://openalex.org/W1605556478","https://openalex.org/W1794858913","https://openalex.org/W1975844474","https://openalex.org/W1990600049","https://openalex.org/W1996229963","https://openalex.org/W2016057533","https://openalex.org/W2027420911","https://openalex.org/W2039444222","https://openalex.org/W2042639302","https://openalex.org/W2048653843","https://openalex.org/W2053841470","https://openalex.org/W2068612205","https://openalex.org/W2070491228","https://openalex.org/W2083235381","https://openalex.org/W2085494605","https://openalex.org/W2094308804","https://openalex.org/W2098817244","https://openalex.org/W2102039892","https://openalex.org/W2109294083","https://openalex.org/W2110814195","https://openalex.org/W2110942501","https://openalex.org/W2112558645","https://openalex.org/W2118893477","https://openalex.org/W2119995149","https://openalex.org/W2120593471","https://openalex.org/W2122255072","https://openalex.org/W2122929441","https://openalex.org/W2123916114","https://openalex.org/W2123966888","https://openalex.org/W2126359798","https://openalex.org/W2130904350","https://openalex.org/W2135764373","https://openalex.org/W2142965177","https://openalex.org/W2147094350","https://openalex.org/W2147220268","https://openalex.org/W2147405597","https://openalex.org/W2148268260","https://openalex.org/W2167429959","https://openalex.org/W2170607286","https://openalex.org/W2170616854","https://openalex.org/W2340222647","https://openalex.org/W2470861207","https://openalex.org/W2519887557","https://openalex.org/W2603734366","https://openalex.org/W2613579336","https://openalex.org/W2621740759","https://openalex.org/W2744353700","https://openalex.org/W2899106831","https://openalex.org/W2899432611","https://openalex.org/W2906943923","https://openalex.org/W2949484202","https://openalex.org/W2962756421","https://openalex.org/W2962819988","https://openalex.org/W2963747422","https://openalex.org/W3102741717","https://openalex.org/W3104097132"],"related_works":["https://openalex.org/W3044917232","https://openalex.org/W1498160656","https://openalex.org/W2119149496","https://openalex.org/W2055693471","https://openalex.org/W4295101776","https://openalex.org/W2139858675","https://openalex.org/W2952580779","https://openalex.org/W1537327044","https://openalex.org/W123129858","https://openalex.org/W4241588278"],"abstract_inverted_index":{"There":[0],"are":[1],"multiple":[2],"situations":[3],"where":[4],"supporting":[5],"approximation":[6,38],"in":[7],"graph":[8,53,71],"pattern":[9],"matching":[10,63,68],"tasks":[11],"is":[12,110],"highly":[13,112],"desirable:":[14],"(i)":[15,111],"the":[16,33,75,102,189,192],"data":[17,135],"acquisition":[18],"process":[19],"can":[20,39],"be":[21,40],"noisy;":[22],"(ii)":[23,114],"a":[24,57,89,94,131,170],"user":[25],"may":[26],"only":[27],"have":[28],"an":[29,143],"imprecise":[30],"idea":[31],"of":[32,88,133,177,194],"search":[34],"query;":[35],"and":[36,118,124,128,149,158,166,201],"(iii)":[37,120],"used":[41,182],"for":[42,61,82,183],"high":[43],"volume":[44],"vertex":[45],"labeling":[46],"when":[47,167,197],"extracting":[48],"machine":[49],"learning":[50],"features":[51],"from":[52],"data.":[54],"We":[55,73,92,138],"present":[56],"new":[58],"algorithmic":[59],"pipeline":[60],"approximate":[62],"that":[64,145],"combines":[65],"edit-distance":[66,86],"based":[67],"with":[69,188],"systematic":[70],"pruning.":[72],"formalize":[74],"problem":[76],"as":[77],"identifying":[78],"all":[79],"exact":[80],"matches":[81],"up":[83],"to":[84],"k":[85],"subgraphs":[87],"user-supplied":[90],"template.":[91],"design":[93,103],"solution":[95,109,196],"which":[96],"exploits":[97],"unique":[98],"optimization":[99],"opportunities":[100],"within":[101],"space,":[104],"not":[105],"explored":[106],"previously.":[107],"Our":[108],"scalable,":[113],"supports":[115,130],"arbitrary":[116],"patterns":[117],"edit-distance,":[119],"offers":[121,146],"100%":[122,125],"precision":[123],"recall":[126],"guarantees,":[127],"(vi)":[129],"set":[132],"popular":[134],"analysis":[136],"scenarios.":[137],"demonstrate":[139],"its":[140],"advantages":[141,193],"through":[142],"implementation":[144],"good":[147],"strong":[148],"weak":[150],"scaling":[151],"on":[152,169],"massive":[153,171,199],"real-world":[154],"(257":[155],"billion":[156],"edges)":[157,162],"synthetic":[159],"(1.1":[160],"trillion":[161],"labeled":[163],"graphs,":[164],"respectively,":[165],"operating":[168],"cluster":[172],"(256":[173],"nodes/9,216":[174],"cores),":[175],"orders":[176],"magnitude":[178],"larger":[179],"than":[180],"previously":[181],"similar":[184],"problems.":[185],"Empirical":[186],"comparison":[187],"state-of-the-art":[190],"highlights":[191],"our":[195],"handling":[198],"graphs":[200],"complex":[202],"patterns.":[203]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}