The annual IDEAS conference is a top international forum for data engineering researchers, practitioners, developers, and application users to explore revolutionary ideas and results, and to exchange techniques, tools, and experiences. We invite participation of all interested in this meeting which provides an insight into original research contributions relating to all aspects of database engineering defined broadly, and particularly topics of emerging interest describing work on integrating new technologies into products and applications, on experiences with existing and novel techniques, and on the identification of unsolved challenges.
As in the past, IDEAS 2018 will include tracks (Targeted Session) on current topics of interest to the community. This year, we would be organizing several; some of which are proposed below. These special tracks/themes will form part of the program along with the main event:
- Big Data Applications (e.g. Health, Environment, Transport)
- Data Sharing, Security and Privacy
- Smart Cities and Data Analytics
- Web and Cyber Security
- Sergio Greco, University of Calabria
Title: Algorithms for Computing Approximate Certain Answers over Incomplete Databases
Abstract: Incomplete information arises in many database applications, such as data integration, data exchange, inconsistency management, data cleaning, ontological reasoning, and many others. A principled way of answering queries over incomplete databases is to compute “certain answers”, which are query answers that can be obtained from all the complete databases represented by an incomplete database. For databases containing (labeled) nulls, certain answers to positive queries can be easily computed in polynomial time, but for more general queries with negation the problem becomes coNP-hard. To make query answering feasible in practice, one might resort to SQL’s evaluation, but unfortunately, the way SQL behaves in the presence of nulls may result in wrong answers. Thus, on the one hand, SQL’s evaluation is efficient but flawed, on the other hand, certain answers are a principled semantics but with high complexity.
To deal with issue, recent research has focused on developing polynomial time approximation algorithms for computing (approximate) certain answers. This talk will survey recent advances in this area comparing current approaches for querying incomplete databases.
- Yannis Manolopoulos, Open University of Cyprus
Title: The Evolving Path of Scientometrics into the Science of Science
Abstract: During the past decades many different measurements have been designed to evaluate the scientific impact of scholars, journals and academic institutions, that have shaped the now mature the field of scientometrics/informetrics. However, the multifacet structure, the dynamics and diffusion phenomena observed in the scientific research and subsequent outcomes, have given rise to the so called Science of Science aiming at studying these mechanisms. The goal of this talk is to bring awareness to the audience of this new exciting field, and also present initial results that challenge traditional methodologies.
The conference proceedings will be published by ACM in their digital library; the ISBN assigned by ACM to IDEAS18 is:978-1-4503-6527-7
A version of the proceedings to be distributed to the conference attendees would be prepared by BytePress.
University of Calabria and ICAR-CNR, Concordia University, Montreal, Canada; with the cooperation of ACM, ACM SIGMOD and ACM SIGKDD, BytePress.org and ConfSys.org.
General Chairs: Bipin C. Desai, Concordia University, Montreal, Sergio Flesca, University of Calabria
Program Chairs: Ester Zumpano, University of Calabria, Elio Masciari, ICAR-CNR, Luciano Caroprese, University of Calabria,
Local Chair: Andrea Tagarelli, University of Calabria, Pierangelo Veltri, University Magna Graecia,
Publicity Chair: Luciano Caroprese, University of Calabria,