Hierarchically Labeled Database Indexing Allows Scalable Characterization of Microbiomes
نویسندگان
چکیده
منابع مشابه
Individual Study Option: Scalable Multimedia Database Indexing
Most image or video search engines operate similarity search by extracting and storing feature vectors from the multimedia objects. Thus, the similarity search is transformed into a search of points in the feature space that are close to a given query point in the high dimensional feature space. Multidimensional indexing structures are supposed to cut this process short and quickly return the m...
متن کاملScalable Image Annotation by Summarizing Training Samples into Labeled Prototypes
By increasing the number of images, it is essential to provide fast search methods and intelligent filtering of images. To handle images in large datasets, some relevant tags are assigned to each image to for describing its content. Automatic Image Annotation (AIA) aims to automatically assign a group of keywords to an image based on visual content of the image. AIA frameworks have two main sta...
متن کاملHippo: A Fast, yet Scalable, Database Indexing Approach
Even though existing database indexes (e.g., B-Tree) speed up the query execution, they suffer from two main drawbacks: (1) A database index usually yields 5% to 15% additional storage overhead which results in non-ignorable dollar cost in big data scenarios especially when deployed on modern storage devices like Solid State Disk (SSD) or NonVolatile Memory (NVM). (2) Maintaining a database ind...
متن کاملHierarchically Compositional Kernels for Scalable Nonparametric Learning
We propose a novel class of kernels to alleviate the high computational cost of large-scale nonparametric learning with kernel methods. The proposed kernel is defined based on a hierarchical partitioning of the underlying data domain, where the Nyström method (a globally low-rank approximation) is married with a locally lossless approximation in a hierarchical fashion. The kernel maintains (str...
متن کاملEfficient Scalable Algorithms for Hierarchically Semiseparable Matrices
Hierarchically semiseparable (HSS) matrix algorithms are emerging techniques in constructing the superfast direct solvers for both dense and sparse linear systems. Here, we develope a set of novel parallel algorithms for the key HSS operations that are used for solving large linear systems. These include the parallel rank-revealing QR factorization, the HSS constructions with hierarchical compr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: iScience
سال: 2020
ISSN: 2589-0042
DOI: 10.1016/j.isci.2020.100988