Minimizing View Sets without Losing QueryAnswering Power最大限度地减少视图集而不丢失查询应答功率.pptVIP

下载本文档

2
0
约2.3万字
约 27页
2017-03-08 发布于上海
举报
版权申诉

Minimizing View Sets without Losing QueryAnswering Power最大限度地减少视图集而不丢失查询应答功率.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Minimizing View Sets without Losing QueryAnswering Power最大限度地减少视图集而不丢失查询应答功率

On Answering Queries in the Presence of Limited Access Patterns Chen Li Stanford University joint work with Edward Chang, UC Santa Barbara r(Star, Movie) r(Star, Movie) r(Star, Movie) r(Star, Movie) r(Star, Movie) General questions Given a query on relations with limited access patterns, can we compute its complete answer by accessing the relations with legal patterns? Stable queries Different classes of queries Another problem studied: testing query containment in the presence of binding patterns. Rest of the talk Binding patterns, query stability Testing stability of queries: Conjunctive queries Unions of conjunctive queries Conjunctive queries with arithmetic comparisons Datalog queries Dynamic computability of complete answer to conjunctive queries Conclusion and related work (I) Binding patterns Attributes with adornments: b: bound f: free Example: r(Starb, Movief), s(Movieb, Awardf) A relation can have multiple binding patterns. Reasons of the restrictions: Web search forms Legacy databases Security concerns Observations: If a relation does not have an “all-free” binding pattern, then after certain queries are sent to this relation, there can always be some tuples that have not been retrieved. Query stability A query Q on relations with binding patterns is stable if for any database, we can compute Q’s complete answer by accessing the relations with legal patterns. The complete answer is the computable answer if we could retrieve all the tuples from the relations. Use partial tuples to derive the complete answer: we need reasoning. Assumptions about bindings Use values from Q and results from the relations as bindings: The definition says “for any database” Relations not in the query can be assumed to be empty Not allowed: try arbitrary strings as bindings to access the relations Does not terminate Impractical (II) Testing stability of queries Conjunctive query: q(X) :- g1(X1),…,gn(Xn) Feasible order of some subgoals of a CQ Q. Each