Inverted index

Known as: Inverted files, Inverse index, Inverted file 
In computer science, an inverted index (also referred to as postings file or inverted file) is an index data structure storing a mapping from content… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1961-2018
05010019612018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
A new data structure for efficient similarity search in very large dataseis of high-dimensional vectors is introduced. This… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2010
2010
To perform fast image matching against large databases, a Vocabulary Tree (VT) uses an inverted index that maps from each tree… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Web search engines use highly optimized compression schemes to decrease inverted index size and improve query throughput, and… (More)
  • figure 6
Is this relevant?
2007
2007
Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
The majority of today’s IR systems base the IR task on two main processes: indexing and searching. There exists a special group… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We examine index representation techniques for document-based inverted files, and present a mechanism for compressing them using… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Several methods have been proposed to evaluate queries over a native XML DBMS, where the queries specify both path and keyword… (More)
  • figure 1
  • figure 7
  • table 1
  • table 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Two well-known indexing methods are inverted files and signature files. We have undertaken a detailed comparison of these two… (More)
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Query-processing costs on large text databases are dominated by the need to retrieve and scan the inverted list of each query… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1989
Highly Cited
1989
For free-text search over rapidly evolving corpora, dynamic update of inverted indices is a basic requirement. B-trees are an… (More)
Is this relevant?