Sciweavers

52 search results - page 9 / 11
» Redundancy, Dependencies and Normal Forms for XML Databases
Sort
View
SIGCSE
1996
ACM
163views Education» more  SIGCSE 1996»
13 years 9 months ago
Database theory in practice: learning from cooperative group projects
lhis paper describes the use of cooperative group learning concepts in support of an undergraduate database mrtnagement course that emphasizes the theoretical and practical aspect...
Suzanne W. Dietrich, Susan Darling Urban
IS
2010
13 years 3 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
PODS
2006
ACM
104views Database» more  PODS 2006»
14 years 5 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
CIKM
2010
Springer
13 years 3 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...
VL
2009
IEEE
150views Visual Languages» more  VL 2009»
14 years 11 hour ago
Discovery-based edit assistance for spreadsheets
Spreadsheets can be viewed as a highly flexible endusers programming environment which enjoys wide-spread adoption. But spreadsheets lack many of the structured programming conce...
Jácome Cunha, João Saraiva, Joost Vi...