A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In PODS Conference 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....The school reviews, if the data were available, would also be a good candidate for storage in XCacheDB, for improved performance. A query such as this can be built graphically with EXIP s metadata aware query and view builder. For more detail on the components of EXIP, please refer to [39]. In the next section, we discuss briefly how such a query is processed by the EXIP Mediator. 3 Mediator Query Processing Architecture As we described earlier, the Mediator inputs an XQuery, one or more optional view definitions (also in XQuery) a description of the sources and optional XML ....

A. Rajaraman, Y. Sagiv, and J. Ullman. Answering queries using templates with binding patterns. In Proc. PODS Conf., pages 105--112, 1995.

....programmers. 6. 1 Related Work Perhaps the most relevant ongoing work relates to various e orts to provide tools for information integration [2, 8, 10, 13 15] Of particular relevance is more recent work along this line that assume binding patterns limit how information sources can be accessed [7, 17]. See [20] for an excellent overview of this line of work, circa 1997. Although the query semantics may di er (e.g. nd as much as you can semantics) e orts along this line share the common goal of attempting to provide a uniform conceptual interface to existing legacy information sources. ....

Anand Rajaraman, Yehoshua Sagiv, and Jerey D. Ullman. Answering queries using templates with binding patterns. In ACM Symposium on Principles of Database Systems, pages 105-112, 1995.

....surprising since CONDENSE runs in O(n km) time while the problem it is trying to solve, namely TSMP, is intractable. Query templates using attribute adornments have been employed to describe sets of answerable queries in many research prototypes [14, 28, 29, 40, 51, 72] and recent literature [17, 59, 80]. The main emphasis of this body of research is on issues surrounding query planning, as opposed to interface design. By focusing on the problem of efficient interface design for templates, the solutions developed in this chapter complement this body of research. Our solutions can be employed by ....

A. Rajaraman, Y. Sagiv, J. Ullman. Answering Queries Using Templates With Binding Patterns. In Proc. PODS Conference, 1995.

....download all its books. Instead, we can query the source by filling out Web search forms and retrieving the results. Studies have been conducted on how model and compute source capabilities, how to generate plans for queries, and how to optimize queries in the presence of limited capabilities [14, 20]. Here we give three of the many open problems in data integration that need more research investigation. First, most previous mediation systems adopt a centralized architecture. Recently, database applications are seeing the emerging need to support data integration and sharing in distributed, ....

A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In PODS, pages 105--112, 1995.

....proofs for the propositions will be given in the extended version of this paper. It seems interesting to establish connections of our results with some work already done by the database community. Some related issues have to do with: 1) Querying a database by means of restricted query languages [4, 6, 8]. 2) Characterizing consistency repair as done in [2] Acknowledgments This research has been partially supported by FONDECYT Grants (1971304 1980945) and a NSF Grant (IRI9632870) Part of this research was done when the second author was on sabbatical at the Technical University of Berlin ....

A. Rajaraman, Y. Sagiv, and J. Ullman. Answering Queries Using Templates with Binding Patterns. In Proc. Symposiun on Principles of Database Systems (PODS'95), pages 105-- 112. ACM Press, 1995.

....a wrapper interfacing an online bookstore may only support queries that indicate the name of the author or the title of the book searched, because this is the only interaction authorized by the form based Web interface. Therefore the optimizer must compose a plan under feasibility constraints [5, 9, 12, 14, 16]. Secondly, the optimizer must perform its optimization under cost models that estimate communication and source processing costs in a volatile environment, where none of these gures are precisely known nor can be controlled. For example (as we have all experienced as Web users) the response time ....

A. Rajaraman, Y. Sagiv, J. D. Ullman. Answering queries using templates with binding patterns. Proceedings of the 14th ACM Symposium on Principles of Database Systems, 1995, pp. 105-112.

....on this problem (Section 2) We give a result on the existence of a single containment mapping between two CQAC queries, which is a stronger than that of [17, 20] In Section 3, we study the decidability of the problem. We rst prove the decidability for the ER case by extending a result in [28]. In particular, we can use nite unions of CQAC queries to represent ERs. We then address the problem of nding MCRs. We prove that if all view variables are distinguished, the problem is decidable, and nite unions of CQACs are expressive enough to represent MCRs. In Section 4 we consider the ....

A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In PODS, pages 105-112, 1995.

....be computed. We develop a decision tree that guides the planning process to compute the complete answer to a conjunctive query. 1. 1 Related Work Several works have considered binding restrictions in the context of answering queries using views [DL97, LMSS95, Qia96] Rajaraman, Sagiv, and Ullman [RSU95] proposed algorithms for answering queries using views with binding patterns. In that paper all solutions to a query compute the complete answer to the query; thus only stable queries are handled. Duschka and Levy [DL97] solved the same problem by translating source restrictions into recursive ....

....stable queries are handled. Duschka and Levy [DL97] solved the same problem by translating source restrictions into recursive rules in a datalog program to obtain the maximally contained rewriting of a query, but the rewriting does not necessarily compute the query s complete answer. Notice in [RSU95, DL97] binding patterns can be on views that are defined over base relations, while in our paper binding patterns are over the base relations themselves. A query on relations with binding restrictions can be generated by a view expansion process at mediators as in TSIMMIS. LYV 98] studied ....

