Publication

SMART: A tool for analyzing and reconciling schema matching networks

Related publications (33)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In this paper, an approach for information systems reverse engineering is proposed and applied. The aim is to support a unified perspective to the reverse engineering process of both data and software. At the state of the art, indeed, many methods, techniq ...

Wiley-Blackwell2014

The common "one size does not fit all" paradigm isolates transactional and analytical workloads into separate, specialized database systems. Operational data is periodically replicated to a data warehouse for analytics. Competitiveness of enterprises today ...

Springer International Publishing AG2014

Collaborative Schema Matching Reconciliation

Karl Aberer, Quoc Viet Hung Nguyen, Zoltán Miklós, Hoai Xuan Luong

Schema matching is the process of establishing correspondences between the attributes of database schemas for data integration purpose. Although several schema matching tools have been developed, their results are often incomplete or erroneous. To obtain c ...

2013

Collaborative Schema Matching Reconciliation

Karl Aberer, Zoltán Miklós

Springer-Verlag Berlin2013

Completeness and Ambiguity of Schema Cover

Karl Aberer, Quoc Viet Hung Nguyen, Zoltán Miklós

Given a schema and a set of concepts, representative of entities in the domain of discourse, schema cover deﬁnes correspondences between concepts and parts of the schema. Schema cover aims at interpreting the schema in terms of concepts and thus, vastly si ...

2013

NoDB: Efficient Query Execution on Raw Data Files

Anastasia Ailamaki, Miguel Sérgio De Oliveira Branco, Ioannis Alagiannis

As data collections become larger and larger, data loading evolves to a major bottleneck. Many applications already avoid using database systems, e.g., scientific data analysis and social networks, due to the complexity and the increased data-to-query time ...

2012

Predictable performance and high query concurrency for data analytics

George Candea

Conventional data warehouses employ the query- at-a-time model, which maps each query to a distinct physical plan. When several queries execute concurrently, this model introduces contention and thrashing, because the physical plans—unaware of each other—c ...

2011

The large-scale adoption of the Web 2.0 paradigm has revolutionized the way we interact with the Web today. End-users, so far mainly passive consumers of information are now becoming active information producers, creating, uploading, and commenting on all ...

EPFL2010

In today's companies and organizations, databases are omnipresent. They are the means to represent and store information. Therefore, they must evolve whenever the information architecture (semantic and structure) changes. Databases are subject to evolution ...

EPFL2009

Drivolution: Rethinking the Database Driver Lifecycle

George Candea, Emmanuel Cecchet

The current design of database drivers – a necessary evil for interacting with a DBMS – imposes undue burdens on those who install, upgrade, and manage database systems and their applications. In this paper, we introduce Drivolution, a new architecture for ...

2009