Publications associées à Relation (database)

Reconciling Matching Networks of Conceptual Models

Karl Aberer, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Zoltán Miklós

Conceptual models such as database schemas, ontologies or process models have been established as a means for effective engineering of information systems. Yet, for complex systems, conceptual models are created by a variety of stakeholders, which calls fo ...

2019

Handling probabilistic integrity constraints in pay-as-you-go reconciliation of data models

Karl Aberer, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Zoltán Miklós

Data models capture the structure and characteristic properties of data entities, e.g., in terms of a database schema or an ontology. They are the backbone of diverse applications, reaching from information integration, through peer-to-peer systems and ele ...

PERGAMON-ELSEVIER SCIENCE LTD2019

Consolidation of database check constraints

Nikola Obrenovic

Independent modeling of various modules of an information system (IS), and consequently database subschemas, may result in formal or semantic conflicts between the modules being modeled. Such conflicts may cause collisions between the integrated database s ...

2019

Squall: Scalable Real-time Analytics using Efficient, Skew-resilient Join Operators

Aleksandar Vitorovic

Squall is a scalable online query engine that runs complex analytics in a cluster using skew-resilient, adaptive operators. Online processing implies that results are incrementally built as the input arrives, and it is ubiquitous for many applications such ...

EPFL2023

Efficient Incremental Data Analysis

Milos Nikolic

Many data-intensive applications require real-time analytics over streaming data. In a growing number of domains -- sensor network monitoring, social web applications, clickstream analysis, high-frequency algorithmic trading, and fraud detections to name a ...

EPFL2016

On the Zarankiewicz problem for intersection hypergraphs

János Pach

Let d and t be fixed positive integers, and let denote the complete d-partite hypergraph with t vertices in each of its parts, whose hyperedges are the d-tuples of the vertex set with precisely one element from each part. According to a fundamental theorem ...

Academic Press Inc Elsevier Science2016

Reconciling Schema Matching Networks Through Crowdsourcing

Karl Aberer, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Zoltán Miklós

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

2014

Pay-as-you-go Reconciliation in Schema Matching Networks

Karl Aberer, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Zoltán Miklós

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

2014

Ramsey-Type Results For Semi-Algebraic Relations

János Pach

A k-ary semi-algebraic relation E on R-d is a subset of R-kd, the set of k-tuples of points in R-d, which is determined by a finite number of polynomial inequalities in kd real variables. The description complexity of such a relation is at most t if d, k < ...

Amer Mathematical Soc2014

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