23rd International Database Engineering & Applications Symposium

IDEAS 2019 will be hosted by Harokopio University,


June 10-12, 2019 Athens, Greece


Call for Papers/Participation/Track Proposals



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.


Track (Targeted Session) Proposals


As in the past, IDEAS 2019 will include tracks (Targeted Sessions) on current topics of interest to the community. This year, we would be organizing several; some of which are proposed below: the scope and call for papers for these tracks appear in the links on the left hand menu items. These special tracks/themes will form part of the program along with the main event:

  • Big Data Applications (e.g. Environment, Urban Planning, Transport)
  • Bio-Informatics
  • Data Sharing, Security and Privacy
  • Smart Cities and Data Analytics
  • Web and Cyber Security








If you and your colleagues would like to propose a track, please contact us ASAP (well before deadline for the CFP). Please include the topics, the track chair and the proposed addition to the program committee to handle the submissions for the track.


Submission for review

All paper submission for IDEAS’2019 would be via the corresponding pages on ConfSys. Authors should sign up as user of the system at:

For the format of the paper for review by the program cmt. please consult:



A list of non-exhaustive topics can be found at:


Invited Speakers    

  • Schahram Dustdar
    Professor of Computer Science, IEEE Fellow, ACM Distinguished Scientist,
    Technical University of Vienna

    Title: Novel Paradigms for engineering large-scale resilient IoT Systems

    Abstracts: This talk explores the research challenges in the domain of IoT from multiple angles and reflects on the urgently needed collective efforts from various research communities to collaborate on those. Our approach fundamentally challenges the current understanding of scientific, technological, and political paradigms in tackling the engineering of large-scale IoT systems. We discuss technical paradigms and research challenges in the domains of Cloud and Edge Computing as well as the requirements of people in such systems embedded in Smart Cities.

    Bio: Schahram Dustdar is Full Professor of Computer Science heading the Research Division of Distributed Systems at the Technical University of Vienna. From 2004-2010 he was also Honorary Professor of Information Systems at the Department of Computing Science at the University of Groningen (RuG), The Netherlands. From 1999 - 2007 he worked as the co-founder and chief scientist of Caramba Labs Software AG in Vienna (acquired by Engineering NetWorld AG), a venture capital co-funded software company focused on software for collaborative processes in teams. Caramba Labs was nominated for several (international and national) awards: World Technology Award in the category of Software (2001); Top-Startup companies in Austria (Cap Gemini Ernst & Young) (2002); MERCUR Innovationspreis der Wirtschaftskammer (2002). From Dec 2016 until Jan 2017 he was a Visiting Professor at the University of Sevilla, Spain and from January until June 2017 he was a Visiting Professor at UC Berkeley, USA. He is co-Editor-in-Chief of the new ACM Transactions on Internet of Things (ACM TIoT) as well as Editor-in-Chief of Computing (Springer). He is an Associate Editor of IEEE Transactions on Services Computing, IEEE Transactions on Cloud Computing, ACM Transactions on the Web, and ACM Transactions on Internet Technology, as well as on the editorial board of IEEE Internet Computing and IEEE Computer. Dustdar is recipient of the ACM Distinguished Scientist award (2009), the IBM Faculty Award (2012), an elected member of the Academia Europaea: The Academy of Europe, where he is chairman of the Informatics Section, as well as an IEEE Fellow (2016).

  • Foto Afrati,
    National Technical University of Athens

    Title: The Homomorphism Property in Query Containment and Data Integration

    Abstracts: Recent works have added arithmetic to extend the expressiveness of query languages, tuple generating dependencies and data exchange mappings, and studied the complexity of problems such as testing query containment and finding certain answers. When adding arithmetic comparisons, the complexity of such problems is higher than the complexity of their counterparts without them. It has been observed that we can achieve lower complexity if we restrict some of the comparisons to be closed or open semi-interval comparisons. We extend those results, proving upper bounds on the computational complexity that are tighter. Focusing on the problem of containment for conjunctive queries with arithmetic comparisons (CQAC queries for short), we also provide formal evidence that lower bounds for the containment problem are not far from the found upper bounds. Our methodology uses a general property of CQACs and tuple generating dependencies with arithmetic comparisons which is called the homomorphism property. When the homomorphism property holds, then the complexity of the above problems can be shown to be better. We syntactically characterize subclasses of CQACs queries that have the homomorphism property. We show how to apply similar methodology to achieve better upper bounds on the complexity of testing query containment under dependencies, finding query rewritings, and finding certain answers in data exchange, for certain subclasses of tuple generating dependencies with arithmetic comparisons that have the homomorphism property. We are doing that by improving the complexity of the chase algorithm for tuple generating dependencies with arithmetic comparisons.



Important Dates


March 22, 2019: Papers submission deadline: ++plus grace period
May 1, 2019: Notification of acceptance
May 25, 2019: Camera-ready deadline (Final Version of accepted submissions) 

When submitting a paper, pl. select the appropriate track unless you are submitting to the main event (indicated by "General Pool").
Please consult the guides given in the right hand margin for FAQ, submission guidelines etc.


Conference Publication

The conference proceedings will be published by ACM in their digital library; the ISBN assigned by ACM to IDEAS'2019 is: 978-1-4503-6249-8

Please see ACM's copyright policy at:

ACM templates for the final version are at:

A version of the proceedings to be distributed to the conference attendees would be prepared by BytePress.



Organized by


Harokopio University of Athens, with the cooperation of ACM, and

General Chairs: .
Bipin C. Desai, Concordia University, Montreal
Dimosthenis Anagnostopoulos, Harokopio University of Athens;

Program Chairs:
Yannis Manolopoulos, Open University of Cyprus
Mara Nikolaidou, Harokopio University of Athens,

Local Chair:
George Dimitrakopoulos
Dimitris Michail, Harokopio University of Athens,

Track Chairs:
Béchara Albouna, University Antonine – Ticket, Lebanon
Mahmoud Barhamgi, Claude Bernard Lyon I University, France
Francesco Buccafurri, Mediterranea University of Reggio Calabria, IT
Richard Chbeir, University Pau & Pays Adour, France
Rui Chen, Samsung, USA
Roberto Nardone, Mediterranea University of Reggio Calabria, IT
Min Xie ,Walmart Labs, USA



IDEAS Steering Committee


Desai, Bipin C. (Chair)  Concordia University
McClatchey, Richard   University of the West of England, Bristol
Ng, Wilfred  Hong Kong University of Science and Technology
Pokorny, Jaroslav  Charles University
Toyama , Motomichi  Keio University
Ullman, Jeffrey  Stanford University

Author/User FAQ
Author Help
Grace Period
Embeding Fonts


Latex acmart.cls
ACM CCS code
Paper Review: tex
Paper Review: pdf
Paper Final: tex
PDF Final: A4
PDF Final: US Ltr
Final Source: zip