conference abstract · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · 1983
Processing queries with quantifiers a horticultural approach
Cited by 27Abstract and details only
Abstract
Most research on query processing has focussed on quantifier-free conjunctive queries. Existing techniques for processing queries with quantifiers either compile the query into a nested loop program or use variants of Codd's reduction from the Relational Calculus to the Relational Algebra. In this paper we propose an alternative technique that uses an algebra of graft and prune operations on trees. This technique provides a significant savings in space and time. We show how to transform a quantified conjunctive query into a sequence of graft and prune operations.
Cite this paper
Dayal, U. (1983). Processing queries with quantifiers a horticultural approach. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), 125. https://doi.org/10.1145/588058.588075
Dayal, Umeshwar. “Processing queries with quantifiers a horticultural approach.” ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), 1983, p. 125, https://doi.org/10.1145/588058.588075.
Dayal, Umeshwar. 1983. “Processing queries with quantifiers a horticultural approach.” ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS): 125. https://doi.org/10.1145/588058.588075.
Dayal, U. (1983) ‘Processing queries with quantifiers a horticultural approach’, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), p. 125. Available at: https://doi.org/10.1145/588058.588075.
@article{dayal1983processing,
title = {{Processing queries with quantifiers a horticultural approach}},
author = {Dayal, Umeshwar},
journal = {ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)},
pages = {125},
year = {1983},
doi = {10.1145/588058.588075}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.