{"id":"https://openalex.org/W2590510835","doi":"https://doi.org/10.1007/978-3-319-53480-0_25","title":"A Minimal Rare Substructures-Based Model for Graph Database Indexing","display_name":"A Minimal Rare Substructures-Based Model for Graph Database Indexing","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2590510835","doi":"https://doi.org/10.1007/978-3-319-53480-0_25","mag":"2590510835"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-53480-0_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53480-0_25","pdf_url":null,"source":{"id":"https://openalex.org/S2764905038","display_name":"Advances in intelligent systems and computing","issn_l":"2194-5357","issn":["2194-5357","2194-5365"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Intelligent Systems and Computing","raw_type":"book-chapter"},"type":"book-chapter","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/A5051209124","display_name":"Mehdi Azaouzi","orcid":"https://orcid.org/0000-0003-4960-916X"},"institutions":[{"id":"https://openalex.org/I8636806","display_name":"University of Sousse","ror":"https://ror.org/00dmpgj58","country_code":"TN","type":"education","lineage":["https://openalex.org/I8636806"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"Mehdi Azaouzi","raw_affiliation_strings":["Modeling of Automated Reasoning Systems (MARS) Research Lab, Higher Institute of Computer Science and Telecom (ISITCom), University of Sousse, Sousse, Tunisia"],"affiliations":[{"raw_affiliation_string":"Modeling of Automated Reasoning Systems (MARS) Research Lab, Higher Institute of Computer Science and Telecom (ISITCom), University of Sousse, Sousse, Tunisia","institution_ids":["https://openalex.org/I8636806"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018211585","display_name":"Lotfi Romdhane","orcid":"https://orcid.org/0000-0001-8509-2386"},"institutions":[{"id":"https://openalex.org/I8636806","display_name":"University of Sousse","ror":"https://ror.org/00dmpgj58","country_code":"TN","type":"education","lineage":["https://openalex.org/I8636806"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Lotfi Ben Romdhane","raw_affiliation_strings":["Modeling of Automated Reasoning Systems (MARS) Research Lab, Higher Institute of Computer Science and Telecom (ISITCom), University of Sousse, Sousse, Tunisia"],"affiliations":[{"raw_affiliation_string":"Modeling of Automated Reasoning Systems (MARS) Research Lab, Higher Institute of Computer Science and Telecom (ISITCom), University of Sousse, Sousse, Tunisia","institution_ids":["https://openalex.org/I8636806"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051209124"],"corresponding_institution_ids":["https://openalex.org/I8636806"],"apc_list":null,"apc_paid":null,"fwci":1.0007,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7361809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"250","last_page":"259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"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":1.0,"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.9925000071525574,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9890999794006348,"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/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.8219237327575684},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.7328818440437317},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6845661997795105},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5764052867889404},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.5453760623931885},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5077922940254211},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4931921362876892},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44605356454849243},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.4353735148906708},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.42808955907821655},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.4126484990119934},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2504296898841858},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.22460755705833435},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.1376326084136963}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.8219237327575684},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.7328818440437317},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6845661997795105},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5764052867889404},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.5453760623931885},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5077922940254211},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4931921362876892},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44605356454849243},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.4353735148906708},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.42808955907821655},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.4126484990119934},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2504296898841858},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.22460755705833435},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.1376326084136963}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-53480-0_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53480-0_25","pdf_url":null,"source":{"id":"https://openalex.org/S2764905038","display_name":"Advances in intelligent systems and computing","issn_l":"2194-5357","issn":["2194-5357","2194-5365"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Intelligent Systems and Computing","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W229892527","https://openalex.org/W1946039914","https://openalex.org/W1975068437","https://openalex.org/W1992416685","https://openalex.org/W2015120014","https://openalex.org/W2027943354","https://openalex.org/W2036265926","https://openalex.org/W2056899820","https://openalex.org/W2067657700","https://openalex.org/W2072534270","https://openalex.org/W2088023238","https://openalex.org/W2092717188","https://openalex.org/W2110034858","https://openalex.org/W2112776329","https://openalex.org/W2142965177","https://openalex.org/W2145631416","https://openalex.org/W2169310183","https://openalex.org/W2170726034"],"related_works":["https://openalex.org/W2886672068","https://openalex.org/W2953496651","https://openalex.org/W2393701947","https://openalex.org/W3208942821","https://openalex.org/W1512756268","https://openalex.org/W2604114816","https://openalex.org/W167435155","https://openalex.org/W2397707437","https://openalex.org/W4324266426","https://openalex.org/W4245682093"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}