XRecursive: An Efficient Method to Store and Query XML Documents
Mohammed Adam Ibrahim Fakharaldien, Jasni Mohamed Zain, Norrozila, Sulaiman

TL;DR
This paper introduces XRecursive, an efficient algorithm for storing and querying XML documents within relational databases, leveraging a novel schema to improve performance and integration of XML and structured data.
Contribution
The paper presents the XRecursive schema and algorithm for translating XML documents into relational databases, enhancing storage efficiency and query performance.
Findings
Demonstrates improved query performance on real database tests
Shows effective integration of XML and relational data
Provides detailed algorithm and schema for implementation
Abstract
Storing XML documents in a relational database is a promising solution because relational databases are mature and scale very well and they have the advantages that in a relational database XML data and structured data can coexist making it possible to build application that involve both kinds of data with little extra effort . In this paper, we propose an algorithm schema named XRecursive that translates XML documents to relational database according to the proposed storing structure. The steps and algorithm are given in details to describe how to use the storing structure to storage and query XML documents in relational database. Then we report our experimental results on a real database to show the performance of our method in some features.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Data Management and Algorithms · Service-Oriented Architecture and Web Services
