Efficient multidimensional simple path query processing algorithm for XML data

  • Dhiaa Musleh
  • , Salahadin Adam
  • , Muhammed Al-Mulhem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication2013 International Conference on Information Science and Applications, ICISA 2013
DOIs
StatePublished - 2013

Publication series

Name2013 International Conference on Information Science and Applications, ICISA 2013

Keywords

  • XML
  • multidimensional index
  • query processing
  • storage system

ASJC Scopus subject areas

  • Signal Processing

Fingerprint

Dive into the research topics of 'Efficient multidimensional simple path query processing algorithm for XML data'. Together they form a unique fingerprint.

Cite this