The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Integration of heterogeneous databases without common domains using queries based on textual similarity
Abstract
Most databases contain “name constants” like course numbers, personal names, and place names that correspond to entities in the real world. Previous work in integration of heterogeneous databases has assumed that local name constants can be mapped into an appropriate global domain by normalization. However, in many cases, this assumption does not hold; determining if two name constants should be considered identical can require detailed knowledge of the world, the purpose of the user's query, or both. In this paper, we reject the assumption that global domains can be easily constructed, and assume instead that the names are given in natural language text. We then propose a logic called WHIRL which reasons explicitly about the similarity of local names, as measured using the vector-space model commonly adopted in statistical information retrieval. We describe an efficient implementation of WHIRL and evaluate it experimentally on data extracted from the World Wide Web. We show that WHIRL is much faster than naive inference methods, even for short queries. We also show that inferences made by WHIRL are surprisingly accurate, equaling the accuracy of hand-coded normalization routines on one benchmark problem, and outperforming exact matching with a plausible global domain on a second.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
Odeh, R. E., & Knuth, D. E. (1969) · Journal of the American Statistical Association · doi:10.2307/2283757 · Cited by 2,525
Fellegi, I. P., & Sunter, A. B. (1969) · Journal of the American Statistical Association · doi:10.1080/01621459.1969.10501049 · Cited by 2,475
Learning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644
Salton, G. (1988) · Cited by 1,587
Proceedings of the Second International Conference on Knowledge Discovery and Data Mining
Simoudis, E., Han, J., & Fayyad, U. M. (1996) · Cited by 1,121
Querying Heterogeneous Information Sources Using Source Descriptions
Levy, A. Y., Rajaraman, A., & Ordille, J. J. (1996) · Very Large Data Bases · Cited by 1,091
The merge/purge problem for large databases
Hernández, M. A., & Stolfo, S. J. (1995) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/223784.223807 · Cited by 809
Cited by
A survey of approaches to automatic schema matching
Rahm, E., & Bernstein, P. A. (2001) · The VLDB Journal · doi:10.1007/s007780100057 · Cited by 3,352
Data integration: a theoretical perspective
Lenzerini, M. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543644 · Cited by 2,494
(2000) · Cited by 1,467
Similarity flooding: a versatile graph matching algorithm and its application to schema matching
Melnik, S., Garcia-Molina, H., & Rahm, E. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994702 · Cited by 1,341
Duplicate Record Detection: A Survey
Elmagarmid, A. K., Ipeirotis, P. G., & Verykios, V. S. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.250581 · Cited by 1,267
Snowball: extracting relations from large plain-text collections
Agichtein, E., & Gravano, L. (2000) · Proceedings of the fifth ACM conference on Digital libraries · doi:10.1145/336597.336644 · Cited by 1,147
Efficient query evaluation on probabilistic databases
Dalvi, N., & Suciu, D. (2007) · The VLDB Journal · doi:10.1007/s00778-006-0004-3 · Cited by 962
A Survey of Indexing Techniques for Scalable Record Linkage and Deduplication
Christen, P. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.127 · Cited by 679
Wrapper induction: Efficiency and expressiveness
Kushmerick, N. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00100-9 · Cited by 553
Adaptive name matching in information integration
Bilenko, M., Mooney, R., Cohen, W., Ravikumar, P., & Fienberg, S. (2003) · IEEE Intelligent Systems · doi:10.1109/mis.2003.1234765 · Cited by 469
Self-citationRobust and efficient fuzzy match for online data cleaning
Chaudhuri, S., Ganjam, K., Ganti, V., & Motwani, R. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872796 · Cited by 457
Semantic-integration research in the database community: A brief survey
Doan, A., & Halevy, A. Y. (2005) · doi:10.1609/aimag.v26i1.1801 · Cited by 421
Efficient exact set-similarity joins
Arasu, A., Ganti, V., & Kaushik, R. (2006) · doi:10.5555/1182635.1164206 · Cited by 406
Eliminating Fuzzy Duplicates in Data Warehouses
Ananthakrishna, R., Chaudhuri, S., & Ganti, V. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50058-5 · Cited by 387
Statistical schema matching across web query interfaces
He, B., & Chang, K. C.-C. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872784 · Cited by 320
Learning object identification rules for information integration
Tejada, S., Knoblock, C. A., & Minton, S. (2001) · Information Systems · doi:10.1016/s0306-4379(01)00042-4 · Cited by 310
Record linkage: similarity measures and algorithms
Koudas, N., Sarawagi, S., & Srivastava, D. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142599 · Cited by 289
Similarity encoding for learning with dirty categorical variables
Cerda, P., Varoquaux, G., & Kégl, B. (2018) · Machine Learning · doi:10.1007/s10994-018-5724-2 · Cited by 267
Hybrid entity clustering using crowds and data
Lee, J., Cho, H., Park, J.-W., Cha, Y.-R., Hwang, S.-W., Nie, Z., & Wen, J.-R. (2013) · The VLDB Journal · doi:10.1007/s00778-013-0328-8 · Cited by 15
Metadata
- Authors
- Cohen, W. W.
- Venue
- Proceedings of the 1998 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 1998-06
- Pages
- 201-212
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2038281398
- Cited by
- 379
- References
- 26
- FWCI
- 59.38
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.