An Extended Preorder Index for Optimising XPath Expressions
Many of the problems with native XML databases relate to query performance and subsequently, it can be difficult to convince traditional database users of the benefits of using semi- or unstructured databases. Presently, there still lacks an index structure providing efficient support for structural...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 128 |
|---|---|
| container_issue | 3671 |
| container_start_page | 114 |
| container_title | |
| container_volume | |
| creator | O’Connor, Martin F. Bellahsène, Zohra Roantree, Mark |
| description | Many of the problems with native XML databases relate to query performance and subsequently, it can be difficult to convince traditional database users of the benefits of using semi- or unstructured databases. Presently, there still lacks an index structure providing efficient support for structural queries and the traditional data-centric and content queries. This paper presents an extended index structure based on the preorder traversal rank and the level (or depth) rank of each node in a document tree. The extended index fully supports the navigation of all XPath axes while efficiently supporting data-centric queries. The ability to start path traversals from arbitrary nodes in a document tree also enables the extended index to support the evaluation of path traversals embedded in XQuery expressions. Furthermore, an encoding technique is presented where properties of the level ranking may be exploited to provide efficient and optimised level-based XPath evaluations. |
| doi_str_mv | 10.1007/11547273_9 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>hal_pasca</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_lirmm_00106099v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_lirmm_00106099v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-h254t-bcfedddc08b8e34f6d7f644464424f0af78c1a619f8bd2513b0848100fb964703</originalsourceid><addsrcrecordid>eNpFkFtLAzEQheMNrLUv_oJ9EQRZnVx2k-BTKdUWCu2Dgm8hu0na1b2RLFL_vSkVHRiG4XwzcA5CNxgeMAB_xDhjnHCq5AmaSC5oxoBimQt5ikY4xzillMkzdHUQiMgEhXM0AgoklZzRSzQJ4QNiUcwxISP0NG2T-X6wrbEm2XjbeWN9sozrPnGdT9b9UDVVqNpt8r7Rwy7CvbchVF0brtGF03Wwk985Rm_P89fZIl2tX5az6SrdkYwNaVE6a4wpQRTCUuZyw13OGItNmAPtuCixzrF0ojAkw7QAwUS06wqZMw50jO6Pf3e6Vr2vGu2_VacrtZiuVF35plEAGHKQ8gtH-vZI9zqUunZet2UV_u6i74xSISN3d-RClNqt9arous-gMKhD1Oo_avoDd99pLg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An Extended Preorder Index for Optimising XPath Expressions</title><source>Springer Books</source><creator>O’Connor, Martin F. ; Bellahsène, Zohra ; Roantree, Mark</creator><contributor>Ceri, Stefano ; Bellahsène, Zohra ; Unland, Rainer ; Bressan, Stéphane ; Hunt, Ela ; Ives, Zachary G. ; Rys, Michael</contributor><creatorcontrib>O’Connor, Martin F. ; Bellahsène, Zohra ; Roantree, Mark ; Ceri, Stefano ; Bellahsène, Zohra ; Unland, Rainer ; Bressan, Stéphane ; Hunt, Ela ; Ives, Zachary G. ; Rys, Michael</creatorcontrib><description>Many of the problems with native XML databases relate to query performance and subsequently, it can be difficult to convince traditional database users of the benefits of using semi- or unstructured databases. Presently, there still lacks an index structure providing efficient support for structural queries and the traditional data-centric and content queries. This paper presents an extended index structure based on the preorder traversal rank and the level (or depth) rank of each node in a document tree. The extended index fully supports the navigation of all XPath axes while efficiently supporting data-centric queries. The ability to start path traversals from arbitrary nodes in a document tree also enables the extended index to support the evaluation of path traversals embedded in XQuery expressions. Furthermore, an encoding technique is presented where properties of the level ranking may be exploited to provide efficient and optimised level-based XPath evaluations.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540285830</identifier><identifier>ISBN: 9783540285830</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540319689</identifier><identifier>EISBN: 3540319689</identifier><identifier>DOI: 10.1007/11547273_9</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Arbitrary Node ; Computer science; control theory; systems ; Document Tree ; Exact sciences and technology ; Information systems. Data bases ; Level Index ; Level Rank ; Location Step ; Memory organisation. Data processing ; Software</subject><ispartof>Database and XML Technologies, 2005 (3671), p.114-128</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0003-2031-0519</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11547273_9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11547273_9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>230,309,310,779,780,784,789,790,793,885,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17153389$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal-lirmm.ccsd.cnrs.fr/lirmm-00106099$$DView record in HAL$$Hfree_for_read</backlink></links><search><contributor>Ceri, Stefano</contributor><contributor>Bellahsène, Zohra</contributor><contributor>Unland, Rainer</contributor><contributor>Bressan, Stéphane</contributor><contributor>Hunt, Ela</contributor><contributor>Ives, Zachary G.</contributor><contributor>Rys, Michael</contributor><creatorcontrib>O’Connor, Martin F.</creatorcontrib><creatorcontrib>Bellahsène, Zohra</creatorcontrib><creatorcontrib>Roantree, Mark</creatorcontrib><title>An Extended Preorder Index for Optimising XPath Expressions</title><title>Database and XML Technologies</title><description>Many of the problems with native XML databases relate to query performance and subsequently, it can be difficult to convince traditional database users of the benefits of using semi- or unstructured databases. Presently, there still lacks an index structure providing efficient support for structural queries and the traditional data-centric and content queries. This paper presents an extended index structure based on the preorder traversal rank and the level (or depth) rank of each node in a document tree. The extended index fully supports the navigation of all XPath axes while efficiently supporting data-centric queries. The ability to start path traversals from arbitrary nodes in a document tree also enables the extended index to support the evaluation of path traversals embedded in XQuery expressions. Furthermore, an encoding technique is presented where properties of the level ranking may be exploited to provide efficient and optimised level-based XPath evaluations.</description><subject>Applied sciences</subject><subject>Arbitrary Node</subject><subject>Computer science; control theory; systems</subject><subject>Document Tree</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Level Index</subject><subject>Level Rank</subject><subject>Location Step</subject><subject>Memory organisation. Data processing</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540285830</isbn><isbn>9783540285830</isbn><isbn>9783540319689</isbn><isbn>3540319689</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkFtLAzEQheMNrLUv_oJ9EQRZnVx2k-BTKdUWCu2Dgm8hu0na1b2RLFL_vSkVHRiG4XwzcA5CNxgeMAB_xDhjnHCq5AmaSC5oxoBimQt5ikY4xzillMkzdHUQiMgEhXM0AgoklZzRSzQJ4QNiUcwxISP0NG2T-X6wrbEm2XjbeWN9sozrPnGdT9b9UDVVqNpt8r7Rwy7CvbchVF0brtGF03Wwk985Rm_P89fZIl2tX5az6SrdkYwNaVE6a4wpQRTCUuZyw13OGItNmAPtuCixzrF0ojAkw7QAwUS06wqZMw50jO6Pf3e6Vr2vGu2_VacrtZiuVF35plEAGHKQ8gtH-vZI9zqUunZet2UV_u6i74xSISN3d-RClNqt9arous-gMKhD1Oo_avoDd99pLg</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>O’Connor, Martin F.</creator><creator>Bellahsène, Zohra</creator><creator>Roantree, Mark</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0003-2031-0519</orcidid></search><sort><creationdate>2005</creationdate><title>An Extended Preorder Index for Optimising XPath Expressions</title><author>O’Connor, Martin F. ; Bellahsène, Zohra ; Roantree, Mark</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-h254t-bcfedddc08b8e34f6d7f644464424f0af78c1a619f8bd2513b0848100fb964703</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Arbitrary Node</topic><topic>Computer science; control theory; systems</topic><topic>Document Tree</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Level Index</topic><topic>Level Rank</topic><topic>Location Step</topic><topic>Memory organisation. Data processing</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>O’Connor, Martin F.</creatorcontrib><creatorcontrib>Bellahsène, Zohra</creatorcontrib><creatorcontrib>Roantree, Mark</creatorcontrib><collection>Pascal-Francis</collection><collection>Hyper Article en Ligne (HAL)</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>O’Connor, Martin F.</au><au>Bellahsène, Zohra</au><au>Roantree, Mark</au><au>Ceri, Stefano</au><au>Bellahsène, Zohra</au><au>Unland, Rainer</au><au>Bressan, Stéphane</au><au>Hunt, Ela</au><au>Ives, Zachary G.</au><au>Rys, Michael</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An Extended Preorder Index for Optimising XPath Expressions</atitle><btitle>Database and XML Technologies</btitle><date>2005</date><risdate>2005</risdate><issue>3671</issue><spage>114</spage><epage>128</epage><pages>114-128</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540285830</isbn><isbn>9783540285830</isbn><eisbn>9783540319689</eisbn><eisbn>3540319689</eisbn><abstract>Many of the problems with native XML databases relate to query performance and subsequently, it can be difficult to convince traditional database users of the benefits of using semi- or unstructured databases. Presently, there still lacks an index structure providing efficient support for structural queries and the traditional data-centric and content queries. This paper presents an extended index structure based on the preorder traversal rank and the level (or depth) rank of each node in a document tree. The extended index fully supports the navigation of all XPath axes while efficiently supporting data-centric queries. The ability to start path traversals from arbitrary nodes in a document tree also enables the extended index to support the evaluation of path traversals embedded in XQuery expressions. Furthermore, an encoding technique is presented where properties of the level ranking may be exploited to provide efficient and optimised level-based XPath evaluations.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11547273_9</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0003-2031-0519</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Database and XML Technologies, 2005 (3671), p.114-128 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_lirmm_00106099v1 |
| source | Springer Books |
| subjects | Applied sciences Arbitrary Node Computer science control theory systems Document Tree Exact sciences and technology Information systems. Data bases Level Index Level Rank Location Step Memory organisation. Data processing Software |
| title | An Extended Preorder Index for Optimising XPath Expressions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T05%3A10%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20Extended%20Preorder%20Index%20for%20Optimising%20XPath%20Expressions&rft.btitle=Database%20and%20XML%20Technologies&rft.au=O%E2%80%99Connor,%20Martin%20F.&rft.date=2005&rft.issue=3671&rft.spage=114&rft.epage=128&rft.pages=114-128&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540285830&rft.isbn_list=9783540285830&rft_id=info:doi/10.1007/11547273_9&rft_dat=%3Chal_pasca%3Eoai_HAL_lirmm_00106099v1%3C/hal_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540319689&rft.eisbn_list=3540319689&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |