Method for performing information-preserving DTD schema...

Details Method for performing information-preserving DTD schema... Method for performing information-preserving DTD schema...

2004-09-30

2009-02-24

Mofiz, Apu M (Department: 2161)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

07496571

ABSTRACT:
Method for performing information-preserving DTD schema embeddings between a source schema when matching a source schema and a target schema. The preservation is realized by a matching process between the two schemas that finds a first string marking of the target schema, evaluates a legality of the first string marking, determines an estimated minimal cost of the first string marking and subsequently adjusts the estimated minimal cost based upon one to one mapping of source schema and target schema subcomponents.

REFERENCES:
patent: 6718320 (2004-04-01), Subramanian et al.
patent: 6826568 (2004-11-01), Bernstein et al.
patent: 2003/0120651 (2003-06-01), Bernstein et al.
patent: 2003/0167254 (2003-09-01), Su et al.
patent: 2005/0097084 (2005-05-01), Balmin et al.
patent: 2005/0102303 (2005-05-01), Russell et al.
patent: 2005/0160108 (2005-07-01), Charlet et al.
patent: 2005/0256850 (2005-11-01), Ma et al.
patent: 2005/0278139 (2005-12-01), Glaenzer et al.
D. Shasha et al., “Exact and Approximate Algortihms for Unordered Tree Matching.” IEEE Trans. on Systems, Man, and Cybernetics, vol. 24, No. 4, Apr. 1994.
Balmin et al, “XPath Query Containment for Index and Materialized View Matching”, Nov. 11, 2002, pp. 1-12.
Luccio et al, “Bottom-up Subtree Isomorphism for Unordered Labeled Trees”, Universita Di Pisa, Technical Report, Jun. 24, 2004, pp. 1-20.
Nieman et al, “Evaluating Structural Similarity in XML Documents”, University of Michigan, 2002, pp. 1-6.
Zhang et al, “Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's (Extended Abstract)”, University of Western Ontario, Department of Computer Science, 1992, pp. 151-161.
Chi et al, “Frequent Subtree Mining-An Overview”, University of California, 2001, pp. 1001-1038.
Bertino et al, “A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications”, Dipartimento di Informatica, Universita degli Studi di Pica, 2003, pp. 1-24.
Wang et al, “A System for Approximate Tree Matching”, IEEE, 1994, pp. 559-571.
Miller et al, “The Use of Information Capacity in Schema Integration and Translation”, Proceedings of the 19th VLDB Conference, Dublin, Ireland, 1993, pp. 120-133.
Pekka Kilpelainen, “Tree Matching Problems with Applications to Structured Text Databases”, Ph.D. dissertation, Department of Computer Science, University of Helsinki, Finland, 1992, pp. 1-109.
Kuo-Chung Tai, “The Tree-to-Tree Correction Problem”, ACM, North Carolina State University, 1979, pp. 422-433.
Jason Tsong-Li Wang et al, A System for Approximate Tree Matching, IEEE Transactions on Knowledge and Data Engineering , Apr. 28, 1992, pp. 1-26.
Erhard Rahm et al, On Matching Schemas Automatically, Universitat Leipzig, 2001, pp. 1-27.
Dennis Shasha et al, Fast Parallel Algorithms for the Unit Cost Editing Distance Between Trees, Courant Institute of Mathematical Sciences, ACM, 1989, pp. 117-127.
Christoph M. Hoffmann et al, Pattern Matching in Trees, Purdue University, Indiana, ACM, 1982.
S. Melnik et al., “Similarity Flooding: A Versatile Graph Matching Agorithm and its Application to Schema Matching,” Proc. 18thIntl. Conf. on Data Engineering (ICDE), San Jose CA, 2002.
J. Madhaven et al., “Generic Schema Matching with Cupid,” Proceedings of the 27thVLDB Conference, Roma, Italy, 2001.
E. Rahm and P. A. Bernstein, “A Survey of Approaches to Automatic Schema Matching,” The VLDB Journal 10: 334-350 (2001)/Digital Object Identified (DOI) 10.1007/s007780100057.
D. Shasha et al., “Exact and Apoproximate Algorithms for Unordered Tree Matching,” IEEE Trans. on Systems, Man, and Cybernetics, vol. 24, No. 4, Apr. 1994.
K. Zhang, “On The Editing Distance Between Unordered Labeled Trees,” Information Processing Letters 42 (1992), pp. 133-139.

Affiliated with

Also associated with

Rating

Method for performing information-preserving DTD schema... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for performing information-preserving DTD schema..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for performing information-preserving DTD schema... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4080292