A bottom-up algorithm for query decomposition. (21st July 2008)

• Record Type: Journal Article
• Authors: Thuy Le, Thi Thu; Doan, Dai Duong; Bhavsar, Virendrakumar C.; Boley, Harold
• Is Part Of: International journal of innovative computing and applications. Volume 1:Number 3(2008)
• Page Start: 185
• Page End: 193
• Publication Date: 2008-07-21
• Subjects: query decomposition -- bottom-up strategy -- database integration -- data retrieval -- input queries; Evolutionary computation -- Periodicals; Neural networks (Computer science) -- Periodicals; Genetic programming (Computer science) -- Periodicals; Biologically-inspired computing -- Periodicals; Swarm intelligence -- Periodicals; Quantum computers -- Periodicals; 006.3
• Languages: English
• ISSNs: 1751-648X

Abstract

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.