Results 241 to 250 of about 3,867,281 (278)
Some of the next articles are maybe not open access.
2013 IEEE International Conference on Computer Vision, 2013
Inverted indexing is a popular non-exhaustive solution to large scale search. An inverted file is built by a quantizer such as k-means or a tree structure. It has been found that multiple inverted files, obtained by multiple independent random quantizers, are able to achieve practically good recall and speed.
Yan Xia +3 more
openaire +1 more source
Inverted indexing is a popular non-exhaustive solution to large scale search. An inverted file is built by a quantizer such as k-means or a tree structure. It has been found that multiple inverted files, obtained by multiple independent random quantizers, are able to achieve practically good recall and speed.
Yan Xia +3 more
openaire +1 more source
On the Index of the Gradient of a Real Invertible Polynomial
Proceedings of the Steklov Institute of Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giorgadze, G., Khimshiashvili, G.
openaire +2 more sources
In-RDBMS inverted indexes revisited
2014 IEEE 30th International Conference on Data Engineering, 2014Every major open-source and commercial RDBMS offers some form of support for full-text search using inverted indexes. When providing this support, some developers have implemented specialized indexes that adapt techniques from the Information Retrieval (IR) community to work in a database setting, while others have opted to rely on the standard ...
Ian Rae +2 more
openaire +1 more source
Positional Inverted Self-index
2016 Data Compression Conference (DCC), 2016We address the problem of positional indexing in natural language domain. The positional inverted index contains the information of the word positions. Thus, it is able to recover the original textfile, which implies that it is not necessary to store the originalfile.
Petr Procházka, Jan Holub 0001
openaire +2 more sources
Efficient set intersection for inverted indexing
ACM Transactions on Information Systems, 2010Conjunctive Boolean queries are a key component of modern information retrieval systems, especially when Web-scale repositories are being searched. A conjunctive query q is equivalent to a | q |-way intersection over ordered sets of integers, where each set represents the documents containing
J. Shane Culpepper, Alistair Moffat
openaire +4 more sources
Optimization for dynamic inverted index maintenance
Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval, 1989For free-text search over rapidly evolving corpora, dynamic update of inverted indices is a basic requirement. B-trees are an effective tool in implementing such indices. The Zipfian distribution of postings suggests space and time optimizations unique to this task.
Douglas R. Cutting, Jan O. Pedersen 0001
openaire +1 more source
A prefix trie index for inverted files
Information Processing & Management, 1997A prefix trie index (originally called trie hashing) is applied to the problem of providing fast search times, fast load times and fast update properties in a bibliographic or full text retrieval system. For all but the largest dictionaries a single key search in the dictionary under trie hashing takes exactly one disk read. Front compression of search
openaire +1 more source
Enhanced FastPFOR for Inverted Index Compression
2014Information Retrieval System is facing enormous performance challenges due to the rapid growth of the size of the data in information retrieval applications and the increasing number of users for these applications. The performance of IRS has been improved by compressing inverted index, which is commonly used data structure for indexing in IRS ...
S. Domnic, V. Glory
openaire +1 more source
Inverted Indexing on Edge-Notched Cards
Science, 1963Edge-notched cards in an inverted system of indexing may be used satisfactorily to analyze research data which concern a small series of individuals but a large number of highly variable characteristics in a short-term research project.
openaire +2 more sources
Efficient Grammar Generation for Inverted Indexes
2018Inverted indexes are commonly utilized in large-scale search engines to store lists of document identifies (docIDs) relevant to query terms, which are queried maybe thousands of times per second. Traditionally, optimized integer sequence encoding methods are applied to compress the inverted index while simultaneously maintaining reasonable query ...
Yan Fan +5 more
openaire +1 more source