{"id":"https://openalex.org/W2097111141","doi":"https://doi.org/10.1145/1989323.1989419","title":"A memory efficient reachability data structure through bit vector compression","display_name":"A memory efficient reachability data structure through bit vector compression","publication_year":2011,"publication_date":"2011-06-12","ids":{"openalex":"https://openalex.org/W2097111141","doi":"https://doi.org/10.1145/1989323.1989419","mag":"2097111141"},"language":"en","primary_location":{"id":"doi:10.1145/1989323.1989419","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989323.1989419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 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://zenodo.org/record/3438385","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020764474","display_name":"Sebastiaan J. van Schaik","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Sebastiaan J. van Schaik","raw_affiliation_strings":["University of Oxford & Utrecht University, Oxford, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Oxford & Utrecht University, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071726140","display_name":"Oege de Moor","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Oege de Moor","raw_affiliation_strings":["University of Oxford, Oxford, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020764474"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":12.3997,"has_fulltext":false,"cited_by_count":117,"citation_normalized_percentile":{"value":0.98693261,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"913","last_page":"924"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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/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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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/transitive-closure","display_name":"Transitive closure","score":0.9234793782234192},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8151887059211731},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7024194002151489},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6455961465835571},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5712719559669495},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5521175861358643},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.47384101152420044},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44959843158721924},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.434966117143631},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41528066992759705},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.41512760519981384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24275043606758118},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21913591027259827},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11984965205192566}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.9234793782234192},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8151887059211731},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7024194002151489},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6455961465835571},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5712719559669495},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5521175861358643},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.47384101152420044},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44959843158721924},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.434966117143631},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41528066992759705},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.41512760519981384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24275043606758118},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21913591027259827},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11984965205192566},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1989323.1989419","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989323.1989419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:oai:zenodo.org:3438385","is_oa":true,"landing_page_url":"https://zenodo.org/record/3438385","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:3438385","is_oa":true,"landing_page_url":"https://zenodo.org/record/3438385","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"","raw_type":"info:eu-repo/semantics/conferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W33760710","https://openalex.org/W198808598","https://openalex.org/W1529265758","https://openalex.org/W1539849472","https://openalex.org/W1549076666","https://openalex.org/W1576925855","https://openalex.org/W1965253335","https://openalex.org/W1968895412","https://openalex.org/W2003421875","https://openalex.org/W2005419964","https://openalex.org/W2007572995","https://openalex.org/W2008080405","https://openalex.org/W2043655327","https://openalex.org/W2054100908","https://openalex.org/W2070992781","https://openalex.org/W2080573945","https://openalex.org/W2092251403","https://openalex.org/W2099624270","https://openalex.org/W2104734478","https://openalex.org/W2118382442","https://openalex.org/W2342403919","https://openalex.org/W4235794864","https://openalex.org/W6608158243","https://openalex.org/W6649045865"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2371151875","https://openalex.org/W2136009070","https://openalex.org/W2362009423","https://openalex.org/W2391133415","https://openalex.org/W2012063573","https://openalex.org/W1982015164","https://openalex.org/W203725150","https://openalex.org/W4230967508","https://openalex.org/W1499233953"],"abstract_inverted_index":{"When":[0],"answering":[1],"many":[2],"reachability":[3],"queries":[4],"on":[5,28,55],"a":[6,51,56,106],"large":[7],"graph,":[8],"the":[9,15,19,66,71,82,101,132],"principal":[10],"challenge":[11],"is":[12,65,124],"to":[13,34,77,90,105],"represent":[14],"transitive":[16,30,72],"closure":[17],"of":[18,59,85],"graph":[20],"compactly,":[21],"while":[22],"still":[23],"allowing":[24],"fast":[25],"membership":[26],"tests":[27],"that":[29,68,100,131],"closure.":[31],"Recent":[32],"attempts":[33],"address":[35],"this":[36,123],"problem":[37],"are":[38],"complex":[39],"data":[40,109],"structures":[41],"and":[42,47,120],"algorithms":[43],"such":[44],"as":[45],"Path-Tree":[46],"3-HOP.":[48],"We":[49,80,98,128],"propose":[50],"simple":[52],"alternative":[53,141],"based":[54],"novel":[57],"form":[58],"bit-vector":[60],"compression.":[61],"Our":[62],"starting":[63],"point":[64],"observation":[67],"when":[69],"computing":[70],"closure,":[73],"reachable":[74],"vertices":[75],"tend":[76],"cluster":[78],"together.":[79],"adapt":[81],"well-known":[83],"scheme":[84,103],"word-aligned":[86],"hybrid":[87],"compression":[88],"(WAH)":[89],"work":[91],"more":[92,107],"efficiently":[93],"by":[94],"introducing":[95],"word":[96],"partitions.":[97],"prove":[99],"resulting":[102],"leads":[104],"compact":[108],"structure":[110],"than":[111,140],"its":[112],"closest":[113],"competitor,":[114],"namely":[115],"interval":[116],"lists.":[117],"In":[118],"extensive":[119],"detailed":[121],"experiments,":[122],"confirmed":[125],"in":[126],"practice.":[127],"also":[129],"demonstrate":[130],"new":[133],"technique":[134],"can":[135],"handle":[136],"much":[137],"larger":[138],"graphs":[139],"algorithms.":[142]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":19},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}