Solving Data Exchange Problem Based On Improved Chase Approach

Wu Bin Ma; Zhi Yong Tang; Su Deng; Hong Bin Huang

doi:10.4028/www.scientific.net/AMR.268-270.2127

Paper Titles

A High-Performance Scheduling Algorithm for Buffered Crossbar Switch
p.2101

Research on the Cyber Terrorist Attacks and its Impacts on Information Infrastructure Security
p.2108

Optimization of Storage Method for Video Segment Captured by Embedded System in Camera
p.2116

Permanence of Impulsive Differential Systems with Delays
p.2121

Solving Data Exchange Problem Based On Improved Chase Approach
p.2127

Research on Information Security Scheme Decision-Making of Internet Banking
p.2133

Design of Hospital Ward Integrated Management Information System
p.2139

Design of Data Processing System on Analysis of Variance
p.2144

LabVIEW-Based Virtual Laboratory for Digital Signal Processing
p.2150

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 268-270Solving Data Exchange Problem Based On Improved...

Solving Data Exchange Problem Based On Improved Chase Approach

Abstract:

Data exchange is one of the key problems of information integration. The most important process in data exchange problem is how to solute it based on circulatory dependence. In this paper, we proposed an improved chase approach in the special background of application for the data exchange. Solving the problem that finding the most approximately solution in polynomial time for data exchange problem by amending the dependence condition appropriately.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 268-270)

Pages:

2127-2132

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.268-270.2127

Citation:

Cite this paper

Online since:

July 2011

Authors:

Wu Bin Ma, Zhi Yong Tang, Su Deng, Hong Bin Huang

Keywords:

Chase Approach, Data Exchange, GA (Genetic Arithmetic), Information Integration

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Fagin, Kolaitis, Miller. Data exchange semantic and query answering[J]. Theoretical Computer Science, 2005, 336 (1): 89-124.

DOI: 10.1016/j.tcs.2004.10.033

Google Scholar

[2] Cate B t, Chiticariu L, Kolaitis P. Laconic Schema Mappings: computing the core with SQL queries [C]. in: VLDB. 2009. 349-366.

DOI: 10.14778/1687627.1687741

Google Scholar

[3] Deutsch A, Nash A, Remmel J. The Chase Revisted [C]. in: PODS. (2008).

Google Scholar

[4] Fagin R, G. Kolaitis P, Popa L. Data exchange: getting to the core[J]. ACM Transtions on Database Systems, 2005, 30 (1): 174-210.

DOI: 10.1145/1061318.1061323

Google Scholar

[5] Gottlob G. schema mapping discovery from data instances[J]. Journal of the ACM, (2010).

Google Scholar

[6] Papotti P, Torlone R. Schema exchange: generic mappings for transforming data and metadata[J]. Data and Knowledge engineering, 2009, 68 665-682.

DOI: 10.1016/j.datak.2009.02.005

Google Scholar

[7] Meier M, Schmidt M, Lausen G. Stop the chase: short contribution [R]. Freiburg: University of Freiburg, 2008, 23(3): 112-128.

Google Scholar

[8] Meier M, Schmidt M, Lausen G. On chase termination beyond stratification [C]. in: VLDB. Lyon, France: 2009, 2(6): 121-129.

DOI: 10.14778/1687627.1687737

Google Scholar

[9] Reinhard Pichler, Vadim Savenkov. Towards practical feasibility of core computation in data exchange[J], (2009).

Google Scholar