Lossless Join Decomposition is a decomposition method in database normalization that belongs to the class of relational decomposition techniques, distinguished by the property that the natural join of the decomposed relations always reconstructs the original relation without spurious or lost tuples.
17
Publications
876
Citations
31
Authors
17
Institutions
Publications per year
2017–2026
0
Parents
Publications
17
Polyinstantiation integrity in multilevel relations
Sushil Jajodia, Ravi Sandhu · 1990 · 90 citations
Assumptions in relational database theory
Paolo Atzeni, D. Stott Parker · 1982 · 62 citations · Full text
1–5 of 17
Authors
31
- SD
2
h-index
- SW
2
h-index
- GC
1
h-index
- FS
1
h-index
- AY
1
h-index
1–5 of 31
Institutions
17
Middle East Technical University
Ankara, Türkiye
2 h-index
3 publications
53 citations
Arizona State University
Tempe, United States
2 h-index
4 publications
74 citations
University of California, Los Angeles
Los Angeles, United States
1 h-index
1 publications
62 citations
George Mason University
Fairfax, United States
1 h-index
2 publications
180 citations
University of Alabama in Huntsville
Huntsville, United States
1 h-index
3 publications
69 citations
Sichuan Normal University
Chengdu, China
1 h-index
1 publications
16 citations
University of Vermont
Burlington, United States
1 h-index
1 publications
16 citations
Leshan Normal University
Leshan, China
1 h-index
2 publications
32 citations
1–8 of 17
Venues
- ACM Transactions on Database Systems
TODS · 2 publications · 456 citations
2
h-index
- Journal of Applied Mathematics
1 publications · 27 citations
1
h-index
- ACM SIGACT News
1 publications · 39 citations
1
h-index
- Information Sciences
1 publications · 16 citations
1
h-index
- Journal of Computer Security
1 publications · 23 citations
1
h-index
1–5