On Two Forms of Structural Recursion (1995)
Cached
Download Links
- [www.cs.washington.edu]
- [sdmc.krdl.org.sg:8080]
- [ftp.cis.upenn.edu]
- [sdmc.krdl.org.sg]
- DBLP
Other Repositories/Bibliography
| Venue: | in "LNCS 893: Proceedings of 5th International Conference on Database Theory," 111--124 |
| Citations: | 16 - 11 self |
BibTeX
@INPROCEEDINGS{Suciu95ontwo,
author = {Dan Suciu and Limsoon Wong},
title = {On Two Forms of Structural Recursion},
booktitle = {in "LNCS 893: Proceedings of 5th International Conference on Database Theory," 111--124},
year = {1995},
pages = {111--124},
publisher = {Springer Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. We investigate and compare two forms of recursion on sets for querying nested collections. The first one is called sri and it corresponds to sequential processing of data. The second one is called sru and it corresponds to data-parallel processing. A uniform first-order translation from sru into sri was known from previous work. The converse translation is by necessity more difficult and we have obtained three main results concerning it. First, we exhibit a uniform translation of sri queries into sru queries over the nested relational algebra. We observe that this translation maps PTIME algorithms into exponential-space queries. The second result proves that any uniform translation of sri queries into sru queries over the nested relational algebra must map some PTIME queries into exponential-space ones. In fact, in the presence of certain external functions, we provide a PTIME sri query for which any equivalent sru query requires exponential space. Thus, as a mechanism for implemen...
