Distance functional dependencies in the presence of complex values
Distance functional dependencies (dFDs) have been introduced in the context of the relational data model as a generalisation of error-robust functional dependencies (erFDs). An erFD is a dependency that still holds, if errors are introduced into a relation, which cause the violation of an original f...
Elmentve itt :
| Szerzők: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
2004
|
| Sorozat: | Acta cybernetica
16 No. 3 |
| Kulcsszavak: | Számítástechnika, Nyelvészet - számítógép alkalmazása |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12735 |
| LEADER | 01955nab a2200241 i 4500 | ||
|---|---|---|---|
| 001 | acta12735 | ||
| 005 | 20220615101321.0 | ||
| 008 | 161015s2004 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Link Sebastian | |
| 245 | 1 | 0 | |a Distance functional dependencies in the presence of complex values |h [elektronikus dokumentum] / |c Link Sebastian |
| 260 | |c 2004 | ||
| 300 | |a 459-472 | ||
| 490 | 0 | |a Acta cybernetica |v 16 No. 3 | |
| 520 | 3 | |a Distance functional dependencies (dFDs) have been introduced in the context of the relational data model as a generalisation of error-robust functional dependencies (erFDs). An erFD is a dependency that still holds, if errors are introduced into a relation, which cause the violation of an original functional dependency. A dFD with a distance d=2e+1 corresponds to an erFD with at most e errors in each tuple. Recently, an axiomatisation of dFDs has been obtained. Database theory, however, does no longer deal only with flat relations. Modern data models such as the higher-order Entity-Relationship model (HERM), object oriented datamodels (OODM), or the eXtensible Meakup Language (XML) provide constructors for complex values such as finite sets, multisets and lists. In this article, dFDs with complex values are investigated. Based on a generalisation of the HAmming distance for tuples to complex values, which exploits a lattice structure on subattributes, the major achievement is a finite axiomatisation of the new class of dependencies. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Nyelvészet - számítógép alkalmazása | ||
| 700 | 0 | 1 | |a Schewe Klaus-Dieter |e aut |
| 710 | |a Conference on Hungarian Computational Linguistics (1.) (2003) (Szeged) | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12735/1/Link_2004_ActaCybernetica.pdf |z Dokumentum-elérés |