Indexing Mixed Types for Approximate Retrieval

Summary: Proposes indexing mixed string and numeric attributes for approximate multi-attribute retrieval, beyond B-trees. Uses compressed tries in a multidimensional index to support edit distance and numeric distance predicates, with compression and gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h9b3341a547f5a5e4
Venue: VLDB
Year: 2005
Pagerank: 5.3694945e-05
Overall Rank: 8,245 | 44.57%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Liang Jin (University of California Irvine)
2. Nick Koudas (University of Toronto)
3. Chen Li (University of California Irvine)
4. Anthony K. H. Tung (National University of Singapore)

BibTeX Citation

@article{jin_vldb05,
        title = {{Indexing Mixed Types for Approximate Retrieval}},
        author = {Jin, Liang and Koudas, Nick and Li, Chen and Tung, Anthony K. H.},
        journal = {PVLDB},
        series = {{VLDB} '05},
        pages = {793--804},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,967	Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance	2007	VLDB	7.8029216e-05
4,117	Selectivity Estimation for Fuzzy String Predicates in Large Data Sets	2005	VLDB	6.7958711e-05
5,795	Efficient Approximate Search on String Collections (Tutorial)	2009	VLDB	5.9926463e-05

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.001992968
56	M-tree: An Efficient Access Method for Similarity Search in Metric Spaces	1997	VLDB	0.00040370171
60	The Merge/Purge Problem for Large Databases	1995	SIGMOD	0.000394583
95	Potter's Wheel: An Interactive Data Cleaning System	2001	VLDB	0.00034382643
108	Approximate String Joins in a Database (Almost) for Free	2001	VLDB	0.0003305531
161	Robust and Efficient Fuzzy Match for Online Data Cleaning	2003	SIGMOD	0.00027718195
307	Eliminating Fuzzy Duplicates in Data Warehouses	2002	VLDB	0.00021499031
2,706	On Effective Multi-Dimensional Indexing for Strings	2000	SIGMOD	8.1111109e-05
4,117	Selectivity Estimation for Fuzzy String Predicates in Large Data Sets	2005	VLDB	6.7958711e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,110	Efficient and Tunable Similar Set Retrieval	2001	SIGMOD
2	3,593	Merging the Results of Approximate Match Operations	2004	VLDB
3	10,298	Local Filtering: Improving the Performance of Approximate Queries on String Collections	2015	SIGMOD
4	4,889	An Efficient Index Structure for String Databases	2001	VLDB
5	3,255	Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme	2011	SIGMOD
6	2,072	Bed-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance	2010	SIGMOD
7	5,600	Approximate Encoding for Direct Access and Query Processing over Compressed Bitmaps	2006	VLDB
8	7,030	Efficient Similarity Join and Search on Multi-Attribute Data	2015	SIGMOD
9	108	Approximate String Joins in a Database (Almost) for Free	2001	VLDB
10	2,706	On Effective Multi-Dimensional Indexing for Strings	2000	SIGMOD