S. Chaudhuri. Finding nonrecursive envelopes for datalog predicates. In Proceedings of the Twelfth ACM SIGACTSIGMOD -SIGART Symposium on Principles of Database Systems, May 25-28, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....although approximation is critical for query mapping (Section 1) we have seen virtually no translation efforts that stress this notion. However, approximation has been studied for query processing: First, some work aims to reduce processing cost through approximation. For instance, references [25,26] study the approximate fixpoints of Datalog predicates, and [27] uses approximate predicates as filters for expensive ones. Second, several researchers have explored accelerated but approximated query answering [28 31] to reduce response time. Third, reference [32] develops a framework for ....

....some applications may require perfect recall and hence RThresh(1) where M subsumes Q, i.e. M Q. The goal here is to find the most precise mapping (with the highest P) that subsumes the query (with R = 1) usually referred to as the minimal subsuming mapping [3] or the tight upper envelope [25,26]. We designate RThresh(1) as MinSup, since M will retrieve a minimal superset of what Q does. As the dual, other applications may instead require that a mapping return only precise answers, i.e. M Q. We can implement this closeness criterion as PThresh(1) with perfect precision. Unlike ....

[Article contains additional citation context not shown here]

S. Chaudhuri. Finding nonrecursive envelopes for datalog predicates. In Proceedings of the 12th ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems, pages 135--146, Washingtion, D.C., 1993. ACM Press, New York.

....while approximation is critical for query mapping (Section 1) we have seen virtually no translation efforts that stress this notion. However, approximation has been studied for query processing: First, some work aims to reduce processing cost through approximation. For instance, references [26, 27] study the approximate fixpoints of Datalog predicates, and [28] uses approximate predicates as filters for expensive ones. Second, several researchers have explored accelerated but approximated query answering to reduce response time [29, 30, 31, 32] Third, reference [33] develops a framework ....

....some applications may require perfect recall and hence RThresh(1) where M subsumes Q, i.e. M Q. The goal here is to find the most precise mapping (with the highest P) that subsumes the query (with R = 1) usually referred to as the minimal subsuming mapping [3] or the tight upper envelope [26, 27]. We designate RThresh(1) as MinSup, since M will retrieve a minimal superset of what Q does. As the dual, other applications may instead require that a mapping return only precise answers, i.e. M Q. We can implement this closeness criterion as PThresh(1) with perfect precision. Unlike MinSup, ....

[Article contains additional citation context not shown here]

S. Chaudhuri. Finding nonrecursive envelopes for datalog predicates. In Proc. of the 12th ACM PODS, Washingtion, D.C., 1993.

....while approximation is critical for query mapping (Section 1) we have seen virtually no translation efforts that stress this notion. However, approximation has been studied for query processing: First, some work aims to reduce processing cost through approximation. For instance, references [26, 27] study the approximate fixpoints of Datalog predicates, and [28] uses 4 M Q Q M false positive false negative Figure 1: Venn diagram of a query Q and its mapping M . approximate predicates as filters for expensive ones. Second, several researchers have explored accelerated but approximated ....

....some applications may require perfect recall and hence RThresh(1) where M subsumes Q, i.e. M Q. The goal here is to find the most precise mapping (with the highest P) that subsumes the query (with R = 1) usually referred to as the minimal subsuming mapping [3] or the tight upper envelope [26, 27]. We designate RThresh(1) as MinSup, since M will retrieve a minimal superset of what Q does. As the dual, other applications may instead require that a mapping return only precise answers, i.e. M Q. We can implement this closeness criterion as PThresh(1) with perfect precision. Unlike MinSup, ....

[Article contains additional citation context not shown here]

S. Chaudhuri. Finding nonrecursive envelopes for datalog predicates. In Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 135--146, Washingtion, D.C., 1993. ACM Press, New York.

....is sufficient to only request information from the BMW and the Honda database. Approximating a relation by two views is studied in the context of predicate caching (Keller Basu 1996) and in relation to the question of whether datalog programs can be approximated by unions of conjunctive queries (Chaudhuri 1993; Chaudhuri Kolaitis 1994) Our terminonolgy of conservative and liberal views is adopted from (Keller Basu 1996) The work of Chaudhuri in (Chaudhuri 1993) and Chaudhuri and Kolaitis in (Chaudhuri Kolaitis 1994) is of interest here because it points to limitations of the source centric ....

.... (Keller Basu 1996) and in relation to the question of whether datalog programs can be approximated by unions of conjunctive queries (Chaudhuri 1993; Chaudhuri Kolaitis 1994) Our terminonolgy of conservative and liberal views is adopted from (Keller Basu 1996) The work of Chaudhuri in (Chaudhuri 1993) and Chaudhuri and Kolaitis in (Chaudhuri Kolaitis 1994) is of interest here because it points to limitations of the source centric approach. If for example an information source stores the transitive closure of a predicate p, then there are no nonrecursive views that could be used as close ....

Chaudhuri, S. 1993. Finding nonrecursive envelopes for datalog predicates. In Proc. 12th ACM PODS.

No context found.

S. Chaudhuri. Finding nonrecursive envelopes for datalog predicates. In Proceedings of the Twelfth ACM SIGACTSIGMOD -SIGART Symposium on Principles of Database Systems, May 25-28, 1993.

No context found.

Surajit Chaudhuri. Finding nonrecursive envelopes for datalog predicates. In Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 135 -- 146, 1993.

No context found.

Surajit Chaudhuri. Finding nonrecursive envelopes for datalog predicates. In Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 135-146, Washingtion, D.C., 1993. ACM Press, New York.

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