1,017,828 Hits in 4.7 sec

Strong types for relational databases

Alexandra Silva, Joost Visser
2006 Proceedings of the 2006 ACM SIGPLAN workshop on Haskell - Haskell '06  
Our model shows that Haskell can be used to design and prototype typed languages for designing, programming, and transforming relational databases.  ...  We explain how type-level programming can be exploited to define a strongly-typed model of relational databases and operations on them.  ...  Related work We are not the first to provide types for relational databases, and type-level programming has other applications besides type checking SQL. We will briefly discuss related approaches.  ... 
doi:10.1145/1159842.1159846 dblp:conf/haskell/SilvaV06 fatcat:4rrfu4rmbzfqhhnt7hsllcoxby

Consistency in Cloud-based database systems

Zohra Mahfoud, Nadia Nouali-Taboudjemat
2019 Informatica (Ljubljana, Tiskana izd.)  
In fact, the requirement for consistency level can be different according to application natures and other metrics; a delay of some minutes in visualizing latest posts in social networks can be tolerated  ...  Then it discusses the most famous cloud-based database management systems from the point of view of their data and consistency models.  ...  Amazon Aurora [30, 31] is a relational databases management system that provides strong consistency.  ... 
doi:10.31449/inf.v43i3.2650 fatcat:k2rgq7blozhv5mlvmvjuaqynse

Algebraic aspects of relational database decomposition

Stephen J. Hegner
1983 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS '83  
An algebraic framework for investigating the problem of decomposing a relational database schema into components is developed.  ...  It is argued that the views of a relational schema which are to be the components of a decomposition should form a finite atomic Boolean algebra. The unit of the  ...  , for simpllclty, let us take 1t to be a constant n Thus, as part oi the type algebra axioms. we have 7,(n) h O(X)(T~(X) * x=n) The type constraint on the relation becomes ~Wxl~Wy~lWz~~R~x,y.z~ -f~Vrnl  ... 
doi:10.1145/588058.588106 dblp:conf/pods/Hegner83 fatcat:xdy5af2fqzeihalnyzyv3y2goy

A Comparative Study of NoSQL and Relational Database

Douglas Kunda, Hazael Phiri
2017 Zambia ICT Journal  
Each database type has its own challenges and strengths, with relational database lacking of support for unstructured data while NoSQL lacks standardization and has poor security.  ...  Relational Database and NoSQL are competing types of database models. The former has been in existence since 1979 and the latter since the year 2000.  ...  For small applications requiring strong consistency, a developer may choose Relational Databases and for large dynamic databases, a developer may choose NoSQL.  ... 
doi:10.33260/zictjournal.v1i1.8 fatcat:6qevjncbungbrhj7amkkkadily

Developing a Unified Design Methodology Based on Extended Entity-Relationship Model for XML [chapter]

Mun-Young Choi, JongSeon Lim, Kyung-Soo Joo
2003 Lecture Notes in Computer Science  
Second a database modeling methodology for storing on object relational database is proposed.  ...  For this goal there are many research activities for connection between XML application and relational database. A unified modeling methodology need to store the XML data on the variety database.  ...  In this paper a XML modeling guideline for XML DTD based on ER data model is introduced. A database modeling methodology for storing on relational database is proposed.  ... 
doi:10.1007/3-540-44864-0_95 fatcat:3jrrufr4krak3db2xyonfio6xi

Big Data With Column Oriented NOSQL Database To Overcome The Drawbacks Of Relational Databases

NaglaaSaeed Shehata, Amira Hassan Abed
2020 International journal of advanced networking and applications  
) relational to overcome the drawbacks of the relational database Model.  ...  Due to the Era of Big Data with the large amount of distributed databases in the web and the rapid growth in the smart systems a rapid growth happening in database models and the relational database fails  ...  NOSQL databases perform better than relational databases duo to the good facility in non-relational databases, the researcher also compared thedifferent types of NOSQL databases, testing or checking some  ... 
doi:10.35444/ijana.2020.11057 fatcat:tlfzqzarebg53dqaiw52ja6n7u


Bronius Paradauskas, Aurimas Laurikaitis
2006 Information Technology and Control  
This article discusses the process of enterprise knowledge extraction from relational database and source code of legacy information systems.  ...  Problems of legacy systems and main solutions for them are briefly described here.  ...  Model from a Relational Database.  ... 
doi:10.5755/j01.itc.35.3.11772 fatcat:j63guxnwwzgwpnr74ehqlz7gke

Data Structures in Natural Computing: Databases as Weak or Strong Anticipatory Systems

B. N. Rossiter
2004 AIP Conference Proceedings  
strong anticipatory information systems.  ...  Databases need a schema of the natural world. Natural computing databases need the schema itself to be also natural.  ...  CPT is the same in both systems as there is one universal type for concepts. As usual the functors relate the categories.  ... 
doi:10.1063/1.1787342 fatcat:sdgnl4jxszeq7kyywgolxlo7lq

Enforcing strong object typing in flexible hypermedia

Pedro Furtado, H. Madeira
1998 Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems links, objects, time and space---structure in hypermedia systems - HYPERTEXT '98  
Weak types are also necessary for some constructs, so they coexist with strong types, but these are enforced.  ...  By strong typing we mean the direct representation of data semantics as object types in an object database as oposed to a "slotted frames" representation.  ...  So this work has a clear implication in the research for hypermedia systems and database systems alike. Figure 4 - 4 Exemplifying an object type hierarchy Any object can be referenced and related.  ... 
doi:10.1145/276627.276646 dblp:conf/ht/FurtadoM98 fatcat:nuudxx7l5na5ddffk5claq7hii

Relational indexing [chapter]

Mauro S. Costa, Linda G. Shapiro
1996 Lecture Notes in Computer Science  
The relational indexing technique has worst-c~e complexity O(m(~)) for relational graphs of up to k nodes and a database of m models.  ...  Given a database of relational models, we determine those models whose relational descriptions are most similar to subsets of the relational description of an unknown scene.  ...  In each of the nine tests, the strong hypotheses were classified as type A, type B, or type C.  ... 
doi:10.1007/3-540-61577-6_14 fatcat:c25t4qzxqvezjnxzbqotrwfbt4

Types, Logic, and Semantics for Nested Databases

Achim Jung, Hermann Puhlmann
1995 Electronical Notes in Theoretical Computer Science  
This work presents rst steps towards a denotational semantics for relational databases.  ...  Database relations are seen as sets of data of a common structure. The main problem therefore is to model a type of sets. We propose the snack powerdomain for this purpose.  ...  We also thank the \Domain Theory Group" at Darmstadt for many stimulating discussions on the subject matter.  ... 
doi:10.1016/s1571-0661(04)00020-9 fatcat:rhbopyhmpbbh3nwyjaj5rpw2sy

Dietary value for money? Investigating how the monetary value of diets in the National Diet and Nutrition Survey (NDNS) relate to dietary energy density

K. A. Timmins, C. Hulme, J. E. Cade
2013 Proceedings of the Nutrition Society  
This study investigated how estimated diet costs of NDNS adults relate to dietary energy density using the 'residuals' regression method to account for energy.  ...  Adjusted linear regression found a strong negative relationship: additional standard deviation above the diet cost expected for a given energy intake (the residual), there was an associated decrease in  ...  The authors acknowledge Kevin Tarbutt and Edmund Parks for creating the DANTE cost database.  ... 
doi:10.1017/s0029665113003224 fatcat:c2i5gtg7snefbg6drbpjqu37ya

Page 453 of Mathematical Reviews Vol. , Issue 89A [page]

1989 Mathematical Reviews  
In this paper the author relates the relational database theory con- cept of the full family of strong dependencies [W. W.  ...  Summary: “A method is proposed for developing a combined logical structure for a database, where the data are arranged in both the relational and hierarchical ways.  ... 

Page 1583 of Mathematical Reviews Vol. , Issue 92c [page]

1992 Mathematical Reviews  
Given that fundamental database objects are descriptions of real world entities, a database type system becomes a poset of descrip- tion types representing the structure of database objects in terms of  ...  These properties are the computational basis for al- gorithmic type-checking in the programming language.  ... 

Using SemRep to label semantic relations extracted from clinical text

Ying Liu, Robert Bill, Marcelo Fiszman, Thomas Rindflesch, Ted Pedersen, Genevieve B Melton, Serguei V Pakhomov
2012 AMIA Annual Symposium Proceedings  
Our analysis shows that predicate type frequency information obtained from the SemRep database appears to be helpful for labeling semantic relations obtained with measures of semantic relatedness and similarity  ...  We used a corpus of 800k inpatient clinical notes as a source of data for determining the strength of association between medical concepts and SemRep database as a source of labeled relations extracted  ...  We would like to thank Fairview Health Services for use of their clinical data.  ... 
pmid:23304331 pmcid:PMC3540517 fatcat:qvpmkcnaz5dlril2ewokoknlkq
« Previous Showing results 1 — 15 out of 1,017,828 results