https://dasya.itu.dk/tags/high-dimensional-indexing/ Recent content in high-dimensional indexing on DASYA Hugo -- gohugo.io en-us © DASYA, IT University of Copenhagen Tue, 14 Jan 2025 00:00:00 +0000 https://dasya.itu.dk/for-students/proposals/archive/osk-ecp-bench/ Tue, 14 Jan 2025 00:00:00 +0000 https://dasya.itu.dk/for-students/proposals/archive/osk-ecp-bench/ The extended Cluster Pruning (eCP) index, is a hierarchical approximate nearest neighbor index. eCP-FS is a “white-box” implementation of the index as a file structure using zarr. The index building is done through Python, while the index loading and search have been implemented in both pure Python and a Rust-Python package. While the index is slower from disk than other disk-based ANN solutions due to it not being stored as a single or few binary files but tons of smaller files, it allows more control over what is loaded, is easy to extend and when in-memory is on par with other memory based indexes. https://dasya.itu.dk/for-students/proposals/archive/dynamicecp/ Fri, 22 May 2020 00:00:00 +0000 https://dasya.itu.dk/for-students/proposals/archive/dynamicecp/ The index structure used for Exquisitor is eCP, a very scalable index for high-dimensional retrieval. While multimedia collections are typically constantly updated, however, the index is unfortunately static. The goal of this project is to implement and compare approaches for index maintenance. Read more…