[Article contains additional citation context not shown here]

Anand Rajaraman, Yehoshua Sagiv, and Je#rey D. Ullman. Answering queries using templates with binding patterns. In PODS, pages 105--112, 1995.

.... concept even more flexible, by allowing more complicated physical storage schemas in addition to the base relations and indexes: relational materialized views [LMSS95, Lev, CKPS95] join indexes [Val87] access support relations for OO databases [KM90a, KM90b] sources with limited capabilities [RSU95, LRO96, FLMS99] GMAPs [TSI96] etc. In all these cases, the elements of the physical schema are defined as queries (views) over the logical schema. The advantage is that the logical schema is then fixed while the physical schema can be easily changed in order to achieve better storage, faster ....

.... JI (ffi JI ) 8(d 2 domDept) 8(s 2 Dept [ d ] DProjs) 8(p 2 Proj) s = p:PName ) 9(j 2 JI) j:DOID = d and j:PN = p:PName ] Source capabilities often used in information integration systems can be described by either such materialized views or by dictionaries modeling the binding patterns of [RSU95] Join indexes [Val87] were introduced as a technique for join navigation and shown to outperform even hybrid hash join in most cases with high join selectivity. The technique assumes that tuples have unique, system generated identifiers called surrogates (if the relations have keys, these can ....

[Article contains additional citation context not shown here]

A. Rajaraman, Y. Sagiv, and J.D. Ullman. Answering queries using templates with binding patterns. In Proc. 14th ACM Symposium on Principles of Database Systems, pages 105--112, 1995.

....of the logical schema from the physical implementation, while in information integration systems most difficulties come from heterogeneity. There have been several research efforts investigating physical data independence as the central issue [45, 20] or investigating closely related problems [48, 16, 27, 15, 30, 39, 38]. All of them recognize physical data independence as an optimization problem: rewrite a query Q( written against a logical schema into an equivalent query plan Q ( Phi) written against a physical schema Phi, given a semantic relationship between and Phi. The question is how to define, ....

.... but this work goes beyond gmaps, while for object oriented data independence it goes beyond the approach of [28] In fact, we have originally been motivated by our interest in distributed, mediator based systems [47] for information integration, where it turns out that the techniques presented in [15, 30, 39, 38] are neither general enough nor flexible enough to be adapted to the problems we wish to solve. Moreover, we present our technique in a form that is easy to integrate in the rule based paradigm [17] and easy to combine with conventional optimization techniques [41] such as selection pushing and ....

[Article contains additional citation context not shown here]

A. Rajaraman, Y. Sagiv, and J.D. Ullman. Answering queries using templates with binding patterns. In Proc. 14th ACM Symposium on Principles of Database Systems, pages 105--112, 1995.

No context found.

A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In PODS Conference 1995.

No context found.

A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In PODS, pages 105--112, 1995.

No context found.

A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In PODS, pages 105--112, 1995.

No context found.

A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In PODS Conference 1995.

No context found.

A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. ACM Symposium on Principles of Database Systems (PODS), pages 105--112, 1995.

No context found.

A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In Proc. of ACM Symposium on Principles of Database Systems (PODS), pages 105--112, 1995.

No context found.

Anand Rajaraman, Yehoshua Sagiv, and Jeffrey D. Ullman. Answering queries using templates with binding patterns. In PODS, 1995.

No context found.

Anand Rajaraman, Yehoshua Sagiv, and Jeffrey D. Ullman. Answering queries using templates with binding patterns. In Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1995.

No context found.

Anand Rajaraman, Yehoshua Sagiv, and Jerey D. Ullman. Answering queries using templates with binding patterns. In Proc. of the 14th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'95), 1995.

No context found.

Anand Rajaraman, Yehoshua Sagiv, and Jerey D. Ullman. Answering queries using templates with binding patterns. In Proc. of PODS, pages 105-112, San Jose, CA, 1995.

No context found.

Anand Rajaraman, Yehoshua Sagiv, and Jerey D. Ullman. Answering queries using templates with binding patterns. In Proc. of the 14th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'95), 1995. 24

No context found.

A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In Proc. of PODS, pages 105-112, San Jose, CA, 1995.

No context found.

Anand Rajaraman, Yehoshua Sagiv, and Jeffrey D. Ullman. Answering queries using templates with binding patterns. In Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 22-25, 1995, San Jose, California, pages 105--112, 1995.

No context found.

Anand Rajaraman, Yehoshua Sagiv, and Jerey D. Ullman. Answering queries using templates with binding patterns. In Proceedings of the 14th ACM pages 105-112, San Jose, Calif., May 1995.

No context found.

A. Rajaraman, Y. Sayiv, and J.D. Ullman, "Answering Queries Using Templates with Binding Patterns," Proc. ACMSymp. Principles of Database Systems, ACM Press, New York, 1995, pp. 105-112. S. P.J. Samson, K. Hay, and& Ferguson, "Blue-Skies: Curriculum Development for K-12 Education," Proc. Conf. Interactive Information and Processing Systems, American Meteorologi- cal Soc., Boston, 1994.

First 50 documents  Next 50

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