{"id":"https://openalex.org/W2150061878","doi":"https://doi.org/10.1145/1951365.1951408","title":"Efficient discovery of frequent subgraph patterns in uncertain graph databases","display_name":"Efficient discovery of frequent subgraph patterns in uncertain graph databases","publication_year":2011,"publication_date":"2011-03-21","ids":{"openalex":"https://openalex.org/W2150061878","doi":"https://doi.org/10.1145/1951365.1951408","mag":"2150061878"},"language":"en","primary_location":{"id":"doi:10.1145/1951365.1951408","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1951365.1951408","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th International Conference on Extending Database Technology","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/A5074684566","display_name":"Odysseas Papapetrou","orcid":"https://orcid.org/0000-0003-0045-1648"},"institutions":[{"id":"https://openalex.org/I4210136150","display_name":"L3S Research Center","ror":"https://ror.org/039t4wk02","country_code":"DE","type":"facility","lineage":["https://openalex.org/I114112103","https://openalex.org/I4210136150","https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Odysseas Papapetrou","raw_affiliation_strings":["L3S Research Center, Hannover, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"L3S Research Center, Hannover, Germany","institution_ids":["https://openalex.org/I4210136150"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084886581","display_name":"Ekaterini Ioannou","orcid":"https://orcid.org/0000-0002-4922-6639"},"institutions":[{"id":"https://openalex.org/I4210136150","display_name":"L3S Research Center","ror":"https://ror.org/039t4wk02","country_code":"DE","type":"facility","lineage":["https://openalex.org/I114112103","https://openalex.org/I4210136150","https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ekaterini Ioannou","raw_affiliation_strings":["L3S Research Center, Hannover, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"L3S Research Center, Hannover, Germany","institution_ids":["https://openalex.org/I4210136150"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087768208","display_name":"Dimitrios Skoutas","orcid":"https://orcid.org/0000-0002-6118-5227"},"institutions":[{"id":"https://openalex.org/I4210136150","display_name":"L3S Research Center","ror":"https://ror.org/039t4wk02","country_code":"DE","type":"facility","lineage":["https://openalex.org/I114112103","https://openalex.org/I4210136150","https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dimitrios Skoutas","raw_affiliation_strings":["L3S Research Center, Hannover, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"L3S Research Center, Hannover, Germany","institution_ids":["https://openalex.org/I4210136150"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210136150"],"apc_list":null,"apc_paid":null,"fwci":3.5668,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.95081297,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"355","last_page":"366"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9987000226974487,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9886000156402588,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.9601490497589111},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.8024459481239319},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6697853207588196},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.5491369962692261},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.4955061674118042},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.43888312578201294},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4313497841358185},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4116591215133667},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3546871244907379},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27752941846847534},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11649203300476074}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.9601490497589111},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.8024459481239319},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6697853207588196},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.5491369962692261},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4955061674118042},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.43888312578201294},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4313497841358185},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4116591215133667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3546871244907379},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27752941846847534},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11649203300476074},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1951365.1951408","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1951365.1951408","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th International Conference on Extending Database Technology","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.6827","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.6827","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.l3s.de/%7Eioannou/publications/files/conf-edbt-papapetrouIS11.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W135031542","https://openalex.org/W1506285740","https://openalex.org/W1641749581","https://openalex.org/W1970259423","https://openalex.org/W1973968359","https://openalex.org/W1975068437","https://openalex.org/W1996278133","https://openalex.org/W2006912660","https://openalex.org/W2025167103","https://openalex.org/W2061820396","https://openalex.org/W2062516497","https://openalex.org/W2079007492","https://openalex.org/W2084591860","https://openalex.org/W2098084730","https://openalex.org/W2108150886","https://openalex.org/W2109241198","https://openalex.org/W2110034858","https://openalex.org/W2118349699","https://openalex.org/W2123017611","https://openalex.org/W2123845384","https://openalex.org/W2126359798","https://openalex.org/W2130426318","https://openalex.org/W2137442080","https://openalex.org/W2142965177","https://openalex.org/W2152470671","https://openalex.org/W2157849872","https://openalex.org/W2162481448","https://openalex.org/W2164281374","https://openalex.org/W2168209541","https://openalex.org/W2170726034","https://openalex.org/W2420733993","https://openalex.org/W2955337691","https://openalex.org/W6605502080"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W2361654510","https://openalex.org/W4224223872","https://openalex.org/W2220213825","https://openalex.org/W2036065890","https://openalex.org/W2691956313","https://openalex.org/W4313419844","https://openalex.org/W1983171305","https://openalex.org/W2142652836","https://openalex.org/W2376954560"],"abstract_inverted_index":{"Mining":[0],"frequent":[1,116],"subgraph":[2,57,67,117,130],"patterns":[3,58,131],"in":[4,15,24,37,46],"graph":[5,105,189],"databases":[6,190],"is":[7,20,136],"a":[8,21,77,96],"challenging":[9],"and":[10,62,163],"important":[11],"problem":[12,27,49],"with":[13,88,159,196],"applications":[14],"several":[16],"domains.":[17],"Recently,":[18],"there":[19],"growing":[22],"interest":[23],"generalizing":[25],"the":[26,34,38,52,63,73,103,109,124,134,140,147,169,172,192,199],"to":[28,59,71,107,114,138,161,198],"uncertain":[29,89,104,188],"graphs,":[30],"which":[31],"can":[32],"model":[33],"inherent":[35],"uncertainty":[36],"data":[39],"of":[40,55,66,102,111,142,150,171,176],"many":[41],"applications.":[42],"The":[43,80,119,174],"main":[44],"difficulty":[45],"solving":[47],"this":[48,92],"results":[50],"from":[51],"large":[53,64],"number":[54,65,110,141],"candidate":[56,129,152],"be":[60],"examined":[61],"isomorphism":[68],"tests":[69],"required":[70,144],"find":[72,115],"graphs":[74],"that":[75,98,166],"contain":[76],"given":[78],"pattern.":[79,153],"latter":[81],"becomes":[82],"even":[83],"more":[84],"challenging,":[85],"when":[86],"dealing":[87],"graphs.":[90],"In":[91],"paper,":[93],"we":[94],"propose":[95],"method":[97],"uses":[99],"an":[100],"index":[101,135],"database":[106],"reduce":[108,139],"comparisons":[112,143],"needed":[113],"patterns.":[118],"proposed":[120],"algorithm":[121],"relies":[122],"on":[123,179,186],"apriori":[125],"property":[126],"for":[127,145],"enumerating":[128],"efficiently.":[132],"Then,":[133],"used":[137],"computing":[146],"expected":[148],"support":[149],"each":[151],"It":[154],"also":[155],"enables":[156],"additional":[157],"optimizations":[158],"respect":[160,197],"scheduling":[162],"early":[164],"termination,":[165],"further":[167],"increase":[168],"efficiency":[170],"method.":[173],"evaluation":[175],"our":[177],"approach":[178],"three":[180],"real-world":[181],"datasets":[182],"as":[183,185],"well":[184],"synthetic":[187],"demonstrates":[191],"significant":[193],"cost":[194],"savings":[195],"state-of-the-art":[200],"approach.":[201]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}