Dynamic tuning of XML storage schema in VXMLR

Dynamic tuning of XML storage schema in VXMLR

This paper reports the techniques of dynamic tuning of XML storage schema in VXMLR, which is a XML management system based on RDBMS. With two different tuning strategies, VXMLR can dynamically adjust its storage schema based on the latest query records to improve its query processing efficiency. Whe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Zhengchuan Xu, Zhimao Guo, Shuigeng Zhou, Aoying Zhou
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Computer crashes
Computer science
Concurrency control
Engineering management
History
Internet
Query processing
Relational databases
Statistics
XML
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 86
container_issue
container_start_page 76
container_title
container_volume
creator Zhengchuan Xu
Zhimao Guo
Shuigeng Zhou
Aoying Zhou
description This paper reports the techniques of dynamic tuning of XML storage schema in VXMLR, which is a XML management system based on RDBMS. With two different tuning strategies, VXMLR can dynamically adjust its storage schema based on the latest query records to improve its query processing efficiency. When a tuning event is triggered, VXMLR first derives from its history queries the initial mapping rules that map XML DTD to relational schemas; then by vertically partitioning the relational tables or redundantly storing the data relevant to history queries, some candidate storage schemas are generated; following that, the benefit and cost of each candidate schema is estimated; and finally a cost-driven approach is proposed to select the final storage schema from the candidate schemas under a certain space constraint. Experimental results validate the practicability and effectiveness of the proposed techniques.
doi_str_mv 10.1109/IDEAS.2003.1214913
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1214913</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1214913</ieee_id><sourcerecordid>1214913</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-49b0572d1546fff118e60928b2e122b94fc3a3dcf3874edd731fa1ebad7e1f483</originalsourceid><addsrcrecordid>eNotj81KAzEUhQMqWGtfQDd5gYy5-Zkky9LWWhgp1CLuSmZyUyPOVCbjom_vgD2bAx-HDw4hD8ALAO6eNsvV_K0QnMsCBCgH8orccVM6Dc6CuiaTcWWZ5aW9JbOcv_gYpUFrOyFsee58mxo6_HapO9JTpB-vFc3DqfdHpLn5xNbT1NH3Ee_uyU303xlnl56S_fNqv3hh1Xa9WcwrlhwfmHI110YE0KqMMQJYLLkTthYIQtROxUZ6GZoorVEYgpEQPWDtg0GIysopefzXJkQ8_PSp9f35cDkn_wD0vUGQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Dynamic tuning of XML storage schema in VXMLR</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Zhengchuan Xu ; Zhimao Guo ; Shuigeng Zhou ; Aoying Zhou</creator><creatorcontrib>Zhengchuan Xu ; Zhimao Guo ; Shuigeng Zhou ; Aoying Zhou</creatorcontrib><description>This paper reports the techniques of dynamic tuning of XML storage schema in VXMLR, which is a XML management system based on RDBMS. With two different tuning strategies, VXMLR can dynamically adjust its storage schema based on the latest query records to improve its query processing efficiency. When a tuning event is triggered, VXMLR first derives from its history queries the initial mapping rules that map XML DTD to relational schemas; then by vertically partitioning the relational tables or redundantly storing the data relevant to history queries, some candidate storage schemas are generated; following that, the benefit and cost of each candidate schema is estimated; and finally a cost-driven approach is proposed to select the final storage schema from the candidate schemas under a certain space constraint. Experimental results validate the practicability and effectiveness of the proposed techniques.</description><identifier>ISSN: 1098-8068</identifier><identifier>ISBN: 0769519814</identifier><identifier>ISBN: 9780769519814</identifier><identifier>DOI: 10.1109/IDEAS.2003.1214913</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer crashes ; Computer science ; Concurrency control ; Engineering management ; History ; Internet ; Query processing ; Relational databases ; Statistics ; XML</subject><ispartof>Seventh International Database Engineering and Applications Symposium, 2003. Proceedings, 2003, p.76-86</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1214913$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1214913$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zhengchuan Xu</creatorcontrib><creatorcontrib>Zhimao Guo</creatorcontrib><creatorcontrib>Shuigeng Zhou</creatorcontrib><creatorcontrib>Aoying Zhou</creatorcontrib><title>Dynamic tuning of XML storage schema in VXMLR</title><title>Seventh International Database Engineering and Applications Symposium, 2003. Proceedings</title><addtitle>IDEAS</addtitle><description>This paper reports the techniques of dynamic tuning of XML storage schema in VXMLR, which is a XML management system based on RDBMS. With two different tuning strategies, VXMLR can dynamically adjust its storage schema based on the latest query records to improve its query processing efficiency. When a tuning event is triggered, VXMLR first derives from its history queries the initial mapping rules that map XML DTD to relational schemas; then by vertically partitioning the relational tables or redundantly storing the data relevant to history queries, some candidate storage schemas are generated; following that, the benefit and cost of each candidate schema is estimated; and finally a cost-driven approach is proposed to select the final storage schema from the candidate schemas under a certain space constraint. Experimental results validate the practicability and effectiveness of the proposed techniques.</description><subject>Computer crashes</subject><subject>Computer science</subject><subject>Concurrency control</subject><subject>Engineering management</subject><subject>History</subject><subject>Internet</subject><subject>Query processing</subject><subject>Relational databases</subject><subject>Statistics</subject><subject>XML</subject><issn>1098-8068</issn><isbn>0769519814</isbn><isbn>9780769519814</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj81KAzEUhQMqWGtfQDd5gYy5-Zkky9LWWhgp1CLuSmZyUyPOVCbjom_vgD2bAx-HDw4hD8ALAO6eNsvV_K0QnMsCBCgH8orccVM6Dc6CuiaTcWWZ5aW9JbOcv_gYpUFrOyFsee58mxo6_HapO9JTpB-vFc3DqfdHpLn5xNbT1NH3Ee_uyU303xlnl56S_fNqv3hh1Xa9WcwrlhwfmHI110YE0KqMMQJYLLkTthYIQtROxUZ6GZoorVEYgpEQPWDtg0GIysopefzXJkQ8_PSp9f35cDkn_wD0vUGQ</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Zhengchuan Xu</creator><creator>Zhimao Guo</creator><creator>Shuigeng Zhou</creator><creator>Aoying Zhou</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2003</creationdate><title>Dynamic tuning of XML storage schema in VXMLR</title><author>Zhengchuan Xu ; Zhimao Guo ; Shuigeng Zhou ; Aoying Zhou</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-49b0572d1546fff118e60928b2e122b94fc3a3dcf3874edd731fa1ebad7e1f483</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Computer crashes</topic><topic>Computer science</topic><topic>Concurrency control</topic><topic>Engineering management</topic><topic>History</topic><topic>Internet</topic><topic>Query processing</topic><topic>Relational databases</topic><topic>Statistics</topic><topic>XML</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhengchuan Xu</creatorcontrib><creatorcontrib>Zhimao Guo</creatorcontrib><creatorcontrib>Shuigeng Zhou</creatorcontrib><creatorcontrib>Aoying Zhou</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zhengchuan Xu</au><au>Zhimao Guo</au><au>Shuigeng Zhou</au><au>Aoying Zhou</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Dynamic tuning of XML storage schema in VXMLR</atitle><btitle>Seventh International Database Engineering and Applications Symposium, 2003. Proceedings</btitle><stitle>IDEAS</stitle><date>2003</date><risdate>2003</risdate><spage>76</spage><epage>86</epage><pages>76-86</pages><issn>1098-8068</issn><isbn>0769519814</isbn><isbn>9780769519814</isbn><abstract>This paper reports the techniques of dynamic tuning of XML storage schema in VXMLR, which is a XML management system based on RDBMS. With two different tuning strategies, VXMLR can dynamically adjust its storage schema based on the latest query records to improve its query processing efficiency. When a tuning event is triggered, VXMLR first derives from its history queries the initial mapping rules that map XML DTD to relational schemas; then by vertically partitioning the relational tables or redundantly storing the data relevant to history queries, some candidate storage schemas are generated; following that, the benefit and cost of each candidate schema is estimated; and finally a cost-driven approach is proposed to select the final storage schema from the candidate schemas under a certain space constraint. Experimental results validate the practicability and effectiveness of the proposed techniques.</abstract><pub>IEEE</pub><doi>10.1109/IDEAS.2003.1214913</doi><tpages>11</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1098-8068
ispartof Seventh International Database Engineering and Applications Symposium, 2003. Proceedings, 2003, p.76-86
issn 1098-8068
language eng
recordid cdi_ieee_primary_1214913
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Computer crashes
Computer science
Concurrency control
Engineering management
History
Internet
Query processing
Relational databases
Statistics
XML
title Dynamic tuning of XML storage schema in VXMLR
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T04%3A48%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Dynamic%20tuning%20of%20XML%20storage%20schema%20in%20VXMLR&rft.btitle=Seventh%20International%20Database%20Engineering%20and%20Applications%20Symposium,%202003.%20Proceedings&rft.au=Zhengchuan%20Xu&rft.date=2003&rft.spage=76&rft.epage=86&rft.pages=76-86&rft.issn=1098-8068&rft.isbn=0769519814&rft.isbn_list=9780769519814&rft_id=info:doi/10.1109/IDEAS.2003.1214913&rft_dat=%3Cieee_6IE%3E1214913%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1214913&rfr_iscdi=true