Database Paper Browser

Back to papers

Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files

Summary: In-memory lexicon search via compressed inverted files enables fast matching of partially specified terms. Memory-efficient inverted indices for main-memory databases deliver orders-of-magnitude speedups with less memory than pointer-heavy alternatives. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8135
Venue
VLDB
Year
1993
Pagerank
7.1506278e-05
Overall Rank
3,828 | 73.40%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
290 Proximity Search in Databases 1998 VLDB 0.00022397482
1,558 Efficient Processing of Joins on Set-valued Attributes 2003 SIGMOD 0.00010408688
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,554 An Efficient Indexing Technique for Full-Text Database Systems 1992 VLDB 0.0001042647
Previous Page 1 / 1 Next

Semantically Similar Papers