Hamed Yarahmadi - Master of Software Engineering

Volume of probabilistic XML documents could increasingly grow, like ordinary XMLs, and transfer, store or use of the documents having large volume is not desirable. There are many techniques to compress ordinary XML documents that unlikely have good performance to compress probabilistic XML, and couldn’t cover selection distributions and their overhead. In this paper, we try to reduce this large volume of documents by overcoming key weakness of probabilistic XML i.e. not having independent schema and ordered structure. Hence, we define a structure for probabilistic XML by use of ordinary XML schema that approach this large volume of documents to acceptable amount by reducing central distribution definitions and defining less central elements, so reduce documents selection distributions and their overheads.

Dist, ind, mux , schema, probabilistic XML, Val[Prob]