ยดยดร n this paper we present a definition of a domain relational calculus for fuzzy relational databases using the GEFRED model as a starting point. It is possible to define an equivalent fuzzy tuple relational calculus and consequently we achieve the two query language levels that Codd designed for
Querying relational databases through XSLT
โ Scribed by Jixue Liu; Millist Vincent
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 448 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0169-023X
No coin nor oath required. For personal study only.
โฆ Synopsis
XML has been accepted as a universal format for data interchange and publication. It can be applied in the applications in which the data of a database needs to be viewed in XML format so that the data being viewed takes more semantics and is easily understood. In these applications, the user of the data to be viewed sees only XML data, not the database. He may use XML query languages such as XSLT, XQuery, and XML-QL to query data and the retrieved data is presented in XML format to them. We are interested in the connection between the data that the user sees and the data in the database. More specifically, we are interested in translating XSLT queries to SQL queries which are for relational databases and in wrapping the data retrieved from the relational database in XML format.
๐ SIMILAR VOLUMES
The method of the canonical connection introduced by Maier and Ullman provides an optimal procedure for query processing in universal-relation databases. We present an algorithm for computing canonical connections in a database scheme which is more efficient than the classical algorithm based on tab