The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Similarity flooding: a versatile graph matching algorithm and its application to schema matching
Abstract
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs (schemas, catalogs, or other data structures) as input, and produces as output a mapping between corresponding nodes of the graphs. Depending on the matching goal, a subset of the mapping is chosen using filters. After our algorithm runs, we expect a human to check and if necessary adjust the results. As a matter of fact, we evaluate the 'accuracy' of the algorithm by counting the number of needed adjustments. We conducted a user study, in which our accuracy metric was used to estimate the labor savings that the users could obtain by utilizing our algorithm to obtain an initial matching. Finally, we illustrate how our matching algorithm is deployed as one of several high-level operators in an implemented testbed for managing information models and mappings.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
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
Self-citationGeneric Schema Matching with Cupid
Madhavan, J., Bernstein, P. A., & Rahm, E. (2001) · Cited by 1,296
Self-citationObject exchange across heterogeneous information sources
Papakonstantinou, Y., Garcia-Molina, H., & Widom, J. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380386 · Cited by 751
Self-citationReconciling schemas of disparate data sources: a machine-learning approach
Doan, A., Domingos, P., & Halevy, A. Y. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375731 · Cited by 733
The Stable Marriage Problem: Structure and Algorithms
Dyer, M. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.61 · Cited by 606
Schema Mapping as Query Discovery
Miller, R. J., Haas, L. M., & Hernández, M. A. (2000) · Very Large Data Bases · Cited by 438
Cohen, W. W. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276323 · Cited by 379
Li, W.-S., & Clifton, C. (2000) · Data & Knowledge Engineering · doi:10.1016/s0169-023x(99)00044-0 · Cited by 347
A vision for management of complex models
Bernstein, P. A., Halevy, A. Y., & Pottinger, R. A. (2000) · ACM SIGMOD Record · doi:10.1145/369275.369289 · Cited by 321
Meaningful change detection in structured data
Chawathe, S. S., & García-Molina, H. (1997) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/253260.253266 · Cited by 284
Kanehisa, M. I. (2000) · doi:10.1093/oso/9780198503279.001.0001 · Cited by 155
Kanehisa, M. (2000) · Biofutur · doi:10.1016/s0294-3506(00)80179-9 · Cited by 140
On Matching Schemas Automatically
Rahm, E., & Bernstein, P. A. (2001) · Cited by 127
Self-citationMicrosoft repository version 2 and the open information model
Bernstein, P. A., Bergstraesser, T., Carlson, J., Pal, S., Sanders, P., & Shutt, D. (1999) · Information Systems · doi:10.1016/s0306-4379(99)00006-x · Cited by 80
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
Self-citationRajaraman, A., & Ullman, J. D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058452 · Cited by 2,262
SimRank: a measure of structural-context similarity
Jeh, G., & Widom, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775126 · Cited by 1,925
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
Ontology Matching: State of the Art and Future Challenges
Shvaiko, P., & Euzenat, J. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.253 · Cited by 1,148
Metadata
- Authors
- Melnik, S., Garcia-Molina, H., & Rahm, E.
- Venue
- Proceedings 18th International Conference on Data Engineering
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-25
- Pages
- 117-128
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2156543375
- Cited by
- 1,341
- References
- 16
- FWCI
- 50.09
- 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.