文章基本信息

标题：Efficient Tree Pattern Queries On Encrypted XML Documents
本地全文：下载
作者：Fang-Yu Rao ; Jianneng Cao ; Mehmet Kuzu 等
期刊名称：Transactions on Data Privacy
印刷版ISSN：1888-5063
电子版ISSN：2013-1631
出版年度：2013
卷号：6
期号：3
页码：199-226
出版社：IIIA-CSIC
摘要：Outsourcing XML documents is a challenging task, because it encrypts the documents,while still requiring efficient query processing. Past approaches on this topic either leak structuralinformation or fail to support searching that has constraints on XML node content. To address theseproblems, we present a solution for efficient evaluation of tree pattern queries (TPQs) on encryptedXML documents. We create a domain hierarchy, such that each XML document can be embedded init. By assigning each node in the hierarchy a position, we create for each document a vector, whichencodes both the structural and textual information about the document. Similarly, a vector is cre-ated also for a TPQ. Then, the matching between a TPQ and a document is reduced to calculatingthe distance between their vectors. For the sake of privacy, such vectors are encrypted before be-ing outsourced. To improve the matching efficiency, we use a k-d tree to partition the vectors intonon-overlapping subsets, such that non-matchable documents are pruned as early as possible. Theextensive evaluation shows that our solution is efficient and scalable to large dataset