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)
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,899 | Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance | 2007 | VLDB | 7.97814e-05 |
| 4,035 | Selectivity Estimation for Fuzzy String Predicates in Large Data Sets | 2005 | VLDB | 6.9439151e-05 |
| 5,667 | Efficient Approximate Search on String Collections (Tutorial) | 2009 | VLDB | 6.1279762e-05 |
Previous
Page 1 / 1
Next
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.0020210012 |
| 56 | M-tree: An Efficient Access Method for Similarity Search in Metric Spaces | 1997 | VLDB | 0.00040719947 |
| 58 | The Merge/Purge Problem for Large Databases | 1995 | SIGMOD | 0.00040116748 |
| 94 | Potter's Wheel: An Interactive Data Cleaning System | 2001 | VLDB | 0.00034616103 |
| 107 | Approximate String Joins in a Database (Almost) for Free | 2001 | VLDB | 0.00033511706 |
| 158 | Robust and Efficient Fuzzy Match for Online Data Cleaning | 2003 | SIGMOD | 0.00028199923 |
| 306 | Eliminating Fuzzy Duplicates in Data Warehouses | 2002 | VLDB | 0.00021839661 |
| 2,648 | On Effective Multi-Dimensional Indexing for Strings | 2000 | SIGMOD | 8.2957097e-05 |
| 4,035 | Selectivity Estimation for Fuzzy String Predicates in Large Data Sets | 2005 | VLDB | 6.9439151e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,731 | Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints | 2010 | VLDB |
| 2 | 10,085 | Local Filtering: Improving the Performance of Approximate Queries on String Collections | 2015 | SIGMOD |
| 3 | 3,610 | Merging the Results of Approximate Match Operations | 2004 | VLDB |
| 4 | 4,776 | An Efficient Index Structure for String Databases | 2001 | VLDB |
| 5 | 3,193 | Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme | 2011 | SIGMOD |
| 6 | 2,036 | Bed-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance | 2010 | SIGMOD |
| 7 | 5,472 | Approximate Encoding for Direct Access and Query Processing over Compressed Bitmaps | 2006 | VLDB |
| 8 | 6,906 | Efficient Similarity Join and Search on Multi-Attribute Data | 2015 | SIGMOD |
| 9 | 107 | Approximate String Joins in a Database (Almost) for Free | 2001 | VLDB |
| 10 | 2,648 | On Effective Multi-Dimensional Indexing for Strings | 2000 | SIGMOD |