{"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/to-index-or-not-to-index-optimizing-exact","title":"To Index or Not to Index: Optimizing Exact Maximum Inner Product Search","arxiv_id":"1706.01449","date":"2017-06-05","proceeding":null,"authors":["Firas Abuzaid","Geet Sethi","Peter Bailis","Matei Zaharia"],"abstract":"Exact Maximum Inner Product Search (MIPS) is an important task that is widely\npertinent to recommender systems and high-dimensional similarity search. The\nbrute-force approach to solving exact MIPS is computationally expensive, thus\nspurring recent development of novel indexes and pruning techniques for this\ntask. In this paper, we show that a hardware-efficient brute-force approach,\nblocked matrix multiply (BMM), can outperform the state-of-the-art MIPS solvers\nby over an order of magnitude, for some -- but not all -- inputs.\n  In this paper, we also present a novel MIPS solution, MAXIMUS, that takes\nadvantage of hardware efficiency and pruning of the search space. Like BMM,\nMAXIMUS is faster than other solvers by up to an order of magnitude, but again\nonly for some inputs. Since no single solution offers the best runtime\nperformance for all inputs, we introduce a new data-dependent optimizer,\nOPTIMUS, that selects online with minimal overhead the best MIPS solver for a\ngiven input. Together, OPTIMUS and MAXIMUS outperform state-of-the-art MIPS\nsolvers by 3.2$\\times$ on average, and up to 10.9$\\times$, on widely studied\nMIPS datasets.","url_abs":"http://arxiv.org/abs/1706.01449v3","url_pdf":"http://arxiv.org/pdf/1706.01449v3.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":"to-index-or-not-to-index-optimizing-exact","repo_url":"https://github.com/stanford-futuredata/optimus-maximus","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"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":"stanford-futuredata/optimus-maximus","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":"5b5fd028f688e267bdbd1ffea1b57bd82388b8443ad76f49c4d84fdf9b521e25","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}