Welcome to the InfoSci Platform
Reference Hub1
Towards a Normal Form and a Query Language for Extended Relations Defined by Regular Expressions

Towards a Normal Form and a Query Language for Extended Relations Defined by Regular Expressions

András Benczúr, Gyula I. Szabó
Copyright: © 2016 |Volume: 27 |Issue: 2 |Pages: 22
ISSN: 1063-8016|EISSN: 1533-8010|EISBN13: 9781466688834|DOI: 10.4018/JDM.2016040102
Cite Article Cite Article

MLA

Benczúr, András, and Gyula I. Szabó. "Towards a Normal Form and a Query Language for Extended Relations Defined by Regular Expressions." JDM vol.27, no.2 2016: pp.27-48. http://doi.org/10.4018/JDM.2016040102

APA

Benczúr, A. & Szabó, G. I. (2016). Towards a Normal Form and a Query Language for Extended Relations Defined by Regular Expressions. Journal of Database Management (JDM), 27(2), 27-48. http://doi.org/10.4018/JDM.2016040102

Chicago

Benczúr, András, and Gyula I. Szabó. "Towards a Normal Form and a Query Language for Extended Relations Defined by Regular Expressions," Journal of Database Management (JDM) 27, no.2: 27-48. http://doi.org/10.4018/JDM.2016040102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper introduces a generalized data base concept that unites relational and semi structured data models. As an important theoretical result we could find a quadratic decision algorithm for the implication problem of functional and join dependencies defined on the united data model. As practical contribution we presented a normal form for the new data model as a tool for data base design. With our novel representations of regular expressions, a more effective searching method could be developed. XML elements are described by XML schema languages such as a DTD or an XML Schema definition. The instances of these elements are semi-structured tuples. A semi-structured tuple is an ordered list of (attribute: value) pairs. We may think of a semi-structured tuple as a sentence of a formal language, where the values are the terminal symbols and the attribute names are the non-terminal symbols. In the authors' former work (Szabó and Benczúr, 2015) they introduced the notion of the extended tuple as a sentence from a regular language generated by a grammar where the non-terminal symbols of the grammar are the attribute names of the tuple. Sets of extended tuples are the extended relations. The authors then introduced the dual language, which generates the tuple types allowed to occur in extended relations. They defined functional dependencies (regular FD - RFD) over extended relations. In this paper they rephrase the RFD concept by directly using regular expressions over attribute names to define extended tuples. By the help of a special vertex labeled graph associated to regular expressions the specification of substring selection for the projection operation can be defined. The normalization for regular schemas is more complex than it is in the relational model, because the schema of an extended relation can contain an infinite number of tuple types. However, the authors can define selection, projection and join operations on extended relations too, so a lossless-join decomposition can be performed. They extended their previous model to deal with XML schema indicators too, e.g., with numerical constraints. They added line and set constructors too, in order to extend their model with more general projection and selection operators. This model establishes a query language with table join functionality for collected XML element data.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.