Abstract
The principles of queries that allow incomplete answers are presented. Partial answers make it necessary to refine the model of query evaluation. The first modification relates to the satisfaction of conditions, under some circumstances, conditions involving unbound variables as satisfied are considered. Second, in order to prevent a proliferation of answers, only answers that are maximal in the sense that there are no assignments that bind more variables and satisfy the conditions of the query, are accepted. The mode of query evaluation consists of two phases, a search phase and a filter phase. The containment problem for queries consisting only of search constraints under the different semantics are investigated.
Cite
CITATION STYLE
Kanza, Y., Nutt, W., & Sagiv, Y. (1999). Queries with incomplete answers over semistructured data. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (pp. 227–236). ACM Transactions on Intelligent Systems and Technology. https://doi.org/10.1145/303976.303999
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.