A succinct physical storage scheme for efficient evaluation of path queries in XML
Path expressions are ubiquitous in XML processing languages. Existing approaches evaluate a path expression by selecting nodes that satisfies the tag-name and value constraints and then joining them according to the structural constraints. We propose a novel approach, next-of-kin (NoK) pattern match...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 65 |
|---|---|
| container_issue | |
| container_start_page | 54 |
| container_title | |
| container_volume | |
| creator | Zhang, N. Varun Kacholia Ozsu, M.T. |
| description | Path expressions are ubiquitous in XML processing languages. Existing approaches evaluate a path expression by selecting nodes that satisfies the tag-name and value constraints and then joining them according to the structural constraints. We propose a novel approach, next-of-kin (NoK) pattern matching, to speed up the node-selection step, and to reduce the join size significantly in the second step. To efficiently perform NoK pattern matching, we also propose a succinct XML physical storage scheme that is adaptive to updates and streaming XML as well. Our performance results demonstrate that the proposed storage scheme and path evaluation algorithm is highly efficient and outperforms the other tested systems in most cases. |
| doi_str_mv | 10.1109/ICDE.2004.1319984 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_6IE</sourceid><recordid>TN_cdi_ieee_primary_1319984</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1319984</ieee_id><sourcerecordid>18596786</sourcerecordid><originalsourceid>FETCH-LOGICAL-i203t-5c270e48d2c78c7d9090a885a49d2612840753ea5cefaad030d047c2be9207623</originalsourceid><addsrcrecordid>eNpFUEtLw0AYXHyApfYHiJe9eEz99r17LPVVqAii0Fv53HyxK20Ss6nQf2-ggnOZwwzDzDB2JWAqBITbxfzufioB9FQoEYLXJ2wklTMFSLs6ZZPgPDgbjARr4IyNBFhVWOXlBZvk_AUDghbCwIi9znjex5jq2PN2c8gp4pbnvunwk3iOG9oRr5qOU1WlmKjuOf3gdo99amreVLzFfsO_99QlyjzVfPW8vGTnFW4zTf54zN4f7t_mT8Xy5XExny2LJEH1hYnSAWlfyuh8dGWAAOi9QR1KaYX0GpxRhCZShViCghK0i_KDghzWSTVmN8fcFvPQuuqwjimv2y7tsDushTfBOm8H3_XRl4joXz4-p34BuZdehw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A succinct physical storage scheme for efficient evaluation of path queries in XML</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Zhang, N. ; Varun Kacholia ; Ozsu, M.T.</creator><creatorcontrib>Zhang, N. ; Varun Kacholia ; Ozsu, M.T.</creatorcontrib><description>Path expressions are ubiquitous in XML processing languages. Existing approaches evaluate a path expression by selecting nodes that satisfies the tag-name and value constraints and then joining them according to the structural constraints. We propose a novel approach, next-of-kin (NoK) pattern matching, to speed up the node-selection step, and to reduce the join size significantly in the second step. To efficiently perform NoK pattern matching, we also propose a succinct XML physical storage scheme that is adaptive to updates and streaming XML as well. Our performance results demonstrate that the proposed storage scheme and path evaluation algorithm is highly efficient and outperforms the other tested systems in most cases.</description><identifier>ISSN: 1063-6382</identifier><identifier>ISBN: 9780769520650</identifier><identifier>ISBN: 0769520650</identifier><identifier>EISSN: 2375-026X</identifier><identifier>DOI: 10.1109/ICDE.2004.1319984</identifier><language>eng</language><publisher>Los Alamitos CA: IEEE</publisher><subject>Applied sciences ; Computer science ; Computer science; control theory; systems ; Data engineering ; Encoding ; Exact sciences and technology ; Information systems. Data bases ; Labeling ; Memory organisation. Data processing ; Navigation ; Pattern matching ; Relational databases ; Software ; System testing ; Tree data structures ; XML</subject><ispartof>Proceedings. 20th International Conference on Data Engineering, 2004, p.54-65</ispartof><rights>2007 INIST-CNRS</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1319984$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1319984$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18596786$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Zhang, N.</creatorcontrib><creatorcontrib>Varun Kacholia</creatorcontrib><creatorcontrib>Ozsu, M.T.</creatorcontrib><title>A succinct physical storage scheme for efficient evaluation of path queries in XML</title><title>Proceedings. 20th International Conference on Data Engineering</title><addtitle>ICDE</addtitle><description>Path expressions are ubiquitous in XML processing languages. Existing approaches evaluate a path expression by selecting nodes that satisfies the tag-name and value constraints and then joining them according to the structural constraints. We propose a novel approach, next-of-kin (NoK) pattern matching, to speed up the node-selection step, and to reduce the join size significantly in the second step. To efficiently perform NoK pattern matching, we also propose a succinct XML physical storage scheme that is adaptive to updates and streaming XML as well. Our performance results demonstrate that the proposed storage scheme and path evaluation algorithm is highly efficient and outperforms the other tested systems in most cases.</description><subject>Applied sciences</subject><subject>Computer science</subject><subject>Computer science; control theory; systems</subject><subject>Data engineering</subject><subject>Encoding</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Labeling</subject><subject>Memory organisation. Data processing</subject><subject>Navigation</subject><subject>Pattern matching</subject><subject>Relational databases</subject><subject>Software</subject><subject>System testing</subject><subject>Tree data structures</subject><subject>XML</subject><issn>1063-6382</issn><issn>2375-026X</issn><isbn>9780769520650</isbn><isbn>0769520650</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFUEtLw0AYXHyApfYHiJe9eEz99r17LPVVqAii0Fv53HyxK20Ss6nQf2-ggnOZwwzDzDB2JWAqBITbxfzufioB9FQoEYLXJ2wklTMFSLs6ZZPgPDgbjARr4IyNBFhVWOXlBZvk_AUDghbCwIi9znjex5jq2PN2c8gp4pbnvunwk3iOG9oRr5qOU1WlmKjuOf3gdo99amreVLzFfsO_99QlyjzVfPW8vGTnFW4zTf54zN4f7t_mT8Xy5XExny2LJEH1hYnSAWlfyuh8dGWAAOi9QR1KaYX0GpxRhCZShViCghK0i_KDghzWSTVmN8fcFvPQuuqwjimv2y7tsDushTfBOm8H3_XRl4joXz4-p34BuZdehw</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Zhang, N.</creator><creator>Varun Kacholia</creator><creator>Ozsu, M.T.</creator><general>IEEE</general><general>IEEE Computer Society</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>A succinct physical storage scheme for efficient evaluation of path queries in XML</title><author>Zhang, N. ; Varun Kacholia ; Ozsu, M.T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i203t-5c270e48d2c78c7d9090a885a49d2612840753ea5cefaad030d047c2be9207623</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Computer science</topic><topic>Computer science; control theory; systems</topic><topic>Data engineering</topic><topic>Encoding</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Labeling</topic><topic>Memory organisation. Data processing</topic><topic>Navigation</topic><topic>Pattern matching</topic><topic>Relational databases</topic><topic>Software</topic><topic>System testing</topic><topic>Tree data structures</topic><topic>XML</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhang, N.</creatorcontrib><creatorcontrib>Varun Kacholia</creatorcontrib><creatorcontrib>Ozsu, M.T.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zhang, N.</au><au>Varun Kacholia</au><au>Ozsu, M.T.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A succinct physical storage scheme for efficient evaluation of path queries in XML</atitle><btitle>Proceedings. 20th International Conference on Data Engineering</btitle><stitle>ICDE</stitle><date>2004</date><risdate>2004</risdate><spage>54</spage><epage>65</epage><pages>54-65</pages><issn>1063-6382</issn><eissn>2375-026X</eissn><isbn>9780769520650</isbn><isbn>0769520650</isbn><abstract>Path expressions are ubiquitous in XML processing languages. Existing approaches evaluate a path expression by selecting nodes that satisfies the tag-name and value constraints and then joining them according to the structural constraints. We propose a novel approach, next-of-kin (NoK) pattern matching, to speed up the node-selection step, and to reduce the join size significantly in the second step. To efficiently perform NoK pattern matching, we also propose a succinct XML physical storage scheme that is adaptive to updates and streaming XML as well. Our performance results demonstrate that the proposed storage scheme and path evaluation algorithm is highly efficient and outperforms the other tested systems in most cases.</abstract><cop>Los Alamitos CA</cop><pub>IEEE</pub><doi>10.1109/ICDE.2004.1319984</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1063-6382 |
| ispartof | Proceedings. 20th International Conference on Data Engineering, 2004, p.54-65 |
| issn | 1063-6382 2375-026X |
| language | eng |
| recordid | cdi_ieee_primary_1319984 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Applied sciences Computer science Computer science control theory systems Data engineering Encoding Exact sciences and technology Information systems. Data bases Labeling Memory organisation. Data processing Navigation Pattern matching Relational databases Software System testing Tree data structures XML |
| title | A succinct physical storage scheme for efficient evaluation of path queries in XML |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T18%3A57%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20succinct%20physical%20storage%20scheme%20for%20efficient%20evaluation%20of%20path%20queries%20in%20XML&rft.btitle=Proceedings.%2020th%20International%20Conference%20on%20Data%20Engineering&rft.au=Zhang,%20N.&rft.date=2004&rft.spage=54&rft.epage=65&rft.pages=54-65&rft.issn=1063-6382&rft.eissn=2375-026X&rft.isbn=9780769520650&rft.isbn_list=0769520650&rft_id=info:doi/10.1109/ICDE.2004.1319984&rft_dat=%3Cpascalfrancis_6IE%3E18596786%3C/pascalfrancis_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=1319984&rfr_iscdi=true |