{"id":"https://openalex.org/W2102913801","doi":"https://doi.org/10.1145/1066157.1066244","title":"Substructure similarity search in graph databases","display_name":"Substructure similarity search in graph databases","publication_year":2005,"publication_date":"2005-06-14","ids":{"openalex":"https://openalex.org/W2102913801","doi":"https://doi.org/10.1145/1066157.1066244","mag":"2102913801"},"language":"en","primary_location":{"id":"doi:10.1145/1066157.1066244","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066157.1066244","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},"type":"conference-paper","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/A5047709762","display_name":"Xifeng Yan","orcid":"https://orcid.org/0009-0000-6508-4792"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xifeng Yan","raw_affiliation_strings":["University of Illinois at Urbana-Champaign","University of Illinois at Urbana Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036357902","display_name":"Philip S. Yu","orcid":"https://orcid.org/0000-0002-3491-5968"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philip S. Yu","raw_affiliation_strings":["IBM T. J. Watson Research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019539533","display_name":"Jiawei Han","orcid":"https://orcid.org/0000-0002-3629-2696"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiawei Han","raw_affiliation_strings":["University of Illinois at Urbana-Champaign","University of Illinois at Urbana Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana Champaign","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.7721,"has_fulltext":false,"cited_by_count":318,"citation_normalized_percentile":{"value":0.98963984,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"766","last_page":"777"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9986000061035156,"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.9986000061035156,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9980999827384949,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9970999956130981,"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/computer-science","display_name":"Computer science","score":0.7001625299453735},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.559367835521698},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5220662951469421},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.5069572925567627},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5044962167739868},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.47254252433776855},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4709666073322296},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3329889178276062},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2878669500350952}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7001625299453735},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.559367835521698},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5220662951469421},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.5069572925567627},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5044962167739868},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.47254252433776855},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4709666073322296},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3329889178276062},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2878669500350952},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1066157.1066244","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066157.1066244","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.133.5680","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.5680","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ust.hk/~leichen/courses/comp630j/readings/searchovergraph/substructuresim-sigmod05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.484.6289","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.484.6289","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uiuc.edu/class/fa05/cs591han/sigmodpods05/sigmod/pdf/p766-yan.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W4909282","https://openalex.org/W47292847","https://openalex.org/W1510477870","https://openalex.org/W1875120328","https://openalex.org/W1990313671","https://openalex.org/W2001496424","https://openalex.org/W2011039300","https://openalex.org/W2012459404","https://openalex.org/W2023358833","https://openalex.org/W2031159640","https://openalex.org/W2043481183","https://openalex.org/W2050137450","https://openalex.org/W2096725584","https://openalex.org/W2096729078","https://openalex.org/W2110034858","https://openalex.org/W2122929441","https://openalex.org/W2130479394","https://openalex.org/W2136593687","https://openalex.org/W2137913010","https://openalex.org/W2143996311","https://openalex.org/W2145805921","https://openalex.org/W2152475379","https://openalex.org/W2152923343","https://openalex.org/W2159482845","https://openalex.org/W4294216483","https://openalex.org/W6682302528"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2942366970","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W2562400057","https://openalex.org/W1692008701","https://openalex.org/W2597588799","https://openalex.org/W4360593462","https://openalex.org/W2194570607"],"abstract_inverted_index":{"Advanced":[0],"database":[1],"systems":[2],"face":[3],"a":[4,52,83,151,159],"great":[5],"challenge":[6,128],"raised":[7],"by":[8],"the":[9,32,64,78,87,127,142,165,169,190,197],"emergence":[10],"of":[11,35,48,66,82,144,164],"massive,":[12],"complex":[13,36,49],"structural":[14,93],"data":[15],"in":[16,28,73,122,200],"bioinformatics,":[17],"chem-informatics,":[18],"and":[19,161,178,186,192,211],"many":[20,100,118],"other":[21,212],"applications.":[22],"The":[23],"most":[24],"fundamental":[25],"support":[26],"needed":[27],"these":[29],"applications":[30],"is":[31,42,108,129],"efficient":[33],"search":[34,47,69,193],"structured":[37],"data.":[38],"Since":[39],"exact":[40],"matching":[41],"often":[43],"too":[44,114,117],"restrictive,":[45],"similarity":[46,68,105],"structures":[50,214],"becomes":[51],"vital":[53],"operation":[54],"that":[55,111,180],"must":[56],"be":[57,203],"supported":[58],"efficiently.In":[59],"this":[60],"paper,":[61],"we":[62,149],"investigate":[63],"issues":[65],"substructure":[67],"using":[70,112],"indexed":[71],"features":[72,119,182],"graph":[74,85],"databases.":[75],"By":[76,140],"transforming":[77],"edge":[79],"relaxation":[80],"ratio":[81],"query":[84],"into":[86],"maximum":[88],"allowed":[89],"missing":[90],"features,":[91],"our":[92],"filtering":[94,124,191],"algorithm,":[95],"called":[96],"Grafil,":[97],"can":[98,120,188,202],"filter":[99,157],"graphs":[101],"without":[102],"performing":[103],"pairwise":[104],"computations.":[106],"It":[107],"further":[109],"shown":[110],"either":[113],"few":[115],"or":[116],"result":[121],"poor":[123],"performance.":[125],"Thus":[126],"to":[130,171,205],"design":[131],"an":[132],"effective":[133,173],"feature":[134,146,174],"set":[135],"selection":[136,147],"strategy":[137],"for":[138,176],"filtering.":[139],"examining":[141],"effect":[143],"different":[145],"mechanisms,":[148],"develop":[150],"multi-filter":[152],"composition":[153],"strategy,":[154],"where":[155],"each":[156],"uses":[158],"distinct":[160],"complementary":[162],"subset":[163],"features.":[166],"We":[167],"identify":[168],"criteria":[170],"form":[172],"sets":[175],"filtering,":[177],"demonstrate":[179],"combining":[181],"with":[183],"similar":[184],"size":[185],"selectivity":[187],"improve":[189],"performance":[194],"significantly.":[195],"Moreover,":[196],"concept":[198],"presented":[199],"Grafil":[201],"applied":[204],"searching":[206],"approximate":[207],"non-consecutive":[208],"sequences,":[209],"trees,":[210],"complicated":[213],"as":[215],"well.":[216]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":29},{"year":2013,"cited_by_count":23},{"year":2012,"cited_by_count":34}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}