| K. C.-C. Chang and H. Garca-Molina. Approximate query mapping: Accounting for translation closeness. VLDB Journal 2001. |
....because the concepts of our ontology do not have corresponding concepts. In this case, we have to look for re writings that approximate the query as closely as possible. Re writings that are an upper approximation of the original query are know from the database area as minimal subsuming mappings [Chang and Garcia Molina, 2001]. While in the area of databases upper approximations are often used in combination with an additional filter that removes irrelevant results, our approach aims for correctness rather than for completeness and therefore uses a lower approximation. The idea of the re writing is the following. ....
Chang, K.-C. and Garcia-Molina, H. (2001). Approximate query mapping: Accounting for translation closeness. The VLDB Journal, 10:155--181.
....private ontology do not have exactly matching concepts in the shared one. In this case, we have to look for re writings that approximate the query as closely as possible. Re writings that are an upper approximation of the original query are know from the database area as minimal subsuming mappings [4]. While in the area of databases upper approximations are often used in combination with an additional filter that removes irrelevant results, our approach aims for correctness rather than for completeness and therefore uses a lower approximation. The idea of the re writing is the following. ....
....receiving agent. 6. RELATED WORK The idea of rewriting representations based on the special capabilities of a remote system is first reported in [14] It has been applied in the area of information retrieval [5] to translate full text queries and in database systems for translating SQL queries [4]. The use of description logics for query rewriting is described in [10] Baader and others propose a general framework for rewriting concepts [1] This work is closest to our approach, however, our goal is not to achieve equivalent rewritings, but rather use an approximation approach that is more ....
K.-C. Chang and H. Garcia-Molina. Approximate query mapping: Accounting for translation closeness. The VLDB Journal, 10:155--181, 2001.
....with generalization operators. In this sense, the specialization and generalization operators can automatically generate sound and complete mappings respectively in the Ontology Integration Framework proposed in [5] 3. 5 Query Evaluation Approximated queries are evaluated by closeness metrics [12, 6], such as precision and recall. These closeness metrics can be estimated by the number of instances when reformulation operators are applied in the same ontology. Suppose, for example, the query [ X type o1:CajunRestaurant] is reformulated to the query [ X type o1:AmericanRestaurant] with a ....
K. C.-C. Chang and H. Garca-Molina. Approximate query mapping: Accounting for translation closeness. The VLDB Journal, 10(2-3):155--181, September 2001.
No context found.
K. C.-C. Chang and H. Garca-Molina. Approximate query mapping: Accounting for translation closeness. VLDB Journal 2001.
No context found.
K. C.-C. Chang and H. Garca-Molina. Approximate query mapping: Accounting for translation closeness. VLDB Journal 2001.
No context found.
K.-C. Chang and H. Garcia-Molina. Approximate query mapping: Accounting for translation closeness. The VLDB Journal, 10:155--181, 2001.
No context found.
Kevin Chang and Hector Gorcia-Molina. Approximate Query Mapping: Accounting for Translation Closeness. VLDB Journal, 10(2-3), 2001.
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