InfoSleuth: agent-based semantic integration of information in open and dynamic environments
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
XML-based information mediation with MIX
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Managing semistructured data with florid: a deductive object-oriented perspective
Information Systems - Special issue on semistructured data
A Semantic Approach to XML-based Data Integration
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Adaptive Evaluation Techniques for Querying XML-based E-Catalogs
RIDE '02 Proceedings of the 12th International Workshop on Research Issues in Data Engineering: Engineering E-Commerce/E-Business Systems (RIDE'02)
Resolution of Semantic Heterogeneity in Database Schema Integration Using Formal Ontologies
Information Technology and Management
Mapping maintenance for data integration systems
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Semantic-integration research in the database community
AI Magazine - Special issue on semantic integration
Query decomposition using the XML declarative description language
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Scaling XML query processing: distribution, localization and pruning
Distributed and Parallel Databases
| Hi-index | 0.00 |
In order to access data from various data repositories, in Global-As-View approaches an input query is decomposed into several subqueries. Normally, this decomposition is based on a set of mappings, which describe the correspondence of data elements between a global schema and local ones. However, building mappings is a difficult task, especially when the number of participating local schemas is large. In our approach, an input query is automatically decomposed into subqueries without using mappings. An algorithm is proposed to transform a global path expression (e.g. an XPath query) into local path expressions executable in local schemas. This algorithm considers parts of a path expression from right to left, that is, the algorithm traverses from the bottom to the top of a schema tree depending on the structure of local schemas. Compared to top-down approaches, such as by Lausen and Marron, our algorithm can reduce the time for forming subqueries for local (e.g. XML) schemas to a large extent.