{"id":"https://openalex.org/W2116233288","doi":"https://doi.org/10.1145/2588555.2610524","title":"Answering top-k representative queries on graph databases","display_name":"Answering top-k representative queries on graph databases","publication_year":2014,"publication_date":"2014-06-18","ids":{"openalex":"https://openalex.org/W2116233288","doi":"https://doi.org/10.1145/2588555.2610524","mag":"2116233288"},"language":"en","primary_location":{"id":"doi:10.1145/2588555.2610524","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2588555.2610524","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":"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/A5054697900","display_name":"Sayan Ranu","orcid":"https://orcid.org/0000-0003-4147-9372"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sayan Ranu","raw_affiliation_strings":["IIT Madras, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017076828","display_name":"Minh Hoang","orcid":null},"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":"Minh Hoang","raw_affiliation_strings":["University of California, Santa Barbara, Santa Barbara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036639779","display_name":"Ambuj K. Singh","orcid":"https://orcid.org/0000-0002-1997-7140"},"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":"Ambuj Singh","raw_affiliation_strings":["University of California, Santa Barbara, Santa Barbara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1163","last_page":"1174"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9994000196456909,"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.9988999962806702,"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/computer-science","display_name":"Computer science","score":0.7217075824737549},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.5245592594146729},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.502387523651123},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4631234109401703},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46084997057914734},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.45020121335983276},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4391208291053772},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4275393486022949},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.40585848689079285},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3584100604057312},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24056145548820496},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16888770461082458}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7217075824737549},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.5245592594146729},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.502387523651123},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4631234109401703},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46084997057914734},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.45020121335983276},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4391208291053772},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4275393486022949},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.40585848689079285},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3584100604057312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24056145548820496},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16888770461082458}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2588555.2610524","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2588555.2610524","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5527019630","display_name":null,"funder_award_id":"PO 55022251","funder_id":"https://openalex.org/F4320309327","funder_display_name":"Google"},{"id":"https://openalex.org/G7598485542","display_name":null,"funder_award_id":"IIS-1219254","funder_id":"https://openalex.org/F4320337389","funder_display_name":"Division of Information and Intelligent Systems"}],"funders":[{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320337389","display_name":"Division of Information and Intelligent Systems","ror":"https://ror.org/053a2cp42"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W182666420","https://openalex.org/W299839057","https://openalex.org/W1680189815","https://openalex.org/W1973504736","https://openalex.org/W1975917757","https://openalex.org/W1993320088","https://openalex.org/W1995913408","https://openalex.org/W1996760769","https://openalex.org/W1999101712","https://openalex.org/W2002379171","https://openalex.org/W2019465190","https://openalex.org/W2019720355","https://openalex.org/W2032338144","https://openalex.org/W2033201131","https://openalex.org/W2063491776","https://openalex.org/W2073595285","https://openalex.org/W2100357571","https://openalex.org/W2102913801","https://openalex.org/W2111607365","https://openalex.org/W2115119998","https://openalex.org/W2116434582","https://openalex.org/W2123781167","https://openalex.org/W2125571188","https://openalex.org/W2142965177","https://openalex.org/W2143085379","https://openalex.org/W2143446557","https://openalex.org/W2143996311","https://openalex.org/W2157044362","https://openalex.org/W2161547991","https://openalex.org/W2166224193"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W2163115662","https://openalex.org/W189401716","https://openalex.org/W2898570308","https://openalex.org/W2019216770","https://openalex.org/W2574250816","https://openalex.org/W2544904580"],"abstract_inverted_index":{"Given":[0],"a":[1,5,45,48,72,119,134,171],"function":[2],"that":[3,20,133,195],"classifies":[4],"data":[6],"object":[7],"as":[8],"relevant":[9,24,42],"or":[10],"irrelevant,":[11],"we":[12,57,117,154],"consider":[13],"the":[14,27,41,59,79,82,93,105,126,129,146,151,163,166,187,192],"task":[15],"of":[16,51,61,75,84,96,128,150,165,174,191,201],"selecting":[17],"k":[18,52],"objects":[19,25,43],"best":[21],"represent":[22],"all":[23],"in":[26,44,81,140],"underlying":[28],"database.":[29],"This":[30],"problem":[31,60,80],"occurs":[32],"naturally":[33],"when":[34],"analysts":[35],"want":[36],"to":[37,92,104,161,198],"familiarize":[38],"themselves":[39],"with":[40,88,122],"database":[46,167],"using":[47],"small":[49],"set":[50],"exemplars.":[53],"In":[54],"this":[55],"paper,":[56],"solve":[58],"top-k":[62,100],"representative":[63,101],"queries":[64,102],"on":[65,125,182],"graph":[66,69,184],"databases.":[67],"While":[68],"databases":[70],"model":[71],"wide":[73],"range":[74],"scientific":[76],"data,":[77],"solving":[78],"context":[83],"graphs":[85,168],"presents":[86],"us":[87],"unique":[89],"challenges":[90],"due":[91],"inherent":[94],"complexity":[95],"matching":[97],"structures.":[98],"Furthermore,":[99],"map":[103],"classic":[106],"Set":[107],"Cover":[108],"problem,":[109],"making":[110],"it":[111],"NP-hard.":[112],"To":[113,143],"overcome":[114],"these":[115],"challenges,":[116],"develop":[118],"greedy":[120,152],"approximation":[121,136],"theoretical":[123],"guarantees":[124],"quality":[127],"answer":[130],"set,":[131],"noting":[132],"better":[135],"is":[137],"not":[138],"feasible":[139],"polynomial":[141],"time.":[142],"further":[144],"optimize":[145],"quadratic":[147],"computational":[148],"cost":[149],"algorithm,":[153],"propose":[155],"an":[156],"index":[157,162],"structure":[158],"called":[159],"NB-Index":[160],"\\theta-neighborhoods":[164],"by":[169],"employing":[170],"novel":[172],"combination":[173],"Lipschitz":[175],"embedding":[176],"and":[177,189],"agglomerative":[178],"clustering.":[179],"Extensive":[180],"experiments":[181],"real":[183],"datasets":[185],"validate":[186],"efficiency":[188],"effectiveness":[190],"proposed":[193],"techniques":[194],"achieve":[196],"up":[197],"two":[199],"orders":[200],"magnitude":[202],"speed-up":[203],"over":[204],"state-of-the-art":[205],"algorithms.":[206]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}