{"id":"https://openalex.org/W2359640428","doi":"https://doi.org/10.5220/0005875002040213","title":"Subgraph Isomorphism Search in Massive Graph Databases","display_name":"Subgraph Isomorphism Search in Massive Graph Databases","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2359640428","doi":"https://doi.org/10.5220/0005875002040213","mag":"2359640428"},"language":"en","primary_location":{"id":"doi:10.5220/0005875002040213","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005875002040213","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Internet of Things and Big Data","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0005875002040213","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110368102","display_name":"Chemseddine Nabti","orcid":null},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Chemseddine Nabti","raw_affiliation_strings":["Universit\u00e9 de Lyon and Universit\u00e9 Lyon 1, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lyon and Universit\u00e9 Lyon 1, France","institution_ids":["https://openalex.org/I100532134"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005723915","display_name":"Hamida Seba","orcid":"https://orcid.org/0000-0003-0670-815X"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hamida Seba","raw_affiliation_strings":["Universit\u00e9 de Lyon and Universit\u00e9 Lyon 1, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lyon and Universit\u00e9 Lyon 1, France","institution_ids":["https://openalex.org/I100532134"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110368102"],"corresponding_institution_ids":["https://openalex.org/I100532134"],"apc_list":null,"apc_paid":null,"fwci":0.50154715,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.7304003,"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":"204","last_page":"213"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9976000189781189,"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.9972000122070312,"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/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.8992149829864502},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7269913554191589},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.6391558051109314},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.6253748536109924},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5941288471221924},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.5866706371307373},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.5585477948188782},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.5326278805732727},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.5309155583381653},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5299257636070251},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.46605759859085083},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4110182821750641},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34681910276412964},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34209081530570984},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3309366703033447},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.25091421604156494}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.8992149829864502},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7269913554191589},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.6391558051109314},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.6253748536109924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5941288471221924},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.5866706371307373},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.5585477948188782},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5326278805732727},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.5309155583381653},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5299257636070251},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.46605759859085083},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4110182821750641},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34681910276412964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34209081530570984},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3309366703033447},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.25091421604156494},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5220/0005875002040213","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005875002040213","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Internet of Things and Big Data","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5220/0005875002040213","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005875002040213","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Internet of Things and Big Data","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W2252464404","https://openalex.org/W4324266426","https://openalex.org/W167435155","https://openalex.org/W2376177032","https://openalex.org/W2946681422","https://openalex.org/W3181591076","https://openalex.org/W2359640428","https://openalex.org/W4245682093","https://openalex.org/W1497311729"],"abstract_inverted_index":{"Querying":[0],"graph":[1,33,51,93,126,176,191],"data":[2,16,29,34,52,92],"is":[3,35,53,58,65,70,151,163,173,182,242,277],"a":[4,21,91,96,110,117,186,190,207,216,226,255,258,300],"fundamental":[5],"problem":[6,68,105],"that":[7,94,192,197,231,291],"witnesses":[8],"an":[9,59,66,285],"increasing":[10],"interest":[11],"especially":[12],"for":[13,27,279],"massive":[14,125],"structured":[15],"where":[17],"graphs":[18,157],"come":[19],"as":[20,76,178],"promising":[22],"alternative":[23],"to":[24,86,141,184,274,298],"relational":[25,42],"databases":[26],"big":[28,280],"modeling.":[30],"However,":[31],"querying":[32,41,50],"different":[36],"and":[37,131,214,314],"more":[38],"complex":[39],"than":[40],"table-based":[43],"data.":[44,127],"The":[45,99],"main":[46],"task":[47],"involved":[48,71],"in":[49,72,116,175,219,257],"subgraph":[54,136,148],"isomorphism":[55,63,137,149],"search":[56,112,150,212,237,305],"which":[57,69,114,276],"NP-complete":[60],"problem.":[61],"Subgraph":[62],"search,":[64],"important":[67],"various":[73],"domains":[74],"such":[75],"pattern":[77],"recognition,":[78],"social":[79],"network":[80],"analysis,":[81],"biology,":[82],"etc.":[83],"It":[84,181],"consists":[85],"enumerate":[87],"the":[88,199,211,220,233,236,252,266,294,304,318,321],"subgraphs":[89],"of":[90,103,135,156,189,195,210,229,235,269,296,303,320],"match":[95],"query":[97],"graph.":[98],"most":[100],"known":[101],"solutions":[102],"this":[104,203],"are":[106],"backtracking-based.":[107],"They":[108],"explore":[109],"large":[111],"space":[113,133,213],"results":[115],"high":[118],"computational":[119],"cost":[120],"when":[121],"we":[122,205],"deal":[123],"with":[124,317],"To":[128],"reduce":[129],"time":[130,267],"memory":[132],"complexity":[134,268],"search.":[138],"We":[139,223,282],"propose":[140,225,283],"use":[142],"compressed":[143,154],"graphs.":[144,281],"In":[145],"our":[146,308],"approach,":[147],"achieved":[152],"on":[153,293,310],"representations":[155],"without":[158],"decompressing":[159],"them.":[160],"Graph":[161],"compression":[162,204],"performed":[164],"by":[165],"grouping":[166],"vertices":[167,196,230],"into":[168],"super":[169],"vertices.":[170],"This":[171,239,261],"concept":[172],"known,":[174],"theory,":[177],"modular":[179],"decomposition.":[180],"used":[183],"generate":[185],"tree":[187],"representation":[188],"highlights":[193],"groups":[194],"have":[198],"same":[200],"neighbors.":[201],"With":[202],"obtain":[206],"substantial":[208],"reduction":[209],"consequently":[215],"significant":[217],"saving":[218],"processing":[221],"time.":[222],"also":[224,284],"novel":[227],"encoding":[228,264],"simplifies":[232],"filtering":[234,271,289],"space.":[238],"new":[240],"mechanism":[241],"called":[243],"compact":[244],"neighborhood":[245,263],"Index":[246],"(CNI).":[247],"A":[248],"CNI":[249],"distills":[250],"all":[251],"information":[253],"around":[254],"vertex":[256,270],"single":[259],"integer.":[260],"simple":[262],"reduces":[265],"from":[272],"cubic":[273],"quadratic":[275],"considerable":[278],"iterative":[286],"local":[287],"global":[288,301],"algorithm":[290],"relies":[292],"characteristics":[295],"CNIs":[297],"ensure":[299],"pruning":[302],"space.We":[306],"evaluated":[307],"approaches":[309],"several":[311],"real-word":[312],"datasets":[313],"compared":[315],"them":[316],"state":[319],"art":[322],"algorithms":[323]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}