2,117 Hits in 3.6 sec

Verifying Semistructured Data Normalization Using PVS

Scott Uk-Jin Lee, Jing Sun, Gillian Dobbie, Lindsay Groves
2008 13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)  
Like traditional database systems, developed semistructured database systems should contain minimal redundancies and update anomalies, in order to store and manage the data effectively.  ...  It further utilizes the PVS theorem prover to perform automated checking on the normalized schema, checking that functional dependencies are preserved, no data is lost and no spurious data is created.  ...  Section 3 presents the definition of dependency preserving and lossless properties specific to semistructured database context.  ... 
doi:10.1109/iceccs.2008.23 dblp:conf/iceccs/LeeSDG08 fatcat:so76n237kfa4lfoyfqtm3ugzly

Correctness Criteria for Normalization of Semistructured Data

Scott Uk-Jin Lee, Jing Sun, Gillian Dobbie, Lindsay Groves, Yuan Fang Li
2008 Australian Software Engineering Conference : Proceedings  
However, these algorithms lack the verification that would ensure that data and constraints among the data are not lost or corrupted during normalization.  ...  In this paper, we propose a set of correctness criteria for normalization of semistructured data, which require that functional dependencies are preserved, data is not lost, and spurious data is not created  ...  However, this transformation may not guarantee the preservation of data and its constraints.  ... 
doi:10.1109/aswec.2008.4483213 fatcat:zzopgbmbcvaorkpyfxoukw7gja

Information Preservation in XML-to-Relational Mappings [chapter]

Denilson Barbosa, Juliana Freire, Alberto O. Mendelzon
2004 Lecture Notes in Computer Science  
We also discuss notions of information preservation for mapping schemes; we define lossless mapping schemes as those that preserve the structure and content of the documents, and validating mapping schemes  ...  as those in which valid documents can be mapped into legal databases, and all legal databases are (equivalent to) mappings of valid documents.  ...  This work was supported in part by grants from the Natural Science and Engineering Research Council of Canada. D. Barbosa was supported in part by an IBM PhD. Fellowship. J.  ... 
doi:10.1007/978-3-540-30081-6_6 fatcat:pgfod47er5ciljkzx5op2mpisu

Binary Equivalents of Ternary Relationships in Entity-Relationship Modeling

Trevor H. Jones, Il-Yeol Song
2000 Journal of Database Management  
The analysis investigates equivalency of lossless decompositions, preservation of functional dependencies and finally the ability to preserve update constraints (insertions and deletions).  ...  Alternative methods and substitutes for ternary relationship structures do not necessarily reflect the original logic, semantics or constraints of a given situation.  ...  Lossless & FD Preserving Decomposition of Example 3 We therefore observe that, although the decomposition is equivalent from the point of views of lossless and FD-preserving constraints, from a practical  ... 
doi:10.4018/jdm.2000040102 fatcat:mspfmrguyfg3hbpluojjcppzny


1999 Handbook of Graph Grammars and Computing by Graph Transformation  
., losslessness).  ...  This chapter reports on our approach to apply graph transformations (GTs) in the domain of database re-engineering (DRE).  ...  Acknowledgements Many t h a n k s t o G a b i T aentzer, Annika W agner, and especially to Reiko H e c kel for their private lessons in double-pushout theory, proof readings, discussions and recommendations  ... 
doi:10.1142/9789812815149_0006 fatcat:vubjrw6r4jfffnsliqhlvjgwcu


Ernestas Vyšniauskas, Lina Nemuraitė, Rimantas Butleris, Bronius Paradauskas
2011 Information Technology and Control  
from ontology to database and backward.  ...  The goal of the paper is to define reversible, information preserving transformation from OWL 2 ontologies into relational databases using our proposed hybrid approach, when a part of ontology constructs  ...  Nevertheless, the ensuring of lossless transformations in the sense of preserving information is a very important issue when ontology or database evolves.  ... 
doi:10.5755/j01.itc.40.4.979 fatcat:pxwbowqoibbabnnv2dcpbe6ujq

OWLMap: Fully Automatic Mapping of Ontology into Relational Database Schema

Humaira Afzal, Mahwish Waqas, Tabbassum Naz
2016 International Journal of Advanced Computer Science and Applications  
This paper presents a tool called OWLMap that is fully automatic and provides lossless approach for transformation of ontology into relational database format.  ...  Our OWLMap is based on an approach that is lossless as well as it does not loose data, data types and structure.  ...  While converting OWL ontology into relational database format, we want to preserve all information of ontological constraints.  ... 
doi:10.14569/ijacsa.2016.071102 fatcat:x4ngtdukdbb43bvxwunicmlf2y

Embedded functional dependencies and data-completeness tailored database design

Ziheng Wei, Sebastian Link
2019 Proceedings of the VLDB Endowment  
Extensive experiments with benchmark schemata and data illustrate our framework, and the effectiveness and efficiency of our algorithms, but also provide quantified insight into database schema design  ...  We show how to transform any given schema into application schemata that meet given completeness and integrity requirements and the conditions of the generalized normal forms.  ...  For each E we pursue i) lossless BCNF decompositions that are redundancy-free but potentially not dependency-preserving, and ii) lossless 3NF syntheses that are dependency-preserving but potentially not  ... 
doi:10.14778/3342263.3342626 fatcat:3ng6xsivvjesxjozxt5caufv4y

Data integration

Maurizio Lenzerini
2002 Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '02  
We briefly discuss the notions of query-preserving transformation, and of query-reducibility between classes of data integration systems.  ...  Both transformations result in a query-preserving system whose size is linearly related to the size of the original one.  ... 
doi:10.1145/543613.543644 dblp:conf/pods/Lenzerini02 fatcat:dt4h6ll3ojfaniqonbaelhdcxu

Data integration

Maurizio Lenzerini
2002 Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '02  
We briefly discuss the notions of query-preserving transformation, and of query-reducibility between classes of data integration systems.  ...  Both transformations result in a query-preserving system whose size is linearly related to the size of the original one.  ... 
doi:10.1145/543643.543644 fatcat:hz77ck7elzgxjbtdoqxuyeh73q

Extending and inferring functional dependencies in schema transformation

Qi He, Tok Wang Ling
2004 Proceedings of the Thirteenth ACM conference on Information and knowledge management - CIKM '04  
Our work can be used in different stages of building and accessing a multidatabase system, e.g., to detect and resolve value inconsistency in schema integration, to verify lossless schema transformations  ...  We study the representation, derivation and utilization of a special kind of constraints in multidatabase systems.  ...  Note both fold and unfold operations are not qualified-FD preserving transformations.  ... 
doi:10.1145/1031171.1031177 dblp:conf/cikm/HeL04 fatcat:tkbt5tplvzhftpk34th277xjnq

Page 3192 of Mathematical Reviews Vol. , Issue 98E [page]

1998 Mathematical Reviews  
In this paper an approach to local lossless join preservation of a relational database (db) schema at the level of defined view is proposed. The main idea of the paper is as follows.  ...  To express all first-order constraints as coun- terexamples, a new normal form for first-order logic is created which, after some syntactic transformation, is amenable to storage in flat files, and to  ... 

Fuzzy functional dependencies and lossless join decomposition of fuzzy relational database systems

K. V. S. V. N. Raju, Arun K. Majumdar
1988 ACM Transactions on Database Systems  
Relational operators for fuzzy relations have been studied, and applicability of fuzzy logic in capturing integrity constraints has been investigated.  ...  Next, the problem of lossless join decomposition of fuzzy relations for a given set of fuzzy functional dependencies is investigated.  ...  The second author wishes to acknowledge the support provided by the University of Guelph and the Natural Sciences and Engineering Research Council of Canada.  ... 
doi:10.1145/42338.42344 fatcat:5ngynmulkzanvovgwa2f3om7mq

SQL Schema Design

Henning Köhler, Sebastian Link
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
Unfortunately, relational normalization only works for idealized database instances in which duplicates and null markers are not present.  ...  Normalization helps us find a database schema at design time that can process the most frequent updates efficiently at run time.  ...  In relational databases, one can always transform a given schema into BCNF, without loss of information.  ... 
doi:10.1145/2882903.2915239 dblp:conf/sigmod/KohlerL16 fatcat:ppj6crvwlvdtvikwceanei6lau

Harvard's Perspective on the Archive Ingest and Handling Test

Stephen Abrams, Stephen Chapman, Dale Flecker, Sue Kreigsman, Julian Marinus, Gary McGath, Robin Wendler
2005 D-Lib Magazine  
Thus, at best the transformation process can be considered mathematically lossless and at worst, perceptually lossless.  ...  table-level constraints, and the repository API.  ... 
doi:10.1045/december2005-abrams fatcat:xkop2kb2fzablg3yl7bilsuava
« Previous Showing results 1 — 15 out of 2,117 results