Large-scale image retrieval has been shown remarkable potential in real-life applications. The standard approach is based on Inverted Indexing, given images are represented using Bag-of-Words model. However, one major limitation of both Inverted Index and Bag-of-Words presentation is that they ignore spatial information of visual words in image presentation and comparison. As a result, retrieva...

Existing file searching tools do not have the performance or accuracy that search engines have. This is especially a problem in large-scale distributed file systems, where better-performing file searching tools are much needed for enterprise-level systems. Search engines use inverted indices to store terms and other metadata. Although some desktop file searching tools use indices to store file ...

A typical scenario in information retrieval and web search is to index a given type of items (e.g., web pages, images) and provide search functionality for them. In such a scenario, the basic units of indexing and retrieval are the same. Extensive study has been done for efficient top-k computation in such settings. This paper studies top-k processing for many emerging scenarios: efficiently re...

invert sugar is the result of sucrose of hydrolysis of sucrose by acid or enzyme, that is, the splitting of sucrose molecules into their glucose and fructose components.invert sugar is used in different industries such as; food industry, soft drinks and pharmaceutical, due to its special characteristics such as; sweetness level, moisture ability’s property, crystallization level and special tas...

Boolean search is the most common information retrieval technique that requires users to input the exact words they are looking for into a text field. Existing algorithms use inverted list indexing schemes to answer boolean search queries. These approaches occupy large index size as the inverted lists are highly overlapping and redundant. In this paper, we propose a novel approach that reduces ...

In this paper we look at a combination of bulk-compression, partial query processing and skipping for document-ordered inverted indexes. We propose a new inverted index organization, and provide an updated version of the MaxScore method by Turtle and Flood and a skipping-adapted version of the space-limited adaptive pruning method by Lester et al. Both our methods significantly reduce the numbe...

The increase in the amounts of information used to analyze data is problematic since memory necessary store and process it getting quite big. interval inverted index representation was developed reduce required data, Frag-Cubing one most popular algorithms. In this paper, we propose two new cubing algorithms: 3iCubing M3iCubing. a Frag-Cubing-based algorithm that uses representation, while M3iC...