DBScholar

Back to papers

SPIDER: Flexible Matching in Databases

Summary: SPIDER is a prototype for flexible string attribute value matching at scale in large databases. It outlines the guiding design principles, introduces the basic techniques embedded in the tool, and provides a description of the demo. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3766
Venue
SIGMOD
Year
2005
Pagerank
5.093636e-05
Overall Rank
12,737 | 12.62%
DOI
10.1145/1066157.1066272

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{koudas_sigmod05,
        title = {{SPIDER: Flexible Matching in Databases}},
        author = {Koudas, Nick and Marathe, Amit and Srivastava, Divesh},
        series = {{SIGMOD} '05},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1066157.1066272},
        url = {https://dl.acm.org/doi/10.1145/1066157.1066272},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
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
4,009 Flexible String Matching Against Large Databases in Practice 2004 VLDB 6.9612537e-05
Previous Page 1 / 1 Next

Semantically Similar Papers