Experimental evaluation of Prufer sequences on XML

XML query processing is a key factor in today's database research. Many algorithms have been proposed and implemented to deal with this issue. But each one of them had some limitation. PRIX is one efficient algorithm introduced for indexing and querying XML databases. It transforms XML documents and the query to be processed into prufer sequences and matches the sequence of twig query with the sequences in database and applies some refinement steps to get the result to the query. PRIX doesn't break a twig query into individual path queries to find matches. It also doesn't detect any false alarms and supports only ordered pattern matching.; In this thesis we ran PRIX with different types of queries like linear path, existential path and regular twig queries to measure its performance. We used three datasets with different features namely DBLP, Swissprot and Treebank to compare the average execution times taken by different types of queries. We also automated PRIX in such a manner that it automatically converts a given query into its required format. This helped us to execute a large number of queries more efficiently.