Minimizing View Sets without Losing Query-Answering Power
International Conference on Database Theory(2001)
摘要
The problem of answering queries using views has been studied extensively due to its relevance in a wide variety of data-management
applications. In these applications, we often need to select a subset of views to maintain due to limited resources. In this
paper, we show that traditional query containment is not a good basis for deciding whether or not a view should be selected.
Instead, we should minimize the view set without losing its query-answering power. To formalize this notion, we first introduce the concept of “p-containment.” That is, a view set V is p-contained in another view set W, if W can answer all the queries that can be answered by V. We show that p-containment and the traditional query containment are not related. We then discuss how to minimize a view
set while retaining its query-answering power. We develop the idea further by considering p-containment of two view sets with
respect to a given set of queries, and consider their relationship in terms of maximally-contained rewritings of queries using
the views.
更多查看译文
关键词
wide variety,traditional query containment,maximally-contained rewritings,limited resource,data-management application,query-answering power,view set,good basis,minimizing view sets,data management,data warehousing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要