{"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/reconfigurable-inverted-index","title":"Reconfigurable Inverted Index","arxiv_id":"1808.03969","date":"2018-08-12","proceeding":null,"authors":["Yusuke Matsui","Ryota Hinami","Shin'ichi Satoh"],"abstract":"Existing approximate nearest neighbor search systems suffer from two\nfundamental problems that are of practical importance but have not received\nsufficient attention from the research community. First, although existing\nsystems perform well for the whole database, it is difficult to run a search\nover a subset of the database. Second, there has been no discussion concerning\nthe performance decrement after many items have been newly added to a system.\nWe develop a reconfigurable inverted index (Rii) to resolve these two issues.\nBased on the standard IVFADC system, we design a data layout such that items\nare stored linearly. This enables us to efficiently run a subset search by\nswitching the search method to a linear PQ scan if the size of a subset is\nsmall. Owing to the linear layout, the data structure can be dynamically\nadjusted after new items are added, maintaining the fast speed of the system.\nExtensive comparisons show that Rii achieves a comparable performance with\nstate-of-the art systems such as Faiss.","url_abs":"http://arxiv.org/abs/1808.03969v1","url_pdf":"http://arxiv.org/pdf/1808.03969v1.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":"reconfigurable-inverted-index","repo_url":"https://github.com/matsui528/rii","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"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":"matsui528/rii","kind":"official","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":"07c684e587e2c94d7d6234fd1c2f119b3e66353285064c9e7b605a280f3d83e9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}