XML is becoming the new standard for the exchange and publishing of data over the Internet. Documents obeying the XML standard can be viewed as trees basically the parse tree of the document. XML database systems often give each item in the document (node in the tree) a unique logical identifier (called a label) and use those labels for an efficient processing of queries, in particular queries involving structural conditions or testing for changes in the document content. Therefore several path indexing and numbering schemes have been proposed. XML data on the Web are subjected to frequent updates. During the update on XML data, most of these approaches can need to recompute existing labels, which is rather time consuming. The goal of our labeling scheme is to design a persistent structural labeling scheme that supports the representation of ancestor-descendant relationship and sibling relationship between nodes. Moreover our labeling scheme supports insertion of new nodes at arbitrary positions in the XML tree without re-labeling and without conflicting existing labels

The certificate is a central concept in Grid Security Infrastructure authentication. The certificate guarantees the authenticity of the data, thus effectively authenticating the sender. In this paper, we propose a secure certificate authentication framework using Counting Process to interact trusty for Grid users .We intend to apply this approach in secured performance on Grids as well as in grid application for authenticating users, protecting attacks, and recovering failed systems. The main idea presented in this paper is to add counting process and matching method into RSA algorithm to apply in Grid certificate authentication.

Automated recovery of system features and their designs from program source codes is important in reverse engineering and system comprehension. It also helps in the testing of software. An error that is made by users in an input to an execution of a transaction and discovered only after the completion of the execution is called a posttransaction user-input error (PTUIE) of the transaction. For a transaction in any database application, usually, it is essential to-provide transactions for correcting the effect that could result from any PTUIE of the transaction. We discover some probable properties that exist between the control flow graph of a transaction and the control flow graphs of transactions for correcting PTUIE of the former transaction. Through recognizing these properties, we present a novel approach for the automated approximate recovery of provisions and designs for transactions to correct PTUIE of transactions in a database application. The approach recognizes these properties through analyzing the source codes of transactions in the database application statically.