Georgia Troullinou

Georgia Troullinou

Auto-generated profile, based on publicly available information

Georgia Troullinou

Institute of Computer Science, FORTH, Heraklion, Greece

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 July 2021
Verified
Conference Paper
Open access
GVGiannis Vassiliou
Giannis Vassiliou
GTGeorgia Troullinou
Georgia Troullinou
NPNikolaos Papadakis
Nikolaos Papadakis
Haridimos KondylakisHaridimos Kondylakis
Haridimos Kondylakis
Semantic summaries try to extract compact information from the original RDF graph, while reducing its size. State of the art structural semantic summaries, focus primarily on the graph structure of the data, trying to maximize the summary’s utility for a specific purpose, such as indexing, query answering and source selection. In this paper, we present an approach that is able to construct high quality summaries, exploiting a small part of the query workload, maximizing their utility for query answering, i.e. the query coverage. We demonstrate our approach using two real world datasets and the corresponding query workloads and we show that we strictly dominates current state of the art in terms of query coverage.

13 May 2024
Verified
Conference Paper
Open access
GTGeorgia Troullinou
Georgia Troullinou
Kostas StefanidisKostas Stefanidis
Kostas Stefanidis
DPDimitris Plexousakis
Dimitris Plexousakis
Haridimos KondylakisHaridimos Kondylakis
Haridimos Kondylakis
The rapid explosion of linked data demands effective and efficient storage, management, and querying methods. Apache Spark is one of the most widely used engines for big data processing, with more and more systems adopting it for efficient query answering. Existing approaches, exploiting Spark for querying RDF data, adopt partitioning techniques for reducing the data that need to be accessed in order to improve efficiency. However, simplistic methods for data partitioning fail to minimize data access at query answering and effectively improve query efficiency. In this demonstration, we present DIAERESIS, a novel platform that exploits a summary-based partitioning strategy achieving a significant improvement in minimizing data access and as such improving query-answering efficiency. DIAERESIS first identifies the top-k most important schema nodes and distributes the other schema nodes to the centroid they mostly depend on. Then, it allocates the corresponding instance nodes to the schema nodes they are instantiated under, creating vertical sub-partitions and indexes. We allow conference participants to actively identify the impact of our partitioning methodology on data distribution and replication, data accessed for query answering, and query answering efficiency. Further, we contrast our approach with existing partitioning approaches adopted by state-of-the-art systems in the domain, providing a deep understanding of the challenges in the area.