Chen Li. Computing complete answers to queries in the presence of limited access patterns. Journal of VLDB, 12:211--227, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Answering Queries with Database Restrictions - Research Summary Chen (2000) Self-citation (Li) (Correct)
No context found.
C. Li. Computing complete answers to queries in the presence of limited access patterns (extended version). Technical report, Computer Science Dept., Stanford Univ., 1999.
Computing Complete Answers to Queries in the Presence of Limited.. - Li (1999) (4 citations) Self-citation (Li) (Correct)
....in the context of World Wide Web, sources have diverse and limited query capabilities. For instance, many Web movie sources such as The IMDB [IMD] and Cinemachine [Cin] provide search forms for movie information. A user fills out a form # This article combines and integrates the technical report [Li99] and some content in the paper presented in the 8th International Conference on Database Theory (ICDT) London, UK, January, 2001 [LC01b] In addition to the prior materials, this article contains more results and complete proofs that were not included in the original reports. by specifying the ....
Chen Li. Computing complete answers to queries in the presence of limited access patterns (extended version). Technical report, Computer Science Dept., Stanford Univ., http://dbpubs.stanford.edu:8090/pub/1999-11, 1999.
On Answering Queries in the Presence of Limited Access Patterns - Li, Chang (2001) (11 citations) Self-citation (Li) (Correct)
....of all its subgoals, for any database of the relations, we can compute the complete answer to the query. 1 Corollary 1. A CQ is stable if it has an equivalent query that is feasible. 1 We do not provide all the proofs of the lemmas and theorems in this paper due to space limitations. Refer [15, 16] for details. The query Q 2 in Example 2 is the minimal equivalent query of Q 1 . A CQ is minimal if it has no redundant subgoals, i.e. removing any of its subgoals will yield a nonequivalent query. It is known that each CQ has a unique minimal equivalent up to renaming of variables and ....
....Algorithm CQstable shows that the problem is in NP. It is known that given a CQ Q and a CQ Q 0 that has a subset of the subgoals in Q, the problem of deciding whether Q 0 v Q is NP complete [4] It can be shown that this problem can be reduced to our stability problem in polynomial time [15]. 3.2 Stability of Unions of Conjunctive Queries Let Q = Q 1 [ Delta Delta Delta [Qn be a finite union of CQ s (UCQ for short) and all its CQ s have a common head predicate. It is known that there is a unique minimal subset of Q that is its minimal equivalent [22] Example 3. Suppose we ....
[Article contains additional citation context not shown here]
C. Li. Computing complete answers to queries in the presence of limited access patterns (extended version). Technical report, Computer Science Dept., Stanford Univ., http://dbpubs.stanford.edu:8090/pub/1999-11, 1999.
Answering Queries with Database Restrictions (Research Summary) - Li (2000) Self-citation (Li) (Correct)
....borrowing bindings from sources not mentioned in the query. We also develop an algorithm for finding all the relations that need to accessed to answer a query. 4. How to test whether by query reformulation, it is possible to compute the complete to a query on relations with binding restrictions [3]. The complete answer to a query is the answer to the query that we could compute if we could retrieve all the tuples from the relations. Since we cannot retrieve all the tuples from a relation due to its binding restrictions, we need to do reasoning about whether the answer computed by a plan is ....
C. Li. Computing complete answers to queries in the presence of limited access patterns (extended version). Technical report, Computer Science Dept., Stanford Univ., 1999.
Computing Complete Answers to Queries in the Presence of Limited.. - Li (1999) (4 citations) Self-citation (Li) (Correct)
....about movies and their stars. Its only binding pattern, bf , says that each query to s 1 must specify a star name. 1 Similarly, relation Due to space limitations, we have not provided all the proofs of the lemmas and theorems in this paper. They are available in the full version of the paper [18]. 1 Binding restrictions of relations are described as binding patterns with bf attribute adornments: b (the attribute must be bound) and f (the attribute can be free) 1 s(Movie; Award) has binding pattern bf . Consider the following query that asks for the awards of the movies in which Henry ....
C. Li. Computing complete answers to queries in the presence of limited access patterns (extended version). Technical report, Computer Science Dept., Stanford Univ., http://www-db.stanford.edu/chenli/pubs/compbp-long.ps, 1999.
Rewriting Queries Using Views with Access - Patterns Under Integrity (Correct)
No context found.
Chen Li. Computing complete answers to queries in the presence of limited access patterns. Journal of VLDB, 12:211--227, 2003.
Rewriting Queries Using Views with Access - Patterns Under Integrity (Correct)
No context found.
Chen Li. Computing complete answers to queries in the presence of limited access patterns. Journal of VLDB, 12:211--227, 2003.
Processing Unions of Conjunctive Queries with - Negation Under Limited (Correct)
No context found.
C. Li. Computing Complete Answers to Queries in the Presence of Limited Access Patterns. Journal of VLDB, 12:211--227, 2003.
Web Service Composition Through Declarative Queries: - The Case Of (Correct)
No context found.
C. Li. Computing complete answers to queries in the presence of limited access patterns. Journal of VLDB, 12:211-- 227, 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC