SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Efficient Querying and Maintenance of Ordered XML Data in Relational Databases

calvin avatar
calvin
11 diapositives · 259 Views · Aug 22, 2014

This paper explores the growing usage of XML for data exchange between heterogeneous sources while highlighting the predominance of relational databases in business environments. It presents innovative solutions, including a new labeling scheme (XRU) and a structural join algorithm (SS-Join), designed to optimize XML data management within traditional database systems without significant modifications. The proposed methods outperform existing algorithms, achieving improved performance in insertions and queries while maintaining efficiency in data operations.

Efficient Querying and Maintenance of Ordered XML Data in Relational Databases - slide 1
01 / 11Efficient Querying and Maintenance of Ordered XML Data in Relational Databases
1 / 17

Télécharger la présentation

Efficient Querying and Maintenance of Ordered XML Data in Relational Databases
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Querying and Maintaining Ordered XML Data using Relational Databases Anil Rawat Wei Pan Chang chen Kelly Yu

  2. Motivation • XML is being used increasingly often for the exchange of data form heterogeneous data sources. But at present, most business is stored in relational databases, due to the decades of research have been put into the field. • How to harness the versatility of the XML data model with minimal modifications to the mechanisms of relational databases?This paper proposes an efficient structural join algorithm that can be implemented on top of existing relational database.

  3. Aim of the work We mainly introduce a new labeling scheme (XRU) and a new structural join algorithm (SS-Join) that have been presented in the Querying and Maintaining Ordered XML Data using Relational Databases(William M. Shui, Franky Lam, Damien K. Fisher& Raymond K.Wong, 2005). The method is not based on the B-Tree or Stack, and do not use the indices ,just using a edge table that is stored in the relational database.

  4. Result of the new approaches • In XRU random insertion of nodes using local encoding scheme is generally faster than both Dewey and global encoding schemes • worst case of XRU using local encoding scheme is the same as that of global encoding scheme

  5. Result of the new approaches • XRU vs optimistic • compare the time and the number of relabelings • XRU significantly better

  6. Result of the new approaches • SS-Join • Better when selectivity between low and medium • Little bit worse than XR-Tree when the selectivity is high • The SS-join have to spend add extra overhead on join operation

  7. Result of the new approaches • successfully built two new approaches which are XRU Relabeling scheme and SS-join algorithm

  8. Experiments • XRU relabeling scheme • Global edge table • local edge table (best order maintenance performance)

  9. Performance results • Performance of relabeleing scheme • Global encoding scheme • Local encoding scheme • XRU vs. Optimistic

  10. Performance of querying XML • Performance of SS-D algorithm w.r.t. other structural join algorithms • Performance of SS-A algorithm w.r.t. other structural join algorithms

  11. Summary of the results • The XRU relabeling scheme achieves O (log n) cost for random and frequent insertions. • The SS-A and SS-D algorithm proposed in this paper outperform all other structural join algorithms.