{"id":"https://openalex.org/W3166986506","doi":"https://doi.org/10.1145/3469379.3469381","title":"A Deeper Dive into Pattern-Aware Subgraph Exploration with PEREGRINE","display_name":"A Deeper Dive into Pattern-Aware Subgraph Exploration with PEREGRINE","publication_year":2021,"publication_date":"2021-06-02","ids":{"openalex":"https://openalex.org/W3166986506","doi":"https://doi.org/10.1145/3469379.3469381","mag":"3166986506"},"language":"en","primary_location":{"id":"doi:10.1145/3469379.3469381","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3469379.3469381","pdf_url":null,"source":{"id":"https://openalex.org/S50071195","display_name":"ACM SIGOPS Operating Systems Review","issn_l":"0163-5980","issn":["0163-5980","1943-586X"],"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":"ACM SIGOPS Operating Systems Review","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/A5050726295","display_name":"Kasra Jamshidi","orcid":"https://orcid.org/0000-0003-4358-7078"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kasra Jamshidi","raw_affiliation_strings":["Simon Fraser University, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Simon Fraser University, BC, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054794473","display_name":"Keval Vora","orcid":"https://orcid.org/0000-0002-5462-5116"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Keval Vora","raw_affiliation_strings":["Simon Fraser University, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Simon Fraser University, BC, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5822,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.6787955,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"55","issue":"1","first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.995199978351593,"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.8531951308250427},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6988075971603394},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6083214282989502},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.5912050008773804},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5143643617630005},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5134516954421997},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.44369739294052124},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4414665400981903},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.4296967089176178},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3704644739627838},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2315482199192047},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22109097242355347},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16432428359985352},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.10047149658203125}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8531951308250427},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6988075971603394},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6083214282989502},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.5912050008773804},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5143643617630005},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5134516954421997},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.44369739294052124},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4414665400981903},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.4296967089176178},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3704644739627838},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2315482199192047},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22109097242355347},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16432428359985352},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.10047149658203125},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3469379.3469381","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3469379.3469381","pdf_url":null,"source":{"id":"https://openalex.org/S50071195","display_name":"ACM SIGOPS Operating Systems Review","issn_l":"0163-5980","issn":["0163-5980","1943-586X"],"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":"ACM SIGOPS Operating Systems Review","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W1448681276","https://openalex.org/W1510837191","https://openalex.org/W1582397847","https://openalex.org/W1969970763","https://openalex.org/W1974939910","https://openalex.org/W1989568113","https://openalex.org/W2000041758","https://openalex.org/W2034102265","https://openalex.org/W2052904247","https://openalex.org/W2072901340","https://openalex.org/W2085494605","https://openalex.org/W2090885171","https://openalex.org/W2120532793","https://openalex.org/W2124298085","https://openalex.org/W2131071574","https://openalex.org/W2147427313","https://openalex.org/W2153624566","https://openalex.org/W2171121044","https://openalex.org/W2241571695","https://openalex.org/W2415186390","https://openalex.org/W2423652555","https://openalex.org/W2423807589","https://openalex.org/W2524623326","https://openalex.org/W2604668004","https://openalex.org/W2605185701","https://openalex.org/W2621740759","https://openalex.org/W2787993231","https://openalex.org/W2798660790","https://openalex.org/W2798851570","https://openalex.org/W2903551170","https://openalex.org/W2928052000","https://openalex.org/W2948359422","https://openalex.org/W2963212338","https://openalex.org/W2970204999","https://openalex.org/W2990167451","https://openalex.org/W3014850249","https://openalex.org/W3159345041","https://openalex.org/W4242393948","https://openalex.org/W4244572977"],"related_works":["https://openalex.org/W2000444236","https://openalex.org/W2384475851","https://openalex.org/W2389214306","https://openalex.org/W2353602216","https://openalex.org/W2367078749","https://openalex.org/W4235240664","https://openalex.org/W2381798600","https://openalex.org/W1838576100","https://openalex.org/W2757182831","https://openalex.org/W2965083567"],"abstract_inverted_index":{"Graph":[0],"mining":[1,21,39,67,157],"workloads":[2],"aim":[3],"to":[4,28,73,91,169],"extract":[5,74],"structural":[6],"properties":[7],"of":[8,33,64,77,104,112,150,172,176],"a":[9,18,25,43,48],"graph":[10,20,38,66,156],"by":[11,46,167],"exploring":[12],"its":[13,93],"subgraph":[14,31,94],"structures.":[15],"PEREGRINE":[16,72,83],"is":[17],"general-purpose":[19],"system":[22],"that":[23,185],"provides":[24],"generic":[26],"runtime":[27],"efficiently":[29],"explore":[30],"structures":[32],"interest":[34],"and":[35,70,132,142,154],"perform":[36],"various":[37],"analyses.":[40],"It":[41],"takes":[42],"'pattern-aware'":[44],"approach":[45],"incorporating":[47],"pattern-based":[49],"programming":[50,59],"model":[51,60],"along":[52],"with":[53],"efficient":[54,85],"pattern":[55],"matching":[56,110],"strategies.":[57],"The":[58],"enables":[61,71],"easier":[62],"expression":[63],"complex":[65],"use":[68],"cases":[69],"the":[75,81,105,109,115,127,148,159,165,177,181,187],"semantics":[76],"patterns.":[78],"By":[79],"analyzing":[80],"patterns,":[82],"generates":[84],"exploration":[86,128,189],"plans":[87,129],"which":[88],"it":[89],"uses":[90],"guide":[92],"exploration.":[95],"In":[96],"this":[97],"paper,":[98],"we":[99,121],"present":[100],"an":[101],"in-depth":[102],"view":[103],"patternanalysis":[106],"techniques":[107,135,162],"powering":[108],"engine":[111],"PEREGRINE.":[113],"Beyond":[114],"theoretical":[116,183],"foundations":[117,184],"from":[118,180],"prior":[119,182],"research,":[120],"expose":[122],"opportunities":[123],"based":[124],"on":[125,174],"how":[126],"are":[130],"evaluated,":[131],"develop":[133],"key":[134],"for":[136,152],"computation":[137],"reuse,":[138],"enumeration":[139],"depth":[140],"reduction,":[141],"branch":[143],"elimination.":[144],"Our":[145],"experiments":[146],"show":[147],"importance":[149],"patternawareness":[151],"scalable":[153],"performant":[155],"where":[158],"presented":[160],"new":[161],"speed":[163],"up":[164,168],"performance":[166],"two":[170],"orders":[171],"magnitude":[173],"top":[175],"benefits":[178],"achieved":[179],"generate":[186],"initial":[188],"plans.":[190]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
