{"id":"https://openalex.org/W1968895412","doi":"https://doi.org/10.1145/1559845.1559930","title":"3-HOP","display_name":"3-HOP","publication_year":2009,"publication_date":"2009-06-29","ids":{"openalex":"https://openalex.org/W1968895412","doi":"https://doi.org/10.1145/1559845.1559930","mag":"1968895412"},"language":"en","primary_location":{"id":"doi:10.1145/1559845.1559930","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559845.1559930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of data","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/A5103270436","display_name":"Ruoming Jin","orcid":"https://orcid.org/0000-0003-1895-4243"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ruoming Jin","raw_affiliation_strings":["Kent State University, Kent, OH, USA"],"affiliations":[{"raw_affiliation_string":"Kent State University, Kent, OH, USA","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100666554","display_name":"Yang Xiang","orcid":"https://orcid.org/0000-0001-5252-0831"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Xiang","raw_affiliation_strings":["Kent State University, Kent, OH, USA"],"affiliations":[{"raw_affiliation_string":"Kent State University, Kent, OH, USA","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063179211","display_name":"Ning Ruan","orcid":"https://orcid.org/0000-0001-8285-9430"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ning Ruan","raw_affiliation_strings":["Kent State University, Kent, OH, USA"],"affiliations":[{"raw_affiliation_string":"Kent State University, Kent, OH, USA","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050281959","display_name":"David Fuhry","orcid":"https://orcid.org/0000-0002-9573-1169"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Fuhry","raw_affiliation_strings":["Kent State University, Kent, OH, USA"],"affiliations":[{"raw_affiliation_string":"Kent State University, Kent, OH, USA","institution_ids":["https://openalex.org/I149910238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103270436"],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":null,"apc_paid":null,"fwci":21.8304,"has_fulltext":false,"cited_by_count":212,"citation_normalized_percentile":{"value":0.99800253,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"813","last_page":"826"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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.998199999332428,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8400284647941589},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.8335431814193726},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.7305987477302551},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.585945188999176},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5756821036338806},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.5420923233032227},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.5137454271316528},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42570456862449646},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.41000354290008545},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3885301351547241},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37888991832733154},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3513341248035431},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33544906973838806},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18434038758277893},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07008084654808044}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8400284647941589},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.8335431814193726},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7305987477302551},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.585945188999176},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5756821036338806},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.5420923233032227},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.5137454271316528},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42570456862449646},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.41000354290008545},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3885301351547241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37888991832733154},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3513341248035431},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33544906973838806},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18434038758277893},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07008084654808044},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1559845.1559930","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559845.1559930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:vital:7447","is_oa":false,"landing_page_url":"http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/75947","pdf_url":null,"source":{"id":"https://openalex.org/S4306400234","display_name":"FedUni ResearchOnline (Federation University Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210158496","host_organization_name":"Australian Federation of University Women \u2013 South Australia","host_organization_lineage":["https://openalex.org/I4210158496"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1502577746","https://openalex.org/W1553945535","https://openalex.org/W1631963815","https://openalex.org/W1690273063","https://openalex.org/W1965109038","https://openalex.org/W2013469283","https://openalex.org/W2017139167","https://openalex.org/W2043655327","https://openalex.org/W2054100908","https://openalex.org/W2076109400","https://openalex.org/W2086729610","https://openalex.org/W2092251403","https://openalex.org/W2102563702","https://openalex.org/W2102913801","https://openalex.org/W2111667217","https://openalex.org/W2114507260","https://openalex.org/W2125580539","https://openalex.org/W2141938776","https://openalex.org/W2157054705","https://openalex.org/W4235794864","https://openalex.org/W4242246215","https://openalex.org/W6649045865"],"related_works":["https://openalex.org/W2075704325","https://openalex.org/W1553139688","https://openalex.org/W1503149859","https://openalex.org/W2008080405","https://openalex.org/W4366828350","https://openalex.org/W2963892764","https://openalex.org/W1578808377","https://openalex.org/W2798731600","https://openalex.org/W4247505235","https://openalex.org/W1690273063"],"abstract_inverted_index":{"Reachability":[0],"queries":[1],"on":[2],"large":[3],"directed":[4,90],"graphs":[5,91],"have":[6],"attracted":[7],"much":[8,164],"attention":[9],"recently.":[10],"The":[11,95],"existing":[12],"work":[13,43],"either":[14],"uses":[15],"spanning":[16],"structures,":[17],"such":[18,173],"as":[19,55,174],"chains":[20],"or":[21,29],"trees,":[22],"to":[23,34,63,102,110,124,144,190,195],"compress":[24],"the":[25,31,36,50,56,59,64,69,72,112,199],"complete":[26],"transitive":[27,74,147],"closure,":[28],"utilizes":[30],"2-hop":[32,175],"strategy":[33],"describe":[35],"reachability.":[37],"Almost":[38],"all":[39],"of":[40,58,61,66,71,98,114,198],"these":[41],"approaches":[42],"well":[44],"for":[45,89],"very":[46,77,182],"sparse":[47],"graphs.":[48],"However,":[49],"challenging":[51],"problem":[52],"is":[53,101,123,188,193],"that":[54,116,159],"ratio":[57],"number":[60,65,113],"edges":[62],"vertices":[67],"increases,":[68],"size":[70,167],"compressed":[73],"closure":[75,148],"grows":[76],"large.":[78],"In":[79],"this":[80],"paper,":[81],"we":[82],"propose":[83],"a":[84,126,146],"new":[85],"3-hop":[86,99,127,161],"indexing":[87,100],"scheme":[88,128,162],"with":[92,108,135],"higher":[93],"density.":[94],"basic":[96],"idea":[97],"use":[103],"chain":[104],"structures":[105,115],"in":[106],"combination":[107],"hops":[109],"minimize":[111],"must":[117],"be":[118,196],"indexed.":[119],"Technically,":[120],"our":[121,160,185],"goal":[122],"find":[125],"over":[129],"dense":[130],"DAGs":[131,179],"(directed":[132],"acyclic":[133],"graphs)":[134],"minimum":[136],"index":[137,154,166],"size.":[138,155],"We":[139],"develop":[140],"an":[141],"efficient":[142],"algorithm":[143],"discover":[145],"contour,":[149],"which":[150,192],"yields":[151],"near":[152],"optimal":[153],"Empirical":[156],"studies":[157],"show":[158],"has":[163],"smaller":[165],"than":[168],"state-of-the-art":[169],"reachability":[170,201],"query":[171,186,202],"schemes":[172],"and":[176],"path-tree":[177],"when":[178],"are":[180],"not":[181],"sparse,":[183],"while":[184],"time":[187],"close":[189],"path-tree,":[191],"considered":[194],"one":[197],"best":[200],"schemes.":[203]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":20},{"year":2012,"cited_by_count":21}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}