Collaborative schema construction using regular sequence types

Authors:
Jorge Coelho;Mário Florido;Temur Kutsia
Affiliations:
ISEP & LIACC, Porto, Portugal;Univ. of Porto, DCC-FC & LIACC, Porto, Portugal;RISC, Johannes Kepler University, Linz, Austria
Venue:
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
Year:
2009

Citing 11
Cited 1

Extended path expressions of XML

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SuperJournal Project

SuperJournal Project
Regular expression pattern matching for XML

Journal of Functional Programming
Matching large XML schemas

ACM SIGMOD Record
Semantic-integration research in the database community

AI Magazine - Special issue on semantic integration
eTuner: tuning schema matching software using synthetic scenarios

The VLDB Journal — The International Journal on Very Large Data Bases
XCentric: logic programming for XML processing

Proceedings of the 9th annual ACM international workshop on Web information and data management
Collaborative schema construction using regular sequence types

IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
Generic schema merging

CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
GeRoMe: a generic role based metamodel for model management

Journal on data semantics VIII
Sequence disunification and its application in collaborative schema construction

WISE'07 Proceedings of the 2007 international conference on Web information systems engineering

Collaborative schema construction using regular sequence types

IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe an approach to build XML schemas in a collaborative way. The approach is based on computing intersection between sequences of type terms built over constants, function symbols and type symbols. For type symbols there may be the corresponding type rules that specify the (regular) set of term sequences the type symbol generates. We describe the intersection algorithm, prove its termination and correctness, illustrate it on examples and show how it can be used in collaborative schema development.