Finite satisfiability of integrity constraints in object-oriented database schemas (Articolo in rivista)

Type
Label
  • Finite satisfiability of integrity constraints in object-oriented database schemas (Articolo in rivista) (literal)
Anno
  • 2002-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1109/69.979977 (literal)
Alternative label
  • Formica, A (2002)
    Finite satisfiability of integrity constraints in object-oriented database schemas
    in IEEE transactions on knowledge and data engineering (Print)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Formica, A (literal)
Pagina inizio
  • 123 (literal)
Pagina fine
  • 139 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 14 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • number:1 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 17 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 1 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • In this paper a decidable, sound, and complete method for checking finite satisfiability of a specific class of integrity constraints for Object-Oriented databases, including the equality constraints, is presented. (literal)
Note
  • ISI Web of Science (WoS) (literal)
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Consiglio Nazionale delle Ricerche (CNR) (literal)
Titolo
  • Finite satisfiability of integrity constraints in object-oriented database schemas (literal)
Abstract
  • Checking satisfiability of database constraints is a fundamental problem in database design. In addition, database constraints have to be not only satisfiable but also finitely satisfiable. This problem is generally addressed by using theorem provers that, being developed for first order logic formulas, are based on semidecidable procedures. Furthermore, even in simple cases, theorem provers are quite inefficient in dealing with comparison operators such as, for instance, the equality. In this paper, a decidable, sound, and complete method for checking finite satisfiability of a specific class of integrity constraints for object-oriented databases, including the equality constraints, is presented. The method, that is based on a graph-theoretic approach, has exponential complexity in the worst case, rarely occurring in practice. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Insieme di parole chiave di
data.CNR.it