Securing XML Query Processing Storage

Securing XML Query Processing Storage

The effective processing of semi-structured data queries is a preliminary part of data mining stage. XML queries employ regular path expressions to find structural patterns within XML documents. The operation of structural join is a crucial part of XML query processing. Existing approaches reduce co...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:AJIS. Australasian journal of information systems 2005-11, Vol.13 (1)
Hauptverfasser: Shoniregun, Charles, Logvynovskiy, Oleksandr, Lu, Kevin
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Data mining
Extensible Markup Language
Queries
Query processing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 1
container_start_page
container_title AJIS. Australasian journal of information systems
container_volume 13
creator Shoniregun, Charles
Logvynovskiy, Oleksandr
Lu, Kevin
description The effective processing of semi-structured data queries is a preliminary part of data mining stage. XML queries employ regular path expressions to find structural patterns within XML documents. The operation of structural join is a crucial part of XML query processing. Existing approaches reduce complex join expressions to several binary structural joins. In this paper, we are proposing a new structural join algorithm called sequence join algorithm, for sequential regular path expressions in securing XML query processing storage. It exploits information about position of the elements in a product to skip generation of the redundant intermediate lists. This paper further discusses the algorithm that performs the merge of several input lists of nodes in one pass. We carried out comparative experiments, and the results prove that the algorithm is better than multiple binary joins algorithm for queries of both small and large cardinality.
doi_str_mv 10.3127/ajis.v13i1.68
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2546080747</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2546080747</sourcerecordid><originalsourceid>FETCH-LOGICAL-c151t-41f60357390779982383747d8fe4252e75d38b6ef75817aaef1debd2bcddc1e33</originalsourceid><addsrcrecordid>eNpNkE1Lw0AYhBdRsFaP3gPiMXHf_c5Ril8QUamCt2Wz-6YkaFN3G6H_3sR68DTDMMzAQ8g50IID01eua1PxDbyFQpkDMgMhytwoMIf__DE5SamjVCkjyxm5XKIfYrteZe-PVfYyYNxlz7H3mNIULrd9dCs8JUeN-0h49qdz8nZ787q4z6unu4fFdZV7kLDNBTSKcql5SbUuS8O44VroYBoUTDLUMnBTK2y0NKCdwwYC1oHVPgQPyPmcXOx3N7H_GjBtbdcPcT1eWiaFooaOc2Mr37d87FOK2NhNbD9d3FmgdiJhJxL2l4RVhv8A4I9QrA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2546080747</pqid></control><display><type>article</type><title>Securing XML Query Processing Storage</title><source>DOAJ Directory of Open Access Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><source>Free E- Journals</source><creator>Shoniregun, Charles ; Logvynovskiy, Oleksandr ; Lu, Kevin</creator><creatorcontrib>Shoniregun, Charles ; Logvynovskiy, Oleksandr ; Lu, Kevin</creatorcontrib><description>The effective processing of semi-structured data queries is a preliminary part of data mining stage. XML queries employ regular path expressions to find structural patterns within XML documents. The operation of structural join is a crucial part of XML query processing. Existing approaches reduce complex join expressions to several binary structural joins. In this paper, we are proposing a new structural join algorithm called sequence join algorithm, for sequential regular path expressions in securing XML query processing storage. It exploits information about position of the elements in a product to skip generation of the redundant intermediate lists. This paper further discusses the algorithm that performs the merge of several input lists of nodes in one pass. We carried out comparative experiments, and the results prove that the algorithm is better than multiple binary joins algorithm for queries of both small and large cardinality.</description><identifier>ISSN: 1449-8618</identifier><identifier>EISSN: 1449-8618</identifier><identifier>EISSN: 1326-2238</identifier><identifier>DOI: 10.3127/ajis.v13i1.68</identifier><language>eng</language><publisher>Wollongong: Australasian Association for Information Systems</publisher><subject>Algorithms ; Data mining ; Extensible Markup Language ; Queries ; Query processing</subject><ispartof>AJIS. Australasian journal of information systems, 2005-11, Vol.13 (1)</ispartof><rights>2005. This work is published under https://creativecommons.org/licenses/by-nc/4.0 (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,864,27924,27925</link.rule.ids></links><search><creatorcontrib>Shoniregun, Charles</creatorcontrib><creatorcontrib>Logvynovskiy, Oleksandr</creatorcontrib><creatorcontrib>Lu, Kevin</creatorcontrib><title>Securing XML Query Processing Storage</title><title>AJIS. Australasian journal of information systems</title><description>The effective processing of semi-structured data queries is a preliminary part of data mining stage. XML queries employ regular path expressions to find structural patterns within XML documents. The operation of structural join is a crucial part of XML query processing. Existing approaches reduce complex join expressions to several binary structural joins. In this paper, we are proposing a new structural join algorithm called sequence join algorithm, for sequential regular path expressions in securing XML query processing storage. It exploits information about position of the elements in a product to skip generation of the redundant intermediate lists. This paper further discusses the algorithm that performs the merge of several input lists of nodes in one pass. We carried out comparative experiments, and the results prove that the algorithm is better than multiple binary joins algorithm for queries of both small and large cardinality.</description><subject>Algorithms</subject><subject>Data mining</subject><subject>Extensible Markup Language</subject><subject>Queries</subject><subject>Query processing</subject><issn>1449-8618</issn><issn>1449-8618</issn><issn>1326-2238</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNpNkE1Lw0AYhBdRsFaP3gPiMXHf_c5Ril8QUamCt2Wz-6YkaFN3G6H_3sR68DTDMMzAQ8g50IID01eua1PxDbyFQpkDMgMhytwoMIf__DE5SamjVCkjyxm5XKIfYrteZe-PVfYyYNxlz7H3mNIULrd9dCs8JUeN-0h49qdz8nZ787q4z6unu4fFdZV7kLDNBTSKcql5SbUuS8O44VroYBoUTDLUMnBTK2y0NKCdwwYC1oHVPgQPyPmcXOx3N7H_GjBtbdcPcT1eWiaFooaOc2Mr37d87FOK2NhNbD9d3FmgdiJhJxL2l4RVhv8A4I9QrA</recordid><startdate>20051101</startdate><enddate>20051101</enddate><creator>Shoniregun, Charles</creator><creator>Logvynovskiy, Oleksandr</creator><creator>Lu, Kevin</creator><general>Australasian Association for Information Systems</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20051101</creationdate><title>Securing XML Query Processing Storage</title><author>Shoniregun, Charles ; Logvynovskiy, Oleksandr ; Lu, Kevin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c151t-41f60357390779982383747d8fe4252e75d38b6ef75817aaef1debd2bcddc1e33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithms</topic><topic>Data mining</topic><topic>Extensible Markup Language</topic><topic>Queries</topic><topic>Query processing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shoniregun, Charles</creatorcontrib><creatorcontrib>Logvynovskiy, Oleksandr</creatorcontrib><creatorcontrib>Lu, Kevin</creatorcontrib><collection>CrossRef</collection><jtitle>AJIS. Australasian journal of information systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shoniregun, Charles</au><au>Logvynovskiy, Oleksandr</au><au>Lu, Kevin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Securing XML Query Processing Storage</atitle><jtitle>AJIS. Australasian journal of information systems</jtitle><date>2005-11-01</date><risdate>2005</risdate><volume>13</volume><issue>1</issue><issn>1449-8618</issn><eissn>1449-8618</eissn><eissn>1326-2238</eissn><abstract>The effective processing of semi-structured data queries is a preliminary part of data mining stage. XML queries employ regular path expressions to find structural patterns within XML documents. The operation of structural join is a crucial part of XML query processing. Existing approaches reduce complex join expressions to several binary structural joins. In this paper, we are proposing a new structural join algorithm called sequence join algorithm, for sequential regular path expressions in securing XML query processing storage. It exploits information about position of the elements in a product to skip generation of the redundant intermediate lists. This paper further discusses the algorithm that performs the merge of several input lists of nodes in one pass. We carried out comparative experiments, and the results prove that the algorithm is better than multiple binary joins algorithm for queries of both small and large cardinality.</abstract><cop>Wollongong</cop><pub>Australasian Association for Information Systems</pub><doi>10.3127/ajis.v13i1.68</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1449-8618
ispartof AJIS. Australasian journal of information systems, 2005-11, Vol.13 (1)
issn 1449-8618
1449-8618
1326-2238
language eng
recordid cdi_proquest_journals_2546080747
source DOAJ Directory of Open Access Journals; EZB-FREE-00999 freely available EZB journals; Free E- Journals
subjects Algorithms
Data mining
Extensible Markup Language
Queries
Query processing
title Securing XML Query Processing Storage
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T01%3A18%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Securing%20XML%20Query%20Processing%20Storage&rft.jtitle=AJIS.%20Australasian%20journal%20of%20information%20systems&rft.au=Shoniregun,%20Charles&rft.date=2005-11-01&rft.volume=13&rft.issue=1&rft.issn=1449-8618&rft.eissn=1449-8618&rft_id=info:doi/10.3127/ajis.v13i1.68&rft_dat=%3Cproquest_cross%3E2546080747%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2546080747&rft_id=info:pmid/&rfr_iscdi=true