Demo Data from EDBT 2026 / reviewers in the wild / expert
George Sfakianakis
dblp:131/4730
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Indexing and storage engines · 56% Spatial and temporal data management · 44% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Indexing and storage engines › temporal indexing
interval index |
0.2 | 1 | 2013 | Interval indexing and querying on key-value cloud stores · ICDE 2013 |
Spatial and temporal data management
temporal query processing |
0.2 | 1 | 2013 | Interval indexing and querying on key-value cloud stores · ICDE 2013 |
Indexing and storage engines
key-value store |
0.0 | 1 | 2013 | Interval indexing and querying on key-value cloud stores · ICDE 2013 |
Methods — techniques the papers use, named apart from their topics
mapreduce · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Interval indexing and querying on key-value cloud storesabstractCloud key-value stores are becoming increasingly more important. Challenging applications, requiring efficient and scalable access to massive data, arise every day. We focus on supporting interval queries (which are prevalent in several data intensive applications, such as temporal querying for temporal analytics), an efficient solution for which is lacking. We contribute a compound interval index structure, comprised of two tiers: (i) the MRSegmentTree (MRST), a key-value representation of the Segment Tree, and (ii) the Endpoints Index (EPI), a column family index that stores information for interval endpoints. In addition to the above, our contributions include: (i) algorithms for efficiently constructing and populating our indices using MapReduce jobs, (ii) techniques for efficient and scalable index maintenance, and (iii) algorithms for processing interval queries. We have implemented all algorithms using HBase and Hadoop, and conducted a detailed performance evaluation. We quantify the costs associated with the construction of the indices, and evaluate our query processing algorithms using queries on real data sets. We compare the performance of our approach to two alternatives: the native support for interval queries provided in HBase, and the execution of such queries using the Hive query execution tool. Our results show a significant speedup, far outperforming the state of the art. George Sfakianakis, Ioannis Patlakas, Nikos Ntarmos, Peter Triantafillou |
ICDE | 1 |