DBScholar

Back to papers

Incremental Maintenance of Length Normalized Indexes for Approximate String Matching

Summary: Lazy-update framework for length-normalized indexes in approximate string matching enables incremental updates rather than periodic rebuilds. Guarantees: no false negatives, bounded false positives; prototype demonstrates practicality on real data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4199
Venue
SIGMOD
Year
2009
Pagerank
6.7451753e-05
Overall Rank
4,359 | 70.10%
DOI
10.1145/1559845.1559891

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{hadjieleftheriou_sigmod09,
        title = {{Incremental Maintenance of Length Normalized Indexes for Approximate String Matching}},
        author = {Hadjieleftheriou, Marios and Koudas, Nick and Srivastava, Divesh},
        series = {{SIGMOD} '09},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1559845.1559891},
        url = {https://dl.acm.org/doi/10.1145/1559845.1559891},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers