{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/vectorized-vbyte-decoding","title":"Vectorized VByte Decoding","arxiv_id":"1503.07387","date":"2015-02-20","proceeding":null,"authors":["Jeff Plaisance","Nathan Kurz","Daniel Lemire"],"abstract":"We consider the ubiquitous technique of VByte compression, which represents\neach integer as a variable length sequence of bytes. The low 7 bits of each\nbyte encode a portion of the integer, and the high bit of each byte is reserved\nas a continuation flag. This flag is set to 1 for all bytes except the last,\nand the decoding of each integer is complete when a byte with a high bit of 0\nis encountered. VByte decoding can be a performance bottleneck especially when\nthe unpredictable lengths of the encoded integers cause frequent branch\nmispredictions. Previous attempts to accelerate VByte decoding using SIMD\nvector instructions have been disappointing, prodding search engines such as\nGoogle to use more complicated but faster-to-decode formats for\nperformance-critical code. Our decoder (Masked VByte) is 2 to 4 times faster\nthan a conventional scalar VByte decoder, making the format once again\ncompetitive with regard to speed.","url_abs":"http://arxiv.org/abs/1503.07387v4","url_pdf":"http://arxiv.org/pdf/1503.07387v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"vectorized-vbyte-decoding","repo_url":"https://github.com/lemire/MaskedVByte","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"vectorized-vbyte-decoding","repo_url":"https://github.com/as-com/varint-simd","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"lemire/MaskedVByte","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"as-com/varint-simd","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d2f907df87e393d003b5a06106e13c49a62f07cf0ad0ce062e40fd80f23033d3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}