Query Relaxation for XML Database
40 likes | 191 Views
Query Relaxation for XML Database. Award #: 0219442 PI: Wesley W. Chu Computer Science Dept. UCLA. Problem Overview. Goal Develop an XML query relaxation framework for searching answers that can approximately match the given query conditions. Query Relaxation
Query Relaxation for XML Database
E N D
Presentation Transcript
Query Relaxation for XML Database Award #: 0219442 PI: Wesley W. Chu Computer Science Dept. UCLA
Problem Overview • Goal • Develop an XML query relaxation framework for searching answers that can approximately match the given query conditions. • Query Relaxation • Relax the query constraints to derive approximate answers if the original query returns no answer or not enough answers. • Relaxation types • Value relaxation: expanding the value constraints in the query • Structure relaxation • Node relaxation: node re-label, node deletion • Edge relaxation: generalizing parent-child edge “/” to ancestor-descendant edge “//”.
X-TAH: Knowledge-based Relaxation Index Q • X-TAH: • Generated by clustering similar XML fragments into hierarchical tree-like structure based on inter- object distance and inter- cluster distance. • Relaxation with X-TAH • Generalization • Specification Cluster Representative XML fragment An example of X-TAH
X-TAH Approximate Answers XML Query Query Relaxation Present Answers Satisfactory Answer Yes Postprocess Module No Select Condition to Relax System Overview Query Processing