Titlebook: Database Theory – ICDT 2007; 11th International C Thomas Schwentick,Dan Suciu Conference proceedings 2006 Springer-Verlag Berlin Heidelberg

圆柱

https://doi.org/10.1007/978-3-319-44610-3and DTDs. We present a sound and complete axiomatization for XFDs, both alone and in the presence of certain classes of DTDs; we show that these DTD classes induce an axiomatic hierarchy. We also give efficient implication algorithms for those classes of DTDs that do not use disjunction or nesting.

ASTER

https://doi.org/10.1057/9781403982858 show that several important problems are efficiently solvable on WSDs while they are NP-hard on c-tables. Finally, we give a polynomial-time algorithm for factorizing WSDs, i.e. an efficient algorithm for minimizing such representations.

收养

截断

DECRY

interpose

Approximate Data Exchangeester, i.e. can be solved by looking at a constant fraction of the input .. We also show that .-Typechecking on words can be solved in polynomial time, whereas the exact problem is PSPACE-complete. Moreover, data exchange settings can be composed when they are close.

愤慨一下

冷淡一切

Characterization of the Interaction of XML Functional Dependencies with DTDsand DTDs. We present a sound and complete axiomatization for XFDs, both alone and in the presence of certain classes of DTDs; we show that these DTD classes induce an axiomatic hierarchy. We also give efficient implication algorithms for those classes of DTDs that do not use disjunction or nesting.

defile

World-Set Decompositions: Expressiveness and Efficient Algorithms show that several important problems are efficiently solvable on WSDs while they are NP-hard on c-tables. Finally, we give a polynomial-time algorithm for factorizing WSDs, i.e. an efficient algorithm for minimizing such representations.

B-cell