Efficient Secure Query Processing in XML Data Stream
published: Jan. 29, 2008, recorded: September 2007, views: 86
Related content
35:41
101 views - Ludovic Denoyer, 2008
29:17
47 views - Jihie Kim, 2006
55:27
97 views - Baptiste Csernel, 2007
12:57
1151 views - Jiawei Han, 2007
15:55
145 views - Hyun Namgoong, 2007
03:54:31
12719 views - Chih-Jen Lin, 2006
01:34:49
6410 views - Yee Whye Teh, 2007
01:06:55
5647 views - Fei-Fei Li, 2006
53:23
328 views - Mohamed Medhat Gaber, 2007
01:19:44
464 views - Joao Gama, 2007
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
As various users and applications require the distribution and sharing of information in XML documents, the need for an efficient secure access of XML data in a ubiquitous data stream environment has become very important. In this paper, we propose an efficient secure XML query processing method to solve the two problems by using role-based prime number labeling and XML fragmentation. A medical records XML document has the characteristic of an infinite addition in width rather than in depth because of the increment of patients. But a role-based prime number labeling method can fully manage the size of documents that increases to infinity and can minimize the maintenance cost caused by dynamic changes. Experimental evaluation clearly demonstrates that our approach is efficient and secure.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




Write your own review or comment: