![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Demonstrations AJAX groups together matching pairs with a high similarity value by applying a given grouping criteria (e.g. by transitive closure). Finally, ging collapses each individual cluster into a tuple of the resulting data source. AJAX provides a declarative language for specifying data cleaning programs, which consists of SQL statements enriched with a set of specific primitives to express these transformations. AJAX also offers a GUI. It allows the user to interact with an executing data cleaning program to handle exceptional cases and to inspect intermediate results. Finally, AJAX provides a declarative language that permits users to determine the source and processing of data for debugging purposes. We will present the AJAX system applied to two real world problems: the consolidation of a telecommunication database, and the conversion of a dirty database of bibliographic references into a set of clean, normalized, and redundancy free relational tables maintaining the same data. Note: References link to DBLP on the Web.
@inproceedings{DBLP:conf/sigmod/Galhardas00, author = {Helena Galhardas and Daniela Florescu and Dennis Shasha and Eric Simon}, editor = {Weidong Chen and Jeffrey F. Naughton and Philip A. Bernstein}, title = {AJAX: An Extensible Data Cleaning Tool}, booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18, 2000, Dallas, Texas, USA}, journal = {SIGMOD Record}, publisher = {ACM}, volume = {29}, number = {2}, year = {2000}, isbn = {1-58113-218-2}, pages = {590}, crossref = {DBLP:conf/sigmod/2000}, bibsource = {DBLP, http://dblp.uni-trier.de} } }, DiSC'01 Copyright ©2002 ACM Inc. |