{"id":"https://openalex.org/W2126917089","doi":"https://doi.org/10.1145/2588555.2610513","title":"Querying big graphs within bounded resources","display_name":"Querying big graphs within bounded resources","publication_year":2014,"publication_date":"2014-06-18","ids":{"openalex":"https://openalex.org/W2126917089","doi":"https://doi.org/10.1145/2588555.2610513","mag":"2126917089"},"language":"en","primary_location":{"id":"doi:10.1145/2588555.2610513","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2588555.2610513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data","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/b8b79615-a7c8-4862-906d-804d150eb7ac","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070565287","display_name":"Wenfei Fan","orcid":"https://orcid.org/0000-0001-5149-2656"},"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":true,"raw_author_name":"Wenfei Fan","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom","University of Edinburgh, edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh, edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100327868","display_name":"Xin Wang","orcid":"https://orcid.org/0000-0001-9651-0651"},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xin Wang","raw_affiliation_strings":["Southwest Jiaotong University, Chengdu, China"],"affiliations":[{"raw_affiliation_string":"Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071093153","display_name":"Yinghui Wu","orcid":"https://orcid.org/0000-0003-3991-5155"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yinghui Wu","raw_affiliation_strings":["UC Santa Barbara, California, USA"],"affiliations":[{"raw_affiliation_string":"UC Santa Barbara, California, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070565287"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":5.6823,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.96985968,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"301","last_page":"312"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9988999962806702,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/reachability","display_name":"Reachability","score":0.8387315273284912},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7550513744354248},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.716723620891571},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.6291186213493347},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4696608781814575},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.428308367729187},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2241705060005188}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8387315273284912},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7550513744354248},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.716723620891571},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.6291186213493347},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4696608781814575},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.428308367729187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2241705060005188},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2588555.2610513","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2588555.2610513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.709.598","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.709.598","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eecs.wsu.edu/%7Eyinghui/mat/papers/Querying%20big%20graphs%20within%20bounded%20resources-sigmod14.pdf","raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/b8b79615-a7c8-4862-906d-804d150eb7ac","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/b8b79615-a7c8-4862-906d-804d150eb7ac","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":"Fan, W, Wang, X & Wu, Y 2014, Querying Big Graphs Within Bounded Resources. in Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. New York, NY, USA, pp. 301-312. https://doi.org/10.1145/2588555.2610513","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/b8b79615-a7c8-4862-906d-804d150eb7ac","is_oa":false,"landing_page_url":"http://hdl.handle.net/20.500.11820/b8b79615-a7c8-4862-906d-804d150eb7ac","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/b8b79615-a7c8-4862-906d-804d150eb7ac","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/b8b79615-a7c8-4862-906d-804d150eb7ac","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":"Fan, W, Wang, X & Wu, Y 2014, Querying Big Graphs Within Bounded Resources. in Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. New York, NY, USA, pp. 301-312. https://doi.org/10.1145/2588555.2610513","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.47999998927116394,"display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G3649347000","display_name":null,"funder_award_id":"EP/J015377/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5084882019","display_name":null,"funder_award_id":"III 1302212","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6080451938","display_name":null,"funder_award_id":"2012CB316200","funder_id":"https://openalex.org/F4320321540","funder_display_name":"Ministry of Science and Technology of the People's Republic of China"},{"id":"https://openalex.org/G6177271572","display_name":"Querying Graph Structured Data: Principles and Techniques","funder_award_id":"EP/J015377/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7108464112","display_name":null,"funder_award_id":"2014CB340302","funder_id":"https://openalex.org/F4320321540","funder_display_name":"Ministry of Science and Technology of the People's Republic of China"},{"id":"https://openalex.org/G8074621994","display_name":null,"funder_award_id":"61133002","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321540","display_name":"Ministry of Science and Technology of the People's Republic of China","ror":"https://ror.org/027s68j25"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1633968622","https://openalex.org/W1893161742","https://openalex.org/W1979331609","https://openalex.org/W1983604014","https://openalex.org/W1985644065","https://openalex.org/W1994727615","https://openalex.org/W1994924587","https://openalex.org/W2008896880","https://openalex.org/W2030178622","https://openalex.org/W2035601288","https://openalex.org/W2046915582","https://openalex.org/W2048653843","https://openalex.org/W2071989194","https://openalex.org/W2087303323","https://openalex.org/W2096544401","https://openalex.org/W2098636939","https://openalex.org/W2100132188","https://openalex.org/W2101654328","https://openalex.org/W2108781142","https://openalex.org/W2109974859","https://openalex.org/W2114678164","https://openalex.org/W2120063789","https://openalex.org/W2120857119","https://openalex.org/W2125580539","https://openalex.org/W2131692673","https://openalex.org/W2140840007","https://openalex.org/W2147405597","https://openalex.org/W2147952642","https://openalex.org/W2149568304","https://openalex.org/W2152651944","https://openalex.org/W2165607011","https://openalex.org/W2167927436","https://openalex.org/W2170616854","https://openalex.org/W2196666180","https://openalex.org/W2319502986","https://openalex.org/W2962740062","https://openalex.org/W6639711990","https://openalex.org/W6681894619","https://openalex.org/W6700009528"],"related_works":["https://openalex.org/W2127267268","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2156446763","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W4300463216","https://openalex.org/W2772294324","https://openalex.org/W4253760428","https://openalex.org/W2047831585"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,85,100,107,110,137,188,191],"problem":[4],"of":[5,36,38,109,116,120,139,190,202],"querying":[6],"graphs":[7],"within":[8],"bounded":[9],"resources.":[10],"Given":[11],"a":[12,15,19,33,70],"query":[13,67],"Q,":[14],"graph":[16],"G":[17,29,37,51,76],"and":[18,91,131,162,182,204],"small":[20,213],"ratio":[21],"\u03b1,":[22],"it":[23,148],"aims":[24],"to":[25,77,151],"answer":[26],"Q":[27],"in":[28],"by":[30,62],"accessing":[31],"only":[32],"fraction":[34],"GQ":[35,93],"size":[39],"|GQ|":[40],"\u2264":[41],"\u03b1":[42,167],"|G|.":[43],"The":[44,134],"need":[45],"for":[46,159,164,176,199,212],"this":[47],"is":[48,52,136,149],"evident":[49],"when":[50,81,166],"big":[53,75],"while":[54],"our":[55,205],"available":[56],"resources":[57],"are":[58,208],"limited,":[59],"as":[60,128],"indicated":[61],"\u03b1.":[63,214],"We":[64,79,145,193],"propose":[65],"resource-bounded":[66,153,174],"answering":[68,177],"via":[69],"dynamic":[71],"scheme":[72],"that":[73,123,147,195],"reduces":[74],"GQ.":[78],"investigate":[80],"we":[82,112,172,185],"can":[83],"find":[84,194],"exact":[86],"answers":[87,102,207],"Q(G)":[88],"from":[89],"GQ,":[90],"if":[92],"cannot":[94],"accommodate":[95],"enough":[96],"information,":[97],"how":[98],"accurate":[99],"approximate":[101,206],"Q(GQ)":[103],"are.":[104],"To":[105],"verify":[106],"effectiveness":[108],"approach,":[111],"study":[113],"two":[114],"types":[115,201],"queries.":[117,179],"One":[118],"consists":[119],"pattern":[121,160],"queries":[122],"have":[124],"data":[125,143],"locality,":[126],"such":[127],"subgraph":[129],"isomorphism":[130],"strong":[132],"simulation.":[133],"other":[135],"class":[138],"reachability":[140,165],"queries,":[141,161,203],"without":[142],"locality.":[144],"show":[146],"hard":[150],"get":[152],"algorithms":[154,175],"with":[155],"100%":[156,211],"accuracy:":[157],"NP-hard":[158],"non-existing":[163],"\u2260":[168],"1.":[169],"Despite":[170],"these,":[171],"develop":[173],"these":[178],"Using":[180],"real-life":[181],"synthetic":[183],"data,":[184],"experimentally":[186],"evaluate":[187],"performance":[189],"algorithms.":[192],"they":[196],"scale":[197],"well":[198],"both":[200],"accurate,":[209],"even":[210]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}