Relational Schema Decomposition is the process of breaking down a relational database schema into smaller, more normalized schemas to eliminate data redundancy and improve data integrity while preserving functional dependencies and ensuring lossless join properties.
63
Publications
4.3K
Citations
118
Authors
63
Institutions
Publications per year
2017–2026
0
Parents
Publications
63
Masatoshi Yoshikawa, Toshiyuki Amagasa, Takeyuki Shimura et al. · ACM Transactions on Internet Technology · 2001 · 305 citations
1–5 of 63
Authors
118
- RF
3
h-index
- LA
3
h-index
- DO
3
h-index
- FM
2
h-index
- CPClaudia Perlich
IBM Research - Thomas J. Watson Research Center, United States
2 publications · 114 citations
2
h-index
1–5 of 118
Institutions
63
Core Competence
Santa Fe, United States
3 h-index
3 publications
160 citations
IBM (United States)
Armonk, United States
3 h-index
3 publications
898 citations
The University of Texas at Austin
Austin, United States
2 h-index
2 publications
45 citations
New York University
New York, United States
2 h-index
4 publications
228 citations
U.S. Air Force Institute of Technology
Dayton, United States
2 h-index
2 publications
45 citations
Stanford University
Stanford, United States
2 h-index
2 publications
70 citations
Princeton University
Princeton, United States
2 h-index
2 publications
60 citations
AT&T (United States)
Bedminster, United States
2 h-index
5 publications
177 citations
1–8 of 63
Venues
- ACM Transactions on Database Systems
TODS · 7 publications · 1.2K citations
7
h-index
- Data & Knowledge Engineering
DKE · 5 publications · 174 citations
5
h-index
- Journal of Computer and System Sciences
2 publications · 57 citations
2
h-index
- IEEE Transactions on Software Engineering
TSE · 2 publications · 136 citations
2
h-index
- Information Sciences
2 publications · 75 citations
2
h-index
1–5