Results 261 to 270 of about 124,288 (293)
Some of the next articles are maybe not open access.
Graceful database schema evolution
Proceedings of the VLDB Endowment, 2008Supporting graceful schema evolution represents an unsolved problem for traditional information systems that is further exacerbated in web information systems, such as Wikipedia and public scientific databases: in these projects based on multiparty cooperation the frequency of database schema changes has increased while tolerance for downtimes has ...
CURINO, CARLO ALDO +2 more
openaire +2 more sources
1990
The conceptual schema in IDEFlx is used in the CAD*I database group to describe the handled entities, properties and attributes, The formal data structure used in the CAD*I project is described according to the High Level Data Specification Language (HDSL), This data schema is divided into two main parts which are the Geometric part(B_REP ...
Michel Raflik, Bernd Pätzold
openaire +1 more source
The conceptual schema in IDEFlx is used in the CAD*I database group to describe the handled entities, properties and attributes, The formal data structure used in the CAD*I project is described according to the High Level Data Specification Language (HDSL), This data schema is divided into two main parts which are the Geometric part(B_REP ...
Michel Raflik, Bernd Pätzold
openaire +1 more source
Modeling Graph Database Schema
IT Professional, 2017The authors present a new method for creating a graph database schema (GDBS) based on an entity-relationship diagram (ERD) of the application domain, which is mapped to a GDBS in a two-step process. First, the original ERD is adjusted to a semantically equivalent ERD (enabling it to be mapped in step two). In the second step, the adjusted ERD is mapped
Noa Roy-Hubara +3 more
openaire +1 more source
Database Conceptual Schema Matching
Computer, 2007A database conceptual schema is a high-level description of how database concepts are organized, which is typically as classes of objects and their attributes. A fundamental operation in many database applications, schema matching involves finding a mapping mu between the concepts in a source scheme S and the concepts in a target schema T such that, if
Marco A. Casanova +3 more
openaire +1 more source
Synthesizing independent database schemas
Proceedings of the 1979 ACM SIGMOD international conference on Management of data - SIGMOD '79, 1979We study the following database design problem. Given a universal relation scheme 〈U, F〉 where F is a set of functional dependencies, find an in some way normalized database schema D = {〈X1, F1〉,..., 〈Xn, Fn〉} where Xi ⊂ U and Fi is inherited from F, such that D is an independent representation of the universal scheme 〈U, F〉. This means that D has both
Joachim Biskup +2 more
openaire +1 more source
From Conceptual Database Schemas to Logical Database Tuning
2011This chapter revisits conceptual database design and focuses on the so-called “logical database tuning”. We first recall fundamental differences between constructor-oriented models (like extended Entity-Relationship models) and attribute-oriented models (like the relational model).
Petit, Jean-Marc, Hacid, Mohand-Said
openaire +3 more sources
Distribution Design of Logical Database Schemas
IEEE Transactions on Software Engineering, 1983The optimal distribution of a database schema over a number of sites in a distributed network is considered. The database is modeled in terms of objects (relations or record sets) and links (predefined joins or CODASYL sets). The design is driven by user-supplied information about data distribution. The inputs required by the optimization model are: 1)
Ceri, Stefano +2 more
openaire +2 more sources
Integrating schemas of heterogeneous relational databases through schema matching
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services, 2009Database integration aims at providing a uniform and consistent view called global schema, over a set of autonomous and heterogeneous data sources, so that data residing in different sources can be accessed as if it was in a single schema. The integration of databases' schemas can be performed in four main phases, namely: preintegration, comparing of ...
Yaser Karasneh +3 more
openaire +1 more source
An instance based schema matching between opaque database schemas
2014 4th International Conference on Engineering Technology and Technopreneuship (ICE2T), 2014Schema matching is always needed amoung Schemas of relational datasets in database integration applications. Heterogeneous database integration involves a significant role of schema matching Most of the previous solution to schema matching problem based on the identification of similarity between the columns names or by recognizing common domains in ...
Sameer Munir +2 more
openaire +1 more source
An improved schema matching algorithm of opaque database schemas
2011 International Conference on Multimedia Technology, 2011Schema matching is a crucial problem in Data Integration and Data Translation. In this paper, a pretreatment algorithm is proposed, which is an optimized and improved algorithm for the previous schema matching algorithm on opaque column and data value.
Wei Chen, Fang Zhang, Maosen Wen
openaire +1 more source