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: 8325
Venue: VLDB
Year: 1993
Pagerank: 7.0403273e-05
Overall Rank: 3,897 | 73.27%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Justin Zobel (Collaborative Information Technology Research Institute; Royal Melbourne Institute of Technology)
2. Alistair Moffat (University of Melbourne)
3. Ron Sacks-Davis (Collaborative Information Technology Research Institute)

BibTeX Citation

@article{zobel_vldb93,
        title = {{Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files}},
        author = {Zobel, Justin and Moffat, Alistair and Sacks-Davis, Ron},
        journal = {PVLDB},
        series = {{VLDB} '93},
        pages = {290--301},
        year = {1993}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
301	Proximity Search in Databases	1998	VLDB	0.00022032878
1,592	Efficient Processing of Joins on Set-valued Attributes	2003	SIGMOD	0.00010253457

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,587	An Efficient Indexing Technique for Full-Text Database Systems	1992	VLDB	0.00010269584

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	6,973	Relative Lempel-Ziv Factorization for Efficient Storage and Retrieval of Web Collections	2012	VLDB
2	925	Dictionary-based Order-preserving String Compression for Main Memory Column Stores	2009	SIGMOD
3	1,407	Fast Incremental Indexing for Full-Text Information Retrieval	1994	VLDB
4	2,519	Similarity search in the blink of an eye with compressed indices	2023	VLDB
5	8,810	Dynamic Data Structures for Document Collections and Graphs	2015	PODS
6	6,818	Space-efficient Substring Occurrence Estimation	2011	PODS
7	3,949	A New Compression Method with Fast Searching on Large Databases	1987	VLDB
8	9,861	Text Indexing for Long Patterns: Anchors are All you Need	2023	VLDB
9	9,635	Memory-Efficient Search Trees for Database Management Systems	2021	SIGMOD
10	1,587	An Efficient Indexing Technique for Full-Text Database Systems	1992	VLDB