In this paper the problem of query trasformation semantic properties of data is addressed. In particular a trasformation rules is defined, and then theorems stating correctness of the rules are given. The theorems ensure that the query obtained by applying the trasformations to a given query is equivalent to the original one, that is the two queries define the same set of tuples. Since join elimination clustering index introduction, empty query test are allowed by such trasformations, they become useful in the process of query optimization.

Query simplification by using knowledge about data semantics

Musto D
1986

Abstract

In this paper the problem of query trasformation semantic properties of data is addressed. In particular a trasformation rules is defined, and then theorems stating correctness of the rules are given. The theorems ensure that the query obtained by applying the trasformations to a given query is equivalent to the original one, that is the two queries define the same set of tuples. Since join elimination clustering index introduction, empty query test are allowed by such trasformations, they become useful in the process of query optimization.
1986
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
relation scheme
relational algebra
query optimization
semantic data project
File in questo prodotto:
File Dimensione Formato  
prod_419808-doc_148521.pdf

accesso aperto

Descrizione: Query simplification by using knowledge about data semantics
Dimensione 4.23 MB
Formato Adobe PDF
4.23 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/363997
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact