Lossless Decomposition

Lossless Decomposition is a relational database decomposition method that belongs to the class of schema design techniques, distinguished by its property of ensuring that the original relation can be exactly reconstructed through the natural join of its decomposed relations, thereby preserving all functional dependencies and eliminating information loss.

96

Publications

4.9K

Citations

282

Authors

119

Institutions

Publications per year

2017–2026

17

Authors

282

  1. SS
    Shiro Saka

    Kyoto University, Japan

    3 publications · 196 citations

    3

    h-index

  2. TQ
    Truong Q. Nguyen

    University of California San Diego, United States

    2 publications · 62 citations

    2

    h-index

  3. MB
    Marie Babel

    Institut National des Sciences Appliquées de Rennes, France

    2 publications · 36 citations

    2

    h-index

  4. OD
    Olivier Déforges

    Institut d'Électronique et des Technologies du numéRique, France

    2 publications · 36 citations

    2

    h-index

  5. BJ
    Bahram Javidi

    University of Connecticut, United States

    1 publications · 72 citations

    1

    h-index

1–5 of 282

Venues

  1. IEEE Transactions on Image Processing

    4 publications · 184 citations

    4

    h-index

  2. Journal of Wood Science

    3 publications · 196 citations

    3

    h-index

  3. Very Large Data Bases

    Conference · 3 publications · 98 citations

    3

    h-index

  4. Fuzzy Sets and Systems

    2 publications · 28 citations

    2

    h-index

  5. Scripta Materialia

    2 publications · 37 citations

    2

    h-index

1–5