PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SilkRoute: trading between relations and XML
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
NeT & CoT: translating relational schemas to XML schemas using semantic constraints
Proceedings of the eleventh international conference on Information and knowledge management
Schema Transformation Techniques for Database Reverse Engineering
ER '93 Proceedings of the 12th International Conference on the Entity-Relationship Approach: Entity-Relationship Approach
Extracting an Entity Relationship Schema from a Relational Database through Reverse Engineering
ER '94 Proceedings of the13th International Conference on the Entity-Relationship Approach
Structure Elicitation in Database Reverse Engineering
WCRE '96 Proceedings of the 3rd Working Conference on Reverse Engineering (WCRE '96)
ConvRel: relationship conversion to XML nested structures
Proceedings of the 2004 ACM symposium on Applied computing
Fundamentals of Database Systems, Fourth Edition
Fundamentals of Database Systems, Fourth Edition
Advanced SQL modeling in RDBMS
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
QP-T: query pattern-based RDB-to-XML translation
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
Hi-index | 0.00 |
This paper describes formal verification and quantitative performance evaluation for validating of query pattern-based relational schema-to-XML Schema translation (QP-T) algorithm. Many translation algorithms such as FT, NeT, CoT, ConvRel, and VP-T have been introduced on structural and/or semantic aspect for exact and effective translation. However, conventional algorithms consider only explicit referential integrity specified by relational schema or limitations regarding on reflection of implicit referential integrity information. It causes several problems such as incorrect translation, abnormal relational model transition, and so on. The QP-T algorithm analyzes query pattern and extract implicit referential integrities by interrelationship of equi-join in user queries. The QP-T algorithm can make up for weak points of the VP-T algorithm and create more exact XML Schema as a result by using with VP-T algorithm together.