Name
Abstract | ||
|---|---|---|
Due to the complex nature of XML, finding classes of integrity constraints for XML data that are both expressive and practical is an important but challenging task. In this paper, we study a class of XML functional dependencies (called pXFDs) defined on the basis of tree homomorphism. We establish a semantic equivalence between the implications problems for pXFDs and for propositional Horn clauses, which guarantees linear time decidability of pXFD implication. Hence, pXFDs cannot only be used to capture relevant data semantics, but also be reasoned about efficiently. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-13824-9_14 | WoLLIC |
Keywords | Field | DocType |
linear time decidability,pxfd implication,relevant data semantics,complex nature,challenging task,implications problem,propositional horn clause,xml data,xml functional dependency,integrity constraint,implication problem,linear time,functional dependency | Programming language,Horn clause,XML,Computer science,XML validation,Algorithm,XML schema,Semantic equivalence,Tree homomorphism,Propositional variable,Dependency theory (database theory) | Conference |
Volume | ISSN | ISBN |
6188 | 0302-9743 | 3-642-13823-3 |
Citations | PageRank | References |
14 | 0.52 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sven Hartmann | 1 | 409 | 42.86 |
| Sebastian Link | 2 | 185 | 12.50 |
| Thu Trinh | 3 | 86 | 5.51 |