Structural Recursion on Ordered Trees and List-Based Complex Objects: Expressiveness and PTIME Restrictions
XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. In this paper we investigate the expressive power provided in this regard by structural recursion. We show that the combination of vertical recursion down a tree combined with horizonta...
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 | 358 |
|---|---|
| container_issue | |
| container_start_page | 344 |
| container_title | |
| container_volume | |
| creator | Robertson, Edward L. Saxton, Lawrence V. Van Gucht, Dirk Vansummeren, Stijn |
| description | XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. In this paper we investigate the expressive power provided in this regard by structural recursion. We show that the combination of vertical recursion down a tree combined with horizontal recursion across a list of trees gives rise to a robust class of transformations: it captures the class of all primitive recursive queries. Since queries are expected to be computable in at most polynomial time for all practical purposes, we next identify a restriction of structural recursion that captures the polynomial time queries. Although this restriction is semantical in nature, and therefore undecidable, we provide an effective syntax. We also give corresponding results for list-based complex objects. |
| doi_str_mv | 10.1007/11965893_24 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19104828</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19104828</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-b0412e0216ef8cdaecbadf647e4a0f07966d993bdeae2e56a6c6586f4ce8dcb63</originalsourceid><addsrcrecordid>eNpNkM1LxDAQxeMXuK578h_oxYOH6kySTZuj1k9YWNAVvIU0mUrXbluSLuh_b2VFHB4MvN9jYB5jZwiXCJBdIWo1z7UwXO6xEzGXoDTPQOyzCSrEVAipD_6A0m-HbAICeKozKY7ZLMY1jCMwQ6Em7PZlCFs3bINtkmdy2xDrrk1GLYOnQD5ZBaKY2NYnizoO6Y2No1l0m76hz2RZrskN8ZQdVbaJNPvdU_Z6f7cqHtPF8uGpuF6kPUc9pCVI5AQcFVW585ZcaX2lZEbSQgWZVsprLUpPljjNlVVufFVV0lHuXanElJ3v7vY2OttUwbaujqYP9caGL4MaQeY8H3MXu1wcUftOwZRd9xENgvnp0PzrUHwD4wtfJw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Structural Recursion on Ordered Trees and List-Based Complex Objects: Expressiveness and PTIME Restrictions</title><source>Springer Books</source><creator>Robertson, Edward L. ; Saxton, Lawrence V. ; Van Gucht, Dirk ; Vansummeren, Stijn</creator><contributor>Schwentick, Thomas ; Suciu, Dan</contributor><creatorcontrib>Robertson, Edward L. ; Saxton, Lawrence V. ; Van Gucht, Dirk ; Vansummeren, Stijn ; Schwentick, Thomas ; Suciu, Dan</creatorcontrib><description>XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. In this paper we investigate the expressive power provided in this regard by structural recursion. We show that the combination of vertical recursion down a tree combined with horizontal recursion across a list of trees gives rise to a robust class of transformations: it captures the class of all primitive recursive queries. Since queries are expected to be computable in at most polynomial time for all practical purposes, we next identify a restriction of structural recursion that captures the polynomial time queries. Although this restriction is semantical in nature, and therefore undecidable, we provide an effective syntax. We also give corresponding results for list-based complex objects.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 354069269X</identifier><identifier>ISBN: 9783540692690</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540692703</identifier><identifier>EISBN: 9783540692706</identifier><identifier>DOI: 10.1007/11965893_24</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Complex Object ; Computer science; control theory; systems ; Exact sciences and technology ; Information systems. Data bases ; Memory organisation. Data processing ; Polynomial Time ; Query Language ; Recursive Function ; Software ; Turing Machine</subject><ispartof>Database Theory – ICDT 2007, 2006, p.344-358</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11965893_24$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11965893_24$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19104828$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Schwentick, Thomas</contributor><contributor>Suciu, Dan</contributor><creatorcontrib>Robertson, Edward L.</creatorcontrib><creatorcontrib>Saxton, Lawrence V.</creatorcontrib><creatorcontrib>Van Gucht, Dirk</creatorcontrib><creatorcontrib>Vansummeren, Stijn</creatorcontrib><title>Structural Recursion on Ordered Trees and List-Based Complex Objects: Expressiveness and PTIME Restrictions</title><title>Database Theory – ICDT 2007</title><description>XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. In this paper we investigate the expressive power provided in this regard by structural recursion. We show that the combination of vertical recursion down a tree combined with horizontal recursion across a list of trees gives rise to a robust class of transformations: it captures the class of all primitive recursive queries. Since queries are expected to be computable in at most polynomial time for all practical purposes, we next identify a restriction of structural recursion that captures the polynomial time queries. Although this restriction is semantical in nature, and therefore undecidable, we provide an effective syntax. We also give corresponding results for list-based complex objects.</description><subject>Applied sciences</subject><subject>Complex Object</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Memory organisation. Data processing</subject><subject>Polynomial Time</subject><subject>Query Language</subject><subject>Recursive Function</subject><subject>Software</subject><subject>Turing Machine</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>354069269X</isbn><isbn>9783540692690</isbn><isbn>3540692703</isbn><isbn>9783540692706</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkM1LxDAQxeMXuK578h_oxYOH6kySTZuj1k9YWNAVvIU0mUrXbluSLuh_b2VFHB4MvN9jYB5jZwiXCJBdIWo1z7UwXO6xEzGXoDTPQOyzCSrEVAipD_6A0m-HbAICeKozKY7ZLMY1jCMwQ6Em7PZlCFs3bINtkmdy2xDrrk1GLYOnQD5ZBaKY2NYnizoO6Y2No1l0m76hz2RZrskN8ZQdVbaJNPvdU_Z6f7cqHtPF8uGpuF6kPUc9pCVI5AQcFVW585ZcaX2lZEbSQgWZVsprLUpPljjNlVVufFVV0lHuXanElJ3v7vY2OttUwbaujqYP9caGL4MaQeY8H3MXu1wcUftOwZRd9xENgvnp0PzrUHwD4wtfJw</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Robertson, Edward L.</creator><creator>Saxton, Lawrence V.</creator><creator>Van Gucht, Dirk</creator><creator>Vansummeren, Stijn</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>Structural Recursion on Ordered Trees and List-Based Complex Objects</title><author>Robertson, Edward L. ; Saxton, Lawrence V. ; Van Gucht, Dirk ; Vansummeren, Stijn</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-b0412e0216ef8cdaecbadf647e4a0f07966d993bdeae2e56a6c6586f4ce8dcb63</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Complex Object</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Memory organisation. Data processing</topic><topic>Polynomial Time</topic><topic>Query Language</topic><topic>Recursive Function</topic><topic>Software</topic><topic>Turing Machine</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Robertson, Edward L.</creatorcontrib><creatorcontrib>Saxton, Lawrence V.</creatorcontrib><creatorcontrib>Van Gucht, Dirk</creatorcontrib><creatorcontrib>Vansummeren, Stijn</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Robertson, Edward L.</au><au>Saxton, Lawrence V.</au><au>Van Gucht, Dirk</au><au>Vansummeren, Stijn</au><au>Schwentick, Thomas</au><au>Suciu, Dan</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Structural Recursion on Ordered Trees and List-Based Complex Objects: Expressiveness and PTIME Restrictions</atitle><btitle>Database Theory – ICDT 2007</btitle><date>2006</date><risdate>2006</risdate><spage>344</spage><epage>358</epage><pages>344-358</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>354069269X</isbn><isbn>9783540692690</isbn><eisbn>3540692703</eisbn><eisbn>9783540692706</eisbn><abstract>XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. In this paper we investigate the expressive power provided in this regard by structural recursion. We show that the combination of vertical recursion down a tree combined with horizontal recursion across a list of trees gives rise to a robust class of transformations: it captures the class of all primitive recursive queries. Since queries are expected to be computable in at most polynomial time for all practical purposes, we next identify a restriction of structural recursion that captures the polynomial time queries. Although this restriction is semantical in nature, and therefore undecidable, we provide an effective syntax. We also give corresponding results for list-based complex objects.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11965893_24</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Database Theory – ICDT 2007, 2006, p.344-358 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19104828 |
| source | Springer Books |
| subjects | Applied sciences Complex Object Computer science control theory systems Exact sciences and technology Information systems. Data bases Memory organisation. Data processing Polynomial Time Query Language Recursive Function Software Turing Machine |
| title | Structural Recursion on Ordered Trees and List-Based Complex Objects: Expressiveness and PTIME Restrictions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T19%3A16%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Structural%20Recursion%20on%20Ordered%20Trees%20and%20List-Based%20Complex%20Objects:%20Expressiveness%20and%20PTIME%20Restrictions&rft.btitle=Database%20Theory%20%E2%80%93%20ICDT%202007&rft.au=Robertson,%20Edward%20L.&rft.date=2006&rft.spage=344&rft.epage=358&rft.pages=344-358&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=354069269X&rft.isbn_list=9783540692690&rft_id=info:doi/10.1007/11965893_24&rft_dat=%3Cpascalfrancis_sprin%3E19104828%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540692703&rft.eisbn_list=9783540692706&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |