Alessio Conte

Dr. Alessio Conte

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
18 August 2022 in ACM Transactions on Database Systems
Verified
Journal Article
Open access
NCNofar Carmeli
Nofar Carmeli
SZShai Zeevi
Shai Zeevi
CBChristoph Berkholz
Christoph Berkholz
ACAlessio Conte
Alessio Conte
BKBenny Kimelfeld
Benny Kimelfeld
NSNicole Schweikardt
Nicole Schweikardt
As data analytics becomes more crucial to digital systems, so grows the importance of characterizing the database queries that admit a more efficient evaluation. We consider the tractability yardstick of answer enumeration with a polylogarithmic delay after a linear-time preprocessing phase. Such an evaluation is obtained by constructing, in the preprocessing phase, a data structure that supports polylogarithmic-delay enumeration. In this article, we seek a structure that supports the more demanding task of a “random permutation”: polylogarithmic-delay enumeration in truly random order. Enumeration of this kind is required if downstream applications assume that the intermediate results are representative of the whole result set in a statistically meaningful manner. An even more demanding task is that of “random access”: polylogarithmic-time retrieval of an answer whose position is given.We establish that the free-connex acyclic CQs are tractable in all three senses: enumeration, random-order enumeration, and random access; and in the absence of self-joins, it follows from past results that every other CQ is intractable by each of the three (under some fine-grained complexity assumptions). However, the three yardsticks are separated in the case of aunion of CQs (UCQ): while a union of free-connex acyclic CQs has a tractable enumeration, it may (provably) admit no random access. We identify a fragment of such UCQs where we can guarantee random access with polylogarithmic access time (and linear-time preprocessing) and a more general fragment where we can guarantee tractable random permutation. For general unions of free-connex acyclic CQs, we devise two algorithms with relaxed guarantees: one has logarithmic delay in expectation, and the other provides a permutation that is almost uniformly distributed. Finally, we present an implementation and an empirical study that show a considerable practical superiority of our random-order enumeration approach over state-of-the-art alternatives.

1 January 2019 in SIAM Journal on Discrete Mathematics
Verified
Journal Article
Closed access
ACAlessio Conte
Alessio Conte
RGRoberto Grossi
Roberto Grossi
AMAndrea Marino
Andrea Marino
LVLuca Versari
Luca Versari
Algorithms for listing the subgraphs satisfying a given property (e.g., being a clique, a cut, a cycle) fall within the general framework of set systems. A set system $(\mathcal{U}, \mathcal{F})$ consists of a ground set $\mathcal{U}$ (e.g., a network's nodes) and a family $\mathcal{F} \subseteq 2^{\mathcal{U}}$ of subsets of $\mathcal{U}$ that have the required property. For the problem of listing all sets in $\mathcal{F}$ maximal under inclusion, the ambitious goal is to cover a large class of set systems, preserving at the same time the efficiency of the enumeration. Among the existing algorithms, the best-known ones list the maximal subsets in time proportional to their number but may require exponential space. In this paper we improve the state of the art in two directions by introducing an algorithmic framework based on reverse search that, under standard suitable conditions, simultaneously (i) extends the class of problems that can be solved efficiently to strongly accessible set systems and (ii) r...

14 December 2019 in Algorithmica
Verified
Journal Article
Closed access
PDF file
ACAlessio Conte
Alessio Conte
RGRoberto Grossi
Roberto Grossi
Andrea MarinoAndrea Marino
Andrea Marino
LVLuca Versari
Luca Versari

28 October 2022 in SIAM Journal on Computing
Verified
Journal Article
Closed access
ACAlessio Conte
Alessio Conte
RGRoberto Grossi
Roberto Grossi
AMAndrea Marino
Andrea Marino
TUTakeaki Uno
Takeaki Uno
LVLuca Versari
Luca Versari
This paper proposes a new general technique for maximal subgraph enumeration which we call proximity search, whose aim is to design efficient enumeration algorithms for problems that coul...

1 March 2023
Verified
Conference Paper
Closed access
ACAlessio Conte
Alessio Conte
NCNicola Cotumaccio
Nicola Cotumaccio
TGTravis Gagie
Travis Gagie
GMGiovanni Manzini
Giovanni Manzini
NPNicola Prezza
Nicola Prezza
MSMarinella Sciortino
Marinella Sciortino
Matching statistics were introduced to solve the approximate string matching problem, which is a recurrent subroutine in bioinformatics applications. In 2010, Ohlebusch et al. [SPIRE 2010] proposed a time and space efficient algorithm for computing matching statistics which relies on some components of a compressed suffix tree-notably, the longest common prefix (LCP) array. In this paper, we show how their algorithm can be generalized from strings to Wheeler deterministic finite automata. Most importantly, we introduce a notion of LCP array for Wheeler automata, thus establishing a first clear step towards extending (compressed) suffix tree functionalities to labeled graphs.

1 January 2022 in Theoretical Computer Science
Verified
Journal Article
Closed access
ACAlessio Conte
Alessio Conte
ETEtsuji Tomita
Etsuji Tomita