The DOI matches its Crossref record.
Duplicate record elimination in large data files
Open accessAbstract
The issue of duplicate elimination for large data files in which many occurrences of the same record may appear is addressed. A comprehensive cost analysis of the duplicate elimination operation is presented. This analysis is based on a combinatorial model developed for estimating the size of intermediate runs produced by a modified merge-sort procedure. The performance of this modified merge-sort procedure is demonstrated to be significantly superior to the standard duplicate elimination technique of sorting followed by a sequential pass to locate duplicate records. The results can also be used to provide critical input to a query optimizer in a relational database system.
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
Cited by
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
Real-world Data is Dirty: Data Cleansing and The Merge/Purge Problem
Hernández, M. A., & Stolfo, S. J. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009761603038 · Cited by 812
Dong, X. L., & Srivastava, D. (2015) · Synthesis Lectures on Data Management · doi:10.1007/978-3-031-01853-4 · Cited by 539
Hadoop++: making a yellow elephant run like a cheetah (without it even noticing)
Dittrich, J., Quiané-Ruiz, J.-A., Jindal, A., Kargin, Y., Setty, V., & Schad, J. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920908 · Cited by 364
Two supervised learning approaches for name disambiguation in author citations
Han, H., Giles, L., Zha, H., Li, C., & Tsioutsiouliklis, K. (2004) · Proceedings of the 4th ACM/IEEE-CS joint conference on Digital libraries · doi:10.1145/996350.996419 · Cited by 362
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
TAILOR: a record linkage toolbox
Elfeky, M. G., Verykios, V. S., & Elmagarmid, A. K. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994694 · Cited by 289
Name disambiguation in author citations using a K-way spectral clustering method
Han, H., Zha, H., & Giles, C. L. (2005) · Proceedings of the 5th ACM/IEEE-CS joint conference on Digital libraries · doi:10.1145/1065385.1065462 · Cited by 272
A Systematic Review of Data Quality in CPS and IoT for Industry 4.0
Goknil, A., Nguyen, P., Sen, S., Politaki, D., Niavis, H., Pedersen, K. J., Suyuthi, A., Anand, A., & Ziegenbein, A. (2023) · ACM Computing Surveys · doi:10.1145/3593043 · Cited by 84
How to Address the Data Quality Issues in Regression Models: A Guided Process for Data Cleaning
Corrales, D., Corrales, J., & Ledezma, A. (2018) · Symmetry · doi:10.3390/sym10040099 · Cited by 58
Metadata
- Authors
- Bitton, D., & DeWitt, D. J.
- Venue
- ACM Transactions on Database Systems
- Published
- 1983-06
- Volume
- 8
- Issue
- 2
- Pages
- 255-265
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2020191321
- Cited by
- 179
- References
- 0
- FWCI
- 3.51
- Type
- journal article
- Language
- en
- Open access
- bronze
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.