Tree Signatures for XML Querying and Navigation
In order to accelerate execution of various matching and navigation operations on collections of XML documents, new indexing structure, based on tree signatures, is proposed. We show that XML tree structures can be efficiently represented as ordered sequences of preorder and postorder ranks, on whic...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 163 |
|---|---|
| container_issue | |
| container_start_page | 149 |
| container_title | |
| container_volume | 2824 |
| creator | Zezula, Pavel Amato, Giuseppe Debole, Franca Rabitti, Fausto |
| description | In order to accelerate execution of various matching and navigation operations on collections of XML documents, new indexing structure, based on tree signatures, is proposed. We show that XML tree structures can be efficiently represented as ordered sequences of preorder and postorder ranks, on which extended string matching techniques can easily solve the tree matching problem. We also show how to apply tree signatures in query processing and demonstrate that a speedup of up to one order of magnitude can be achieved over the containment join strategy. Other alternatives of using the tree signatures in intelligent XML searching are outlined in the conclusions. |
| doi_str_mv | 10.1007/978-3-540-39429-7_10 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_15670294</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3088074_15_159</sourcerecordid><originalsourceid>FETCH-LOGICAL-p318t-3541ca1be61ee0f18bf42013650301fe7cf2bdedce0664dacaea0d5a466694623</originalsourceid><addsrcrecordid>eNotkNtOwzAMhsNRjLE34KI3XIY5cZo2lwhxkgYIMaTdRVnrjsJoS9Ih7e3JDpYlS_bv39bH2KWAawGQjU2Wc-SpAo5GScMzK-CAnWPsbBuzQzYQWgiOqMwRG0X9ZiYB0hSO2QAQJDeZwlM2MFGSA2p5xkYhfEEMlFKlOGDjqSdK3utF4_qVp5BUrU9mz5PkbUV-XTeLxDVl8uL-6oXr67a5YCeVWwYa7euQfdzfTW8f-eT14en2ZsI7FHnP4yuicGJOWhBBJfJ5pSQI1Gn8S1SUFZWcl1QWBFqr0hWOHJSpU1pro7TEIbva-XYuFG5ZedcUdbCdr3-cX1uR6gykUVEnd7oQR82CvJ237XeIsOwGo41YLNoIxm6p2Q3GuIR7c9_-rij0ljZbBTW9d8vi03U9-WAR8hwyFY_FNPgPFKNu9Q</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3088074_15_159</pqid></control><display><type>book_chapter</type><title>Tree Signatures for XML Querying and Navigation</title><source>Springer Books</source><creator>Zezula, Pavel ; Amato, Giuseppe ; Debole, Franca ; Rabitti, Fausto</creator><contributor>Unland, Rainer ; Bellahsène, Zohra ; Chaudhri, Akmal B ; Rahm, Erhard ; Rys, Michael ; Rahm, Erhard ; Unland, Rainer ; Chaudhri, Akmal B. ; Rys, Michael ; Bellahsène, Zohra</contributor><creatorcontrib>Zezula, Pavel ; Amato, Giuseppe ; Debole, Franca ; Rabitti, Fausto ; Unland, Rainer ; Bellahsène, Zohra ; Chaudhri, Akmal B ; Rahm, Erhard ; Rys, Michael ; Rahm, Erhard ; Unland, Rainer ; Chaudhri, Akmal B. ; Rys, Michael ; Bellahsène, Zohra</creatorcontrib><description>In order to accelerate execution of various matching and navigation operations on collections of XML documents, new indexing structure, based on tree signatures, is proposed. We show that XML tree structures can be efficiently represented as ordered sequences of preorder and postorder ranks, on which extended string matching techniques can easily solve the tree matching problem. We also show how to apply tree signatures in query processing and demonstrate that a speedup of up to one order of magnitude can be achieved over the containment join strategy. Other alternatives of using the tree signatures in intelligent XML searching are outlined in the conclusions.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540200550</identifier><identifier>ISBN: 354020055X</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 354039429X</identifier><identifier>EISBN: 9783540394297</identifier><identifier>DOI: 10.1007/978-3-540-39429-7_10</identifier><identifier>OCLC: 934980362</identifier><identifier>LCCallNum: QA76.9.D35</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Content Index ; Exact sciences and technology ; Longe Common Subsequence ; Query Node ; Query Processing ; Software ; Tree Signature</subject><ispartof>Database and XML Technologies, 2003, Vol.2824, p.149-163</ispartof><rights>Springer-Verlag Berlin Heidelberg 2003</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3088074-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-39429-7_10$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-39429-7_10$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4035,4036,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15670294$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Unland, Rainer</contributor><contributor>Bellahsène, Zohra</contributor><contributor>Chaudhri, Akmal B</contributor><contributor>Rahm, Erhard</contributor><contributor>Rys, Michael</contributor><contributor>Rahm, Erhard</contributor><contributor>Unland, Rainer</contributor><contributor>Chaudhri, Akmal B.</contributor><contributor>Rys, Michael</contributor><contributor>Bellahsène, Zohra</contributor><creatorcontrib>Zezula, Pavel</creatorcontrib><creatorcontrib>Amato, Giuseppe</creatorcontrib><creatorcontrib>Debole, Franca</creatorcontrib><creatorcontrib>Rabitti, Fausto</creatorcontrib><title>Tree Signatures for XML Querying and Navigation</title><title>Database and XML Technologies</title><description>In order to accelerate execution of various matching and navigation operations on collections of XML documents, new indexing structure, based on tree signatures, is proposed. We show that XML tree structures can be efficiently represented as ordered sequences of preorder and postorder ranks, on which extended string matching techniques can easily solve the tree matching problem. We also show how to apply tree signatures in query processing and demonstrate that a speedup of up to one order of magnitude can be achieved over the containment join strategy. Other alternatives of using the tree signatures in intelligent XML searching are outlined in the conclusions.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Content Index</subject><subject>Exact sciences and technology</subject><subject>Longe Common Subsequence</subject><subject>Query Node</subject><subject>Query Processing</subject><subject>Software</subject><subject>Tree Signature</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540200550</isbn><isbn>354020055X</isbn><isbn>354039429X</isbn><isbn>9783540394297</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2003</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkNtOwzAMhsNRjLE34KI3XIY5cZo2lwhxkgYIMaTdRVnrjsJoS9Ih7e3JDpYlS_bv39bH2KWAawGQjU2Wc-SpAo5GScMzK-CAnWPsbBuzQzYQWgiOqMwRG0X9ZiYB0hSO2QAQJDeZwlM2MFGSA2p5xkYhfEEMlFKlOGDjqSdK3utF4_qVp5BUrU9mz5PkbUV-XTeLxDVl8uL-6oXr67a5YCeVWwYa7euQfdzfTW8f-eT14en2ZsI7FHnP4yuicGJOWhBBJfJ5pSQI1Gn8S1SUFZWcl1QWBFqr0hWOHJSpU1pro7TEIbva-XYuFG5ZedcUdbCdr3-cX1uR6gykUVEnd7oQR82CvJ237XeIsOwGo41YLNoIxm6p2Q3GuIR7c9_-rij0ljZbBTW9d8vi03U9-WAR8hwyFY_FNPgPFKNu9Q</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Zezula, Pavel</creator><creator>Amato, Giuseppe</creator><creator>Debole, Franca</creator><creator>Rabitti, Fausto</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2003</creationdate><title>Tree Signatures for XML Querying and Navigation</title><author>Zezula, Pavel ; Amato, Giuseppe ; Debole, Franca ; Rabitti, Fausto</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p318t-3541ca1be61ee0f18bf42013650301fe7cf2bdedce0664dacaea0d5a466694623</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Content Index</topic><topic>Exact sciences and technology</topic><topic>Longe Common Subsequence</topic><topic>Query Node</topic><topic>Query Processing</topic><topic>Software</topic><topic>Tree Signature</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zezula, Pavel</creatorcontrib><creatorcontrib>Amato, Giuseppe</creatorcontrib><creatorcontrib>Debole, Franca</creatorcontrib><creatorcontrib>Rabitti, Fausto</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zezula, Pavel</au><au>Amato, Giuseppe</au><au>Debole, Franca</au><au>Rabitti, Fausto</au><au>Unland, Rainer</au><au>Bellahsène, Zohra</au><au>Chaudhri, Akmal B</au><au>Rahm, Erhard</au><au>Rys, Michael</au><au>Rahm, Erhard</au><au>Unland, Rainer</au><au>Chaudhri, Akmal B.</au><au>Rys, Michael</au><au>Bellahsène, Zohra</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Tree Signatures for XML Querying and Navigation</atitle><btitle>Database and XML Technologies</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2003</date><risdate>2003</risdate><volume>2824</volume><spage>149</spage><epage>163</epage><pages>149-163</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540200550</isbn><isbn>354020055X</isbn><eisbn>354039429X</eisbn><eisbn>9783540394297</eisbn><abstract>In order to accelerate execution of various matching and navigation operations on collections of XML documents, new indexing structure, based on tree signatures, is proposed. We show that XML tree structures can be efficiently represented as ordered sequences of preorder and postorder ranks, on which extended string matching techniques can easily solve the tree matching problem. We also show how to apply tree signatures in query processing and demonstrate that a speedup of up to one order of magnitude can be achieved over the containment join strategy. Other alternatives of using the tree signatures in intelligent XML searching are outlined in the conclusions.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/978-3-540-39429-7_10</doi><oclcid>934980362</oclcid><tpages>15</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Database and XML Technologies, 2003, Vol.2824, p.149-163 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_15670294 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Content Index Exact sciences and technology Longe Common Subsequence Query Node Query Processing Software Tree Signature |
| title | Tree Signatures for XML Querying and Navigation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T16%3A02%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Tree%20Signatures%20for%20XML%20Querying%20and%20Navigation&rft.btitle=Database%20and%20XML%20Technologies&rft.au=Zezula,%20Pavel&rft.date=2003&rft.volume=2824&rft.spage=149&rft.epage=163&rft.pages=149-163&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540200550&rft.isbn_list=354020055X&rft_id=info:doi/10.1007/978-3-540-39429-7_10&rft_dat=%3Cproquest_pasca%3EEBC3088074_15_159%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=354039429X&rft.eisbn_list=9783540394297&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3088074_15_159&rft_id=info:pmid/&rfr_iscdi=true |