% This data is distributed under the terms of the Open Data Commons Attribution License (ODC-By) v1.0 - See more at: http://opendatacommons.org/licenses/by/1-0/
% Volume 1, Issue 1, 2014
    @Article{OJDB-v1i1n01_Grandi,
        title     = {Introductory Editorial},
        author    = {Fabio Grandi},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {1--2},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194557},
        urn       = {urn:nbn:de:101:1-201705194557},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {The Open Journal of Databases (OJDB) is a new open access journal covering all aspects of database research and technology. In this editorial, the first issue of the journal is presented.}
    }
    @Article{OJDB-v1i1n02_Duchateau,
        title     = {Designing a Benchmark for the Assessment of Schema Matching Tools},
        author    = {Fabien Duchateau and
                     Zohra Bellahsene},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {3--25},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194573},
        urn       = {urn:nbn:de:101:1-201705194573},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Over the years, many schema matching approaches have been developed to discover correspondences between schemas. Although this task is crucial in data integration, its evaluation, both in terms of matching quality and time performance, is still manually performed. Indeed, there is no common platform which gathers a collection of schema matching datasets to fulfil this goal. Another problem deals with the measuring of the post-match effort, a human cost that schema matching approaches aim at reducing. Consequently, we propose XBenchMatch, a schema matching benchmark with available datasets and new measures to evaluate this manual post-match effort and the quality of integrated schemas. We finally report the results obtained by different approaches, namely COMA++, Similarity Flooding and YAM. We show that such a benchmark is required to understand the advantages and failures of schema matching approaches. Therefore, it could help an end-user to select a schema matching tool which covers his/her needs.}
    }
    @Article{OJDB-v1i1n03_Elbushra,
        title     = {Eventual Consistent Databases: State of the Art},
        author    = {Mawahib Musa Elbushra and
                     Jan Lindstr{\"o}m},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {26--41},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194582},
        urn       = {urn:nbn:de:101:1-201705194582},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {One of the challenges of cloud programming is to achieve the right balance between the availability and consistency in a distributed database. Cloud computing environments, particularly cloud databases, are rapidly increasing in importance, acceptance and usage in major applications, which need the partition-tolerance and availability for scalability purposes, but sacrifice the consistency side (CAP theorem). In these environments, the data accessed by users is stored in a highly available storage system, thus the use of paradigms such as eventual consistency became more widespread. In this paper, we review the state-of-the-art database systems using eventual consistency from both industry and research. Based on this review, we discuss the advantages and disadvantages of eventual consistency, and identify the future research challenges on the databases using eventual consistency.}
    }