{"id":"https://openalex.org/W2050663094","doi":"https://doi.org/10.1109/icdim.2010.5664712","title":"An efficient filtering technique for super-graph query processing","display_name":"An efficient filtering technique for super-graph query processing","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2050663094","doi":"https://doi.org/10.1109/icdim.2010.5664712","mag":"2050663094"},"language":"en","primary_location":{"id":"doi:10.1109/icdim.2010.5664712","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdim.2010.5664712","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Fifth International Conference on Digital Information Management (ICDIM)","raw_type":"proceedings-article"},"type":"article","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/A5101928883","display_name":"Mohamed Saber","orcid":"https://orcid.org/0000-0003-2692-9507"},"institutions":[{"id":"https://openalex.org/I107720978","display_name":"Ain Shams University","ror":"https://ror.org/00cb9w016","country_code":"EG","type":"education","lineage":["https://openalex.org/I107720978"]}],"countries":["EG"],"is_corresponding":true,"raw_author_name":"Mohamed Saber","raw_affiliation_strings":["Ain Shams University, Cairo, Egypt","Ain Shams University Cairo Egypt"],"affiliations":[{"raw_affiliation_string":"Ain Shams University, Cairo, Egypt","institution_ids":["https://openalex.org/I107720978"]},{"raw_affiliation_string":"Ain Shams University Cairo Egypt","institution_ids":["https://openalex.org/I107720978"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074551690","display_name":"Mostafa Aref","orcid":"https://orcid.org/0000-0002-1278-0070"},"institutions":[{"id":"https://openalex.org/I107720978","display_name":"Ain Shams University","ror":"https://ror.org/00cb9w016","country_code":"EG","type":"education","lineage":["https://openalex.org/I107720978"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Mostafa Aref","raw_affiliation_strings":["Ain Shams University, Cairo, Egypt","Ain Shams University Cairo Egypt"],"affiliations":[{"raw_affiliation_string":"Ain Shams University, Cairo, Egypt","institution_ids":["https://openalex.org/I107720978"]},{"raw_affiliation_string":"Ain Shams University Cairo Egypt","institution_ids":["https://openalex.org/I107720978"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025438126","display_name":"Tarek F. Gharib","orcid":"https://orcid.org/0000-0003-0780-782X"},"institutions":[{"id":"https://openalex.org/I107720978","display_name":"Ain Shams University","ror":"https://ror.org/00cb9w016","country_code":"EG","type":"education","lineage":["https://openalex.org/I107720978"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Tarek F. Gharib","raw_affiliation_strings":["Ain Shams University, Cairo, Egypt","Ain Shams University Cairo Egypt"],"affiliations":[{"raw_affiliation_string":"Ain Shams University, Cairo, Egypt","institution_ids":["https://openalex.org/I107720978"]},{"raw_affiliation_string":"Ain Shams University Cairo Egypt","institution_ids":["https://openalex.org/I107720978"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101928883"],"corresponding_institution_ids":["https://openalex.org/I107720978"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13243935,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":null,"first_page":"174","last_page":"181"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9973999857902527,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9944999814033508,"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/computer-science","display_name":"Computer science","score":0.7393250465393066},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.6758490204811096},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.6282590627670288},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.48454800248146057},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4328409731388092},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4225044250488281},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4207853078842163},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.30750566720962524},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.17151618003845215}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7393250465393066},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.6758490204811096},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.6282590627670288},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.48454800248146057},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4328409731388092},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4225044250488281},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4207853078842163},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.30750566720962524},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.17151618003845215}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icdim.2010.5664712","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdim.2010.5664712","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Fifth International Conference on Digital Information Management (ICDIM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1874295121","https://openalex.org/W1972243925","https://openalex.org/W2012066443","https://openalex.org/W2036265926","https://openalex.org/W2043655327","https://openalex.org/W2053725099","https://openalex.org/W2079668713","https://openalex.org/W2100080493","https://openalex.org/W2102913801","https://openalex.org/W2114507260","https://openalex.org/W2126359798","https://openalex.org/W2140840007","https://openalex.org/W2142965177","https://openalex.org/W2145631416","https://openalex.org/W2152609228","https://openalex.org/W2157529519","https://openalex.org/W2165467455","https://openalex.org/W2185907055","https://openalex.org/W3138367763","https://openalex.org/W6638231387","https://openalex.org/W6639069962","https://openalex.org/W6643489068","https://openalex.org/W6680870402","https://openalex.org/W6682832507"],"related_works":["https://openalex.org/W2220213825","https://openalex.org/W2691956313","https://openalex.org/W1972243925","https://openalex.org/W2018558368","https://openalex.org/W4224223872","https://openalex.org/W4313419844","https://openalex.org/W2126194878","https://openalex.org/W2590510835","https://openalex.org/W2366976231","https://openalex.org/W2248837383"],"abstract_inverted_index":{"Recently,":[0],"a":[1,21,34,50,88,93],"lot":[2,51],"of":[3,36,52,82,115],"applications":[4],"depend":[5],"on":[6],"data":[7],"modeled":[8],"by":[9],"graphs.":[10,103],"Efficient":[11],"query":[12,23,26,89,94,138],"processing":[13,27,76,90,139,144],"over":[14],"graph":[15,22,47],"databases":[16,48],"serves":[17],"these":[18],"applications.":[19],"Having":[20],"q,":[24],"super-graph":[25],"finds":[28],"all":[29],"the":[30,96,106,112,116,121,128,132,142],"graphs":[31,37,53,118],"g":[32,40],"in":[33,43],"database":[35,97,117],"D":[38],"where":[39],"is":[41,98,146],"contained":[42],"q":[44],"(gsubeq).":[45],"Because":[46],"contain":[49],"and":[54,87,140,158],"because":[55],"sub-graph":[56],"isomorphic":[57],"tests":[58,135],"are":[59],"NP-complete,":[60],"an":[61,72,83],"indexing-based":[62],"technique":[63,74,80,108,130],"should":[64],"be":[65],"adopted.":[66],"In":[67],"this":[68],"paper":[69],"we":[70],"propose":[71],"efficient":[73],"for":[75,137],"supergraph":[77],"queries.":[78],"The":[79,148],"consists":[81],"index":[84],"called":[85],"eIndex":[86,153],"algorithm.":[91],"Given":[92],"graph,":[95],"filtered":[99],"to":[100],"generate":[101],"candidate":[102],"While":[104],"filtering,":[105],"proposed":[107,129],"takes":[109,154],"into":[110],"consideration":[111],"full":[113],"structure":[114],"besides":[119],"considering":[120],"frequent":[122],"fragments.":[123],"Through":[124],"polynomial":[125],"time":[126,145,157],"algorithms,":[127],"reduces":[131],"subgraph":[133],"isomorphism":[134],"required":[136],"hence":[141],"total":[143],"reduced.":[147],"results":[149],"show":[150],"that":[151],"building":[152],"much":[155],"less":[156],"space":[159],"than":[160],"other":[161],"methods.":[162]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}