{"id":"https://openalex.org/W2101057136","doi":"https://doi.org/10.1109/icde.2011.5767858","title":"Adding regular expressions to graph reachability and pattern queries","display_name":"Adding regular expressions to graph reachability and pattern queries","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2101057136","doi":"https://doi.org/10.1109/icde.2011.5767858","mag":"2101057136"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2011.5767858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2011.5767858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE 27th International Conference on Data Engineering","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/301cce80-dabc-4fe9-a57b-6b6f97421204","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070565287","display_name":"Wenfei Fan","orcid":"https://orcid.org/0000-0001-5149-2656"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]},{"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":["CN","GB"],"is_corresponding":true,"raw_author_name":"Wenfei Fan","raw_affiliation_strings":["Harbin Institute of Technology, China","University of Edinburgh, UK"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, China","institution_ids":["https://openalex.org/I204983213"]},{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100387065","display_name":"Jianzhong Li","orcid":"https://orcid.org/0000-0002-4119-0571"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianzhong Li","raw_affiliation_strings":["Harbin Institute of Technology, China"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114535237","display_name":"Shuai Ma","orcid":"https://orcid.org/0000-0002-5829-9864"},"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":"Shuai Ma","raw_affiliation_strings":["University of Edinburgh, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101824160","display_name":"Nan Tang","orcid":"https://orcid.org/0000-0003-2832-0295"},"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":"Nan Tang","raw_affiliation_strings":["University of Edinburgh, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071093153","display_name":"Yinghui Wu","orcid":"https://orcid.org/0000-0003-3991-5155"},"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":"Yinghui Wu","raw_affiliation_strings":["University of Edinburgh, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5070565287"],"corresponding_institution_ids":["https://openalex.org/I204983213","https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":13.1362,"has_fulltext":false,"cited_by_count":146,"citation_normalized_percentile":{"value":0.99134172,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"39","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9997000098228455,"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"}},{"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7954074144363403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.635705828666687},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5656036138534546},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5274779200553894},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.47083282470703125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4264557361602783},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4211839735507965},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.40120819211006165},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32937824726104736},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.283748060464859},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27390336990356445},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.09794947504997253}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7954074144363403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.635705828666687},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5656036138534546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5274779200553894},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.47083282470703125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4264557361602783},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4211839735507965},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.40120819211006165},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32937824726104736},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.283748060464859},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27390336990356445},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.09794947504997253}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icde.2011.5767858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2011.5767858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE 27th International Conference on Data Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/301cce80-dabc-4fe9-a57b-6b6f97421204","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/301cce80-dabc-4fe9-a57b-6b6f97421204","pdf_url":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fan, W, Li, J, Ma, S, Tang, N & Wu, Y 2011, Adding regular expressions to graph reachability and pattern queries. in Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, April 11-16, 2011, Hannover, Germany. Institute of Electrical and Electronics Engineers, pp. 39-50. https://doi.org/10.1109/ICDE.2011.5767858","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/301cce80-dabc-4fe9-a57b-6b6f97421204","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11820/301cce80-dabc-4fe9-a57b-6b6f97421204","pdf_url":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fan, W, Li, J, Ma, S, Tang, N & Wu, Y 2011, Adding regular expressions to graph reachability and pattern queries. in Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, April 11-16, 2011, Hannover, Germany. Institute of Electrical and Electronics Engineers, pp. 39-50. https://doi.org/10.1109/ICDE.2011.5767858","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/301cce80-dabc-4fe9-a57b-6b6f97421204","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/301cce80-dabc-4fe9-a57b-6b6f97421204","pdf_url":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fan, W, Li, J, Ma, S, Tang, N & Wu, Y 2011, Adding regular expressions to graph reachability and pattern queries. in Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, April 11-16, 2011, Hannover, Germany. Institute of Electrical and Electronics Engineers, pp. 39-50. https://doi.org/10.1109/ICDE.2011.5767858","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W21953399","https://openalex.org/W1515993376","https://openalex.org/W1548164611","https://openalex.org/W1558832481","https://openalex.org/W1591926286","https://openalex.org/W1595443289","https://openalex.org/W1690273063","https://openalex.org/W1968895412","https://openalex.org/W1977152005","https://openalex.org/W1994924587","https://openalex.org/W1996126974","https://openalex.org/W2019540568","https://openalex.org/W2040834199","https://openalex.org/W2043655327","https://openalex.org/W2048653843","https://openalex.org/W2050137450","https://openalex.org/W2056524360","https://openalex.org/W2056865152","https://openalex.org/W2059355721","https://openalex.org/W2061884758","https://openalex.org/W2065714066","https://openalex.org/W2076334860","https://openalex.org/W2087060113","https://openalex.org/W2091642668","https://openalex.org/W2092251403","https://openalex.org/W2098817244","https://openalex.org/W2099083325","https://openalex.org/W2100586946","https://openalex.org/W2102563702","https://openalex.org/W2111607365","https://openalex.org/W2114036236","https://openalex.org/W2117657788","https://openalex.org/W2118382442","https://openalex.org/W2123966888","https://openalex.org/W2125864420","https://openalex.org/W2126359798","https://openalex.org/W2128478991","https://openalex.org/W2130354913","https://openalex.org/W2133278242","https://openalex.org/W2142491343","https://openalex.org/W2143749277","https://openalex.org/W2144878221","https://openalex.org/W2149210101","https://openalex.org/W2161728285","https://openalex.org/W2164570631","https://openalex.org/W2165190056","https://openalex.org/W2169189540","https://openalex.org/W2242459625","https://openalex.org/W2903174694","https://openalex.org/W3143810157","https://openalex.org/W4206031975","https://openalex.org/W4213009134","https://openalex.org/W6635413996","https://openalex.org/W6675162021","https://openalex.org/W6679587820","https://openalex.org/W6756634375"],"related_works":["https://openalex.org/W2109056537","https://openalex.org/W2141183298","https://openalex.org/W2315923944","https://openalex.org/W1976617626","https://openalex.org/W2221885959","https://openalex.org/W2417618227","https://openalex.org/W4245682093","https://openalex.org/W2186663447","https://openalex.org/W167435155","https://openalex.org/W2052439827"],"abstract_inverted_index":{"It":[0],"is":[1,38],"increasingly":[2],"common":[3],"to":[4,177],"find":[5],"graphs":[6,20,76],"in":[7,34,51,77,128,136,151],"which":[8,35],"edges":[9,56],"bear":[10],"different":[11],"types,":[12],"indicating":[13],"a":[14,23,29,41,45,52,69],"variety":[15],"of":[16,25,31,44,57,72,91,180,193],"relationships.":[17],"For":[18],"such":[19,80],"we":[21,62,84,114],"propose":[22],"class":[24,30],"reachability":[26,132,149],"queries":[27,88,133,169],"and":[28,118,121,134,191,202],"graph":[32,54,64,73,167,173,181],"patterns,":[33],"an":[36,145],"edge":[37],"specified":[39],"with":[40,109],"regular":[42],"expression":[43],"certain":[46],"form,":[47],"expressing":[48],"the":[49,178],"connectivity":[50],"data":[53,201],"via":[55,184],"various":[58],"types.":[59],"In":[60],"addition,":[61],"define":[63],"pattern":[65,140,168,182],"matching":[66,183],"based":[67,170],"on":[68,171],"revised":[70],"notion":[71],"simulation.":[74],"On":[75],"emerging":[78],"applications":[79],"as":[81,154,175],"social":[82],"networks,":[83],"show":[85,122],"that":[86,123],"these":[87,124,194],"are":[89,127,135,196],"capable":[90],"finding":[92],"more":[93],"sensible":[94],"information":[95],"than":[96],"their":[97,102,116,156],"traditional":[98,157],"counterparts.":[99],"Better":[100],"still,":[101],"increased":[103],"expressive":[104],"power":[105],"does":[106],"not":[107],"come":[108],"extra":[110],"complexity.":[111],"Indeed,":[112],"(1)":[113],"investigate":[115],"containment":[117],"minimization":[119],"problems,":[120],"fundamental":[125],"problems":[126],"quadratic":[129,152],"time":[130,138,153],"for":[131,139,147,155,165],"cubic":[137],"queries.":[141],"(2)":[142],"We":[143,160],"develop":[144],"algorithm":[146],"answering":[148],"queries,":[150],"counterpart.":[158],"(3)":[159],"provide":[161],"two":[162],"cubic-time":[163],"algorithms":[164,195],"evaluating":[166],"extended":[172],"simulation,":[174],"opposed":[176],"NP-completeness":[179],"subgraph":[185],"isomorphism.":[186],"(4)":[187],"The":[188],"effectiveness,":[189],"efficiency":[190],"scalability":[192],"experimentally":[197],"verified":[198],"using":[199],"real-life":[200],"synthetic":[203],"data.":[204]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":17},{"year":2012,"cited_by_count":13}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}