| A step towards incremental maintenance of the composed schema mapping |
| Full text |
Pdf
(475 KB)
|
Source
|
Conference on Information and Knowledge Management
archive
Proceeding of the 17th ACM conference on Information and knowledge management
table of contents
Napa Valley, California, USA
SESSION: DB: efficient maintenance and query optimization
table of contents
Pages 173-182
Year of Publication: 2008
ISBN:978-1-59593-991-3
|
|
Authors
|
|
Gang Qian
|
Nanjing University of Finance & Economics, Nanjing, China
|
|
Yisheng Dong
|
Southeast University, Nanjing, China
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 78, Citation Count: 0
|
|
|
ABSTRACT
Schema mapping plays a fundamental role in modern information systems. Mapping composition is an operator that combines a chain of successive schema mappings into a single schema mapping. By pre-computing the composed schema mapping, the system can achieve significant performance benefits. However, when a change occurs on any mapping in the chain, the composed schema mapping has to be maintained correspondingly. In this paper we consider a restricted form of the problem in the XML setting and propose an incremental maintenance approach. Specifically, given a chain of successive mappings, we transform intermediately them into trees that consist of atomic rules and then divide the composition into sub-compositions of the atomic rules. The dividing composition approach provides a fine-grained perspective of the composition relationships between the mappings. We depict such information through an auxiliary data structure called composition relationship graph (CRG). When changes occur on any mapping in the chain, the corresponding maintenance algorithms are developed based on the dividing approach and the CRG, which compute the changes on the composed mapping and then repair it into the new version, such that the computation involves only the atomic rules that are relevant with the maintenance. We evaluate our maintenance approach and report the first experiments results, which show that it is efficient.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
P. A. Bernstein. Applying Model Management to Classical Meta Data Problems. In Proc. of CIDR, Pages 209--220, 2003.
|
 |
2
|
|
| |
3
|
Clio. http://www.cs.toronto.edu/db/clio/
|
| |
4
|
|
 |
5
|
|
| |
6
|
Ariel Fuxman , Mauricio A. Hernandez , Howard Ho , Renee J. Miller , Paolo Papotti , Lucian Popa, Nested mappings: schema mapping reloaded, Proceedings of the 32nd international conference on Very large data bases, September 12-15, 2006, Seoul, Korea
|
 |
7
|
|
 |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
| |
12
|
Lucian Popa , Yannis Velegrakis , Mauricio A. Hernández , Renée J. Miller , Ronald Fagin, Translating web data, Proceedings of the 28th international conference on Very Large Data Bases, p.598-609, August 20-23, 2002, Hong Kong, China
|
| |
13
|
G. Qian, Y. Dong. Constructing Maintainable Semantic Mappings in XQuery. WebDB 2005:121--126.
|
| |
14
|
Albrecht Schmidt , Florian Waas , Martin Kersten , Michael J. Carey , Ioana Manolescu , Ralph Busse, XMark: a benchmark for XML data management, Proceedings of the 28th international conference on Very Large Data Bases, p.974-985, August 20-23, 2002, Hong Kong, China
|
 |
15
|
|
| |
16
|
XQEngine. http://www.fatdog.com
|
| |
17
|
|
 |
18
|
|
| |
19
|
|
|