第七章相关查询之处理.PDFVIP

理 PCS-trie理 率 狀 了PCS-trie ordered tree database unordered query tree 精理 ordered tree unordered tree fault tolerent理 論 7.1 Ordered tree database unordered tree理 XML ordered tree XPath[4]XQuery[17] ordered tree unordered tree 例若 XML 錄不 XML unordered tree ordered tree database unordered tree 了 PCS-trie 索 data treeordered tree query tree unordered tree 不 query treevertex sibling 來 PREOD code PCS-trie query tree vertex siblings 列都 來unordered tree query tree tree ordered tree tree PCS-trie聯 來略 vertex數 query tree行若 query tree 狀略 略來 ordered tree tree database unordered tree 7.1 query tree Q root leaf path都來path set D’ D’ path都 query tree PREOD code PCS-trie PREOD code 來 tree database D’path data tree 來若 tree database data tree都 vertex sibling label Algorithm UnorderedQuery(root, query) root is the root of PCS-trie which index an ordered tree database, and query is the unordered query tree. Divide query into root-to-leaf paths and get a path set D’ for all path p i in D’ do convert p into a PREOD code p’ ResultSet ri = ExactQueryPTrie( root, p’); intersect all ri and get new ResultSet R for all data tree dt in R do j match dt with query, delete dt in R if query is not a sub-tree of dt j j j return R . 7.1 立ordered tree database PCS-trie unordered tree 若 data tree vertex sibling label query tree D’兩 tree 7.2 略若 false drop post-processing 濾 false drop 7.1 data tree vertex sibling label 7.2 path set 兩 unordered tree 7.2 Fault tolerent 理 PCS-trie 理 approximate approximate query fault-tolerant 狀 fa