Efficient Multidimensional Simple Path Query Processing Algorithm for XML Data

XML (Extensible Markup Languages) is considered as a new standard for the exchanging of information over the Internet. Nowadays, the number of applications using XML data is increasing rapidly. As a result, it is important to develop efficient algorithms to store and query XML data. In this paper, we present our proposed query processing algorithm, namely multidimensional simple path query processing algorithm (Path_MD). Path_MD is a simple path query processing algorithm designed to find solutions for simple path queries and it is designed to query XML data organized as multidimensional file. In our experiments, we compare our proposed algorithm, Path_MD, against PathStack algorithm, which is a well-known XML query processing algorithm, to study its performance. Our experiments shown that our proposed query processing algorithm outperform PathStack algorithm in terms of number of disk accesses needed to answer the query.