arXiv (All)
open access
Efficient discovery of unique column combinations on disk-resident data with limited memory
The discovery of unique column combinations (UCCs) is a core task in data profiling, describing the key constraints of a table. The existing algorithms cannot deal with large-scale disk-resident data well due to high memory consumption and computational cost. In this paper, a novel DUD algorithm is
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Efficient discovery of unique column combinations on disk-resident data with limited memory#627770
- An improved bound on Boolean matrix multiplication for highly clustered data#380273
- trasgoDP: An Open Source Framework for Releasing Noised Tabular Microdata under Local Differential Privacy#411172
- NitroGene: privacy-preserving collaborative genomic analysis using AWS nitro enclaves.#465274
- Generalized Organization of Large Data Bases: A Set-theoretic Approach to Relations#472216
Record · ID 820794
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive