Inclusion Dependency Discovery
| Autor: | Tobias Bleifuß, Tim Friedrich, Axel Stebner, Lan Jiang, Felix Naumann, Hazar Harmouch, Thorsten Papenbrock, Maxi Fischer, Nils Strelow, Fabian Windheuser, Falco Dürsch |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Computer science
business.industry Relational database Data management 02 engineering and technology Query optimization computer.software_genre Metadata Data profiling 020204 information systems 0202 electrical engineering electronic engineering information engineering Profiling (information science) 020201 artificial intelligence & image processing business Algorithm computer Data Linkage Foreign key Data integration |
| Zdroj: | CIKM |
| DOI: | 10.1145/3357384.3357916 |
| Popis: | Inclusion dependencies are an important type of metadata in relational databases, because they indicate foreign key relationships and serve a variety of data management tasks, such as data linkage, query optimization, and data integration. The discovery of inclusion dependencies is, therefore, a well-studied problem and has been addressed by many algorithms. Each of these discovery algorithms follows its own strategy with certain strengths and weaknesses, which makes it difficult for data scientists to choose the optimal algorithm for a given profiling task. This paper summarizes the different state-of-the-art discovery approaches and discusses their commonalities. For evaluation purposes, we carefully re-implemented the thirteen most popular discovery algorithms and discuss their individual properties. Our extensive evaluation on several real-world and synthetic datasets shows the unbiased performance of the different discovery approaches and, hence, provides a guideline on when and where each approach works best. Comparing the different runtimes and scalability graphs, we identify the best approaches for certain situations and demonstrate where certain algorithms fail. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|