{"id":"https://openalex.org/W2033118953","doi":"https://doi.org/10.1145/2452376.2452411","title":"Compressed feature-based filtering and verification approach for subgraph search","display_name":"Compressed feature-based filtering and verification approach for subgraph search","publication_year":2013,"publication_date":"2013-03-18","ids":{"openalex":"https://openalex.org/W2033118953","doi":"https://doi.org/10.1145/2452376.2452411","mag":"2033118953"},"language":"en","primary_location":{"id":"doi:10.1145/2452376.2452411","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2452376.2452411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th 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/A5048610953","display_name":"Karam Gouda","orcid":null},"institutions":[{"id":"https://openalex.org/I207547235","display_name":"Benha University","ror":"https://ror.org/03tn5ee41","country_code":"EG","type":"education","lineage":["https://openalex.org/I207547235"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Karam Gouda","raw_affiliation_strings":["Benha University, Egypt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Benha University, Egypt","institution_ids":["https://openalex.org/I207547235"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016048750","display_name":"Mosab Hassaan","orcid":"https://orcid.org/0000-0003-0481-3271"},"institutions":[{"id":"https://openalex.org/I207547235","display_name":"Benha University","ror":"https://ror.org/03tn5ee41","country_code":"EG","type":"education","lineage":["https://openalex.org/I207547235"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Mosab Hassaan","raw_affiliation_strings":["Benha University, Egypt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Benha University, Egypt","institution_ids":["https://openalex.org/I207547235"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I207547235"],"apc_list":null,"apc_paid":null,"fwci":0.4157,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.59257373,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"287","last_page":"298"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9991000294685364,"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.9990000128746033,"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/search-engine-indexing","display_name":"Search engine indexing","score":0.8596791625022888},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7653079032897949},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7575770616531372},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6165145039558411},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.5220308303833008},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5104516744613647},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4584817886352539},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4561249017715454},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3959885537624359},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37691110372543335},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27640146017074585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14105883240699768},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.09540528059005737}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.8596791625022888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7653079032897949},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7575770616531372},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6165145039558411},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.5220308303833008},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5104516744613647},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4584817886352539},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4561249017715454},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3959885537624359},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37691110372543335},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27640146017074585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14105883240699768},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.09540528059005737},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"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/2452376.2452411","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2452376.2452411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Conference on Extending Database Technology","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.309.1961","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.1961","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.edbt.org/Proceedings/2013-Genova/papers/edbt/a27-gouda.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6200000047683716,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1498814251","https://openalex.org/W1975068437","https://openalex.org/W2011039300","https://openalex.org/W2013497015","https://openalex.org/W2027943354","https://openalex.org/W2071333487","https://openalex.org/W2079668713","https://openalex.org/W2083235381","https://openalex.org/W2102913801","https://openalex.org/W2110034858","https://openalex.org/W2112523291","https://openalex.org/W2112776329","https://openalex.org/W2126359798","https://openalex.org/W2140840007","https://openalex.org/W2142965177","https://openalex.org/W2143363350","https://openalex.org/W2145631416","https://openalex.org/W2147913014","https://openalex.org/W2155070669","https://openalex.org/W2169310183","https://openalex.org/W4285719527","https://openalex.org/W6684906827"],"related_works":["https://openalex.org/W3024364549","https://openalex.org/W4206019083","https://openalex.org/W1976265003","https://openalex.org/W2054476758","https://openalex.org/W2370378377","https://openalex.org/W2048865712","https://openalex.org/W4210535024","https://openalex.org/W4237510188","https://openalex.org/W2130160813","https://openalex.org/W1980912004"],"abstract_inverted_index":{"Subgraph":[0],"search":[1,123],"in":[2,36],"graph":[3,57],"datasets":[4],"is":[5,105,157,174],"an":[6,40,52,65,160],"important":[7],"problem":[8],"with":[9,42,99],"numerous":[10],"applications.":[11],"Many":[12],"feature-based":[13,73],"indexing":[14,58,67,84,181],"methods":[15,24],"have":[16,25],"been":[17],"proposed":[18],"for":[19],"solving":[20],"this":[21,61,91],"problem.":[22],"These":[23],"to":[26,38,55,108],"index":[27,41],"too":[28],"many":[29],"features":[30,95],"or":[31],"select":[32],"some":[33,100],"of":[34,47,87,125],"them":[35],"order":[37],"get":[39],"good":[43],"pruning":[44,155],"capabilities.":[45],"None":[46],"these":[48],"directions":[49],"can":[50],"give":[51],"effective":[53,175],"solution":[54],"all":[56],"issues.":[59],"In":[60],"paper,":[62],"we":[63,169],"propose":[64],"efficient":[66],"approach":[68,137,173],"which":[69,128],"improves":[70],"over":[71],"current":[72],"methods,":[74],"neither":[75],"by":[76,82,92,138],"the":[77,114,122,131,136,153],"costly":[78],"feature":[79,98,111],"selection":[80],"nor":[81],"explicitly":[83],"a":[85],"multitude":[86],"features.":[88,144],"We":[89,134],"achieve":[90],"compressing":[93],"multiple":[94],"into":[96],"one":[97],"neighborhood":[101],"information":[102],"encoded.":[103],"Neighborhood":[104],"further":[106],"used":[107],"prune":[109],"unmatched":[110],"occurrences":[112,154],"between":[113],"query":[115],"and":[116,166,176,178],"data":[117],"graphs,":[118],"thus":[119],"cutting":[120],"down":[121],"space":[124],"subgraph":[126],"matching,":[127],"significantly":[129],"reduce":[130],"verification":[132,148],"cost.":[133],"implement":[135],"exhaustively":[139],"enumerating":[140],"small":[141],"paths":[142],"as":[143],"A":[145],"novel":[146],"path-at-a-time":[147],"method":[149,156],"that":[150,171],"benefits":[151],"from":[152],"introduced.":[158],"Via":[159],"extensive":[161],"evaluation":[162],"on":[163],"both":[164],"real":[165],"synthetic":[167],"datasets,":[168],"show":[170],"our":[172],"scalable,":[177],"outperforms":[179],"state-of-the-art":[180],"methods.":[182]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}