SPIDER: flexible matching in databases

Authors:
Nick Koudas;Amit Marathe;Divesh Srivastava
Affiliations:
University of Toronto;AT&T Labs-Research;AT&T Labs-Research
Venue:
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Year:
2005

Citing 5
Cited 1

Approximate String Joins in a Database (Almost) for Free

Proceedings of the 27th International Conference on Very Large Data Bases
Text joins in an RDBMS for web data integration

WWW '03 Proceedings of the 12th international conference on World Wide Web
Exploratory Data Mining and Data Cleaning

Exploratory Data Mining and Data Cleaning
Robust and efficient fuzzy match for online data cleaning

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
FASE: A Framework for Scalable Performance Prediction of HPC Systems and Applications

Simulation

Building Mashups by Demonstration

ACM Transactions on the Web (TWEB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a prototype system, SPIDER, developed at AT&T Labs-Research, which supports flexible string attribute value matching in large databases. We discuss the design principles on which SPIDER is based, describe the basic techniques encompassed by the tool and provide a description of the demo.