{"id":"https://openalex.org/W2800336805","doi":"https://doi.org/10.1145/2983323.2983766","title":"Approximating Graph Pattern Queries Using Views","display_name":"Approximating Graph Pattern Queries Using Views","publication_year":2016,"publication_date":"2016-10-24","ids":{"openalex":"https://openalex.org/W2800336805","doi":"https://doi.org/10.1145/2983323.2983766","mag":"2800336805"},"language":"en","primary_location":{"id":"doi:10.1145/2983323.2983766","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2983323.2983766","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM International on Conference on Information and Knowledge Management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/f03e5d79-e4b6-4711-8e58-41de4c8f84c7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059344854","display_name":"Jia Li","orcid":"https://orcid.org/0000-0002-4346-8696"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jia Li","raw_affiliation_strings":["Beihang University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101426208","display_name":"Yang Cao","orcid":"https://orcid.org/0000-0001-7984-3219"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Yang Cao","raw_affiliation_strings":["University of Edinburgh & Beihang University, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh & Beihang University, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5104473141","display_name":"Xudong Liu","orcid":"https://orcid.org/0000-0001-7102-0963"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xudong Liu","raw_affiliation_strings":["Beihang University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5059344854"],"corresponding_institution_ids":["https://openalex.org/I82880672"],"apc_list":null,"apc_paid":null,"fwci":1.169,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.86080857,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"449","last_page":"458"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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.9997000098228455,"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.6478347778320312},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6069132685661316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.595848798751831},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5618839859962463},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5120173096656799},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.4504847526550293},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4237963557243347},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.4234044849872589},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41567206382751465},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4117738902568817},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40438592433929443},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.320290207862854},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1780209243297577}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.6478347778320312},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6069132685661316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.595848798751831},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5618839859962463},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5120173096656799},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.4504847526550293},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4237963557243347},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.4234044849872589},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41567206382751465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4117738902568817},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40438592433929443},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.320290207862854},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1780209243297577},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2983323.2983766","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2983323.2983766","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM International on Conference on Information and Knowledge Management","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/f03e5d79-e4b6-4711-8e58-41de4c8f84c7","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/f03e5d79-e4b6-4711-8e58-41de4c8f84c7","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li, J, Cao, Y & Liu, X 2016, Approximating Graph Pattern Queries Using Views. in Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. CIKM '16, New York, NY, USA, pp. 449-458, 25th ACM International on Conference on Information and Knowledge Management, Indianapolis, Indiana, United States, 24/10/16. https://doi.org/10.1145/2983323.2983766","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/f03e5d79-e4b6-4711-8e58-41de4c8f84c7","is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=2983766","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/f03e5d79-e4b6-4711-8e58-41de4c8f84c7","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/f03e5d79-e4b6-4711-8e58-41de4c8f84c7","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li, J, Cao, Y & Liu, X 2016, Approximating Graph Pattern Queries Using Views. in Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. CIKM '16, New York, NY, USA, pp. 449-458, 25th ACM International on Conference on Information and Knowledge Management, Indianapolis, Indiana, United States, 24/10/16. https://doi.org/10.1145/2983323.2983766","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W84545142","https://openalex.org/W1533752709","https://openalex.org/W1656132379","https://openalex.org/W1822348499","https://openalex.org/W1969276117","https://openalex.org/W2022858489","https://openalex.org/W2027388991","https://openalex.org/W2031484081","https://openalex.org/W2060359281","https://openalex.org/W2078242294","https://openalex.org/W2083235381","https://openalex.org/W2098817244","https://openalex.org/W2126359798","https://openalex.org/W2147913014","https://openalex.org/W2152191782","https://openalex.org/W2170538507","https://openalex.org/W2244358235","https://openalex.org/W3139415452","https://openalex.org/W4253229272"],"related_works":["https://openalex.org/W1482551403","https://openalex.org/W84561889","https://openalex.org/W1258892498","https://openalex.org/W2954463587","https://openalex.org/W2018568077","https://openalex.org/W2393701947","https://openalex.org/W1856194915","https://openalex.org/W3080158623","https://openalex.org/W2183579781","https://openalex.org/W2046021036"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"approximation":[3,97],"of":[4,19,27,40,114,147,170],"graph":[5,50,87],"pattern":[6,12,82],"queries":[7,28,83,175],"using":[8,76,98,140,176],"views.":[9,99,177],"Given":[10,100],"a":[11,16,25],"query":[13],"Q":[14,41,56,101,115,127],"and":[15,30,37,63,66,70,89,102,111,137,153,155,168,173],"set":[17],"V":[18,129],"views,":[20],"we":[21,105,164],"propose":[22],"to":[23,33,53,120,126,134],"find":[24,121],"pair":[26],"Qu":[29,69],"Ql,":[31],"referred":[32],"as":[34],"the":[35,148,166],"upper":[36,110,136],"lower":[38,112,138],"approximations":[39,113,122,139],"w.r.t.":[42,116,128],"V,":[43,103],"such":[44],"that":[45,123],"(a)":[46],"for":[47],"any":[48],"data":[49],"G,":[51],"answers":[52],"(part":[54],"of)":[55],"in":[57,61,78,142],"G":[58],"are":[59,124],"contained":[60],"Qu(G)":[62],"contain":[64],"Ql(G);":[65],"(b)":[67],"both":[68,86],"Ql":[71],"can":[72],"be":[73],"answered":[74],"by":[75],"views":[77,141],"V.":[79,117],"We":[80,92,144],"consider":[81],"based":[84],"on":[85],"simulation":[88,172],"subgraph":[90,174],"isomorphism.":[91],"study":[93,106,150],"fundamental":[94],"problems":[95],"about":[96],"(1)":[104],"whether":[107],"there":[108],"exist":[109],"(2)":[118],"How":[119,133],"closest":[125],"if":[130],"exist?":[131],"(3)":[132],"answer":[135],"V?":[143],"give":[145],"characterizations":[146],"problems,":[149],"their":[151],"complexity":[152],"approximation-hardness,":[154],"develop":[156],"algorithms":[157],"with":[158],"provable":[159],"bounds.":[160],"Using":[161],"real-life":[162],"datasets,":[163],"verify":[165],"effectiveness":[167],"efficiency":[169],"approximating":[171]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}