Efficient Partitioning and Indexing of XML Data

XML is rapidly becoming the Internet standard for data representation and exchange. As a result, the number and size of XML documents is growing very fast. Large XML documents take more time to process and more time to do backup and recover. Hence, the efficient management of XML data is essential. Partitioning data is one way to process and efficiently manage a large database. Nearly all research studies have concentrated on optimizing query processing and indexing XML documents. Little work has been done on partitioning XML data. In this book, we are proposing a storage system called Partitioned and Indexed XML Storage System PIXSS which partitions and indexes large XML documents into smaller XML documents. PIXSS also includes new algorithms, which process queries on partitioned XML data. Our experimental results show that XML documents partitioned by PIXSS outperform those that are not partitioned.

Autorentext

.Bachelor of Computer Science degree from King Abdul Aziz University,2000. .Assistant lecturer in Jan 2001 at Umm Al-Qura University,Mekkah, Saudi Arabia. .Master of Computer Science degree from King Fahd University, Dhaharan,May 2008. .Deputy of IT-Center For E-Government, Jan 2009, Umm Al-Qura University .Email: ssotaibi@uqu.edu.sa