Matteo Interlandi

Matteo Interlandi

Auto-generated profile, based on publicly available information

Matteo Interlandi

Microsoft, Redmond, USA

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
25 July 2019
Verified
Conference Paper
Open access
ZAZeeshan Ahmed
Zeeshan Ahmed
SASaeed Amizadeh
Saeed Amizadeh
MBMikhail Bilenko
Mikhail Bilenko
RCRogan Carr
Rogan Carr
WCWei-Sheng Chin
Wei-Sheng Chin
YZYiwen Zhu
Yiwen Zhu

23 August 2017 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
CZCarlo Zaniolo
Carlo Zaniolo
MYMohan Yang
Mohan Yang
ADAriyam DAS
Ariyam DAS
ASAlexander Shkapsky
Alexander Shkapsky
TCTyson Condie
Tyson Condie
MIMatteo Interlandi
Matteo Interlandi
A very desirable Datalog extension investigated by many researchers in the last 30 years consists in allowing the use of the basic SQL aggregates min, max, count and sum in recursive rules. In this paper, we propose a simple comprehensive solution that extends the declarative least-fixpoint semantics of Horn Clauses, along with the optimization techniques used in the bottom-up implementation approach adopted by many Datalog systems. We start by identifying a large class of programs of great practical interest in which the use of min or max in recursive rules does not compromise the declarative fixpoint semantics of the programs using those rules. Then, we revisit the monotonic versions of count and sum aggregates proposed by Mazuran et al. (2013b, The VLDB Journal 22, 4, 471–493) and named, respectively, mcount and msum. Since mcount, and also msum on positive numbers, are monotonic in the lattice of set-containment, they preserve the fixpoint semantics of Horn Clauses. However, in many applications of practical interest, their use can lead to inefficiencies, that can be eliminated by combining them with max, whereby mcount and msum become the standard count and sum. Therefore, the semantics and optimization techniques of Datalog are extended to recursive programs with min, max, count and sum, making possible the advanced applications of superior performance and scalability demonstrated by BigDatalog (Shkapsky et al. 2016. In SIGMOD. ACM, 1135–1149) and Datalog-MC (Yang et al. 2017. The VLDB Journal 26, 2, 229–248).

7 August 2017 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
MIMatteo Interlandi
Matteo Interlandi
AEAri Ekmekji
Ari Ekmekji
KSKshitij Shah
Kshitij Shah
MGMuhammad Ali Gulzar
Muhammad Ali Gulzar
STSai Deep Tetali
Sai Deep Tetali
TCTyson Condie
Tyson Condie

24 April 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Open access
MPMatteo Paganelli
Matteo Paganelli
PSPaolo Sottovia
Paolo Sottovia
KPKwanghyun Park
Kwanghyun Park
MIMatteo Interlandi
Matteo Interlandi
FGFrancesco GUERRA
Francesco GUERRA
In the past decade, many approaches have been suggested to execute ML workloads on a DBMS. However, most of them have looked at in-DBMS ML from a training perspective, whereas ML inference has been largely overlooked. We think that this is an important gap to fill for two main reasons: (1) in the near future, every application will be infused with some sort of ML capability; (2) behind every web page, application, and enterprise there is a DBMS, whereby in-DBMS inference is an appealing solution both for efficiency (e.g., less data movement), performance (e.g., cross-optimizations between relational operators and ML) and governance. In this paper, we study whether DBMSs are a good fit for prediction serving. We introduce a technique for translating trained ML pipelines containing both featurizers (e.g., one-hot encoding) and models (e.g., linear and tree-based models) into SQL queries, and we compare in-DBMS performance against popular ML frameworks such as Sklearn and ml.net . Our experiments show that, when pushed inside a DBMS, trained ML pipelines can have performance comparable to ML frameworks in several scenarios, while they perform quite poorly on text featurization and over (even simple) neural networks.

18 June 2023
Verified
Conference Paper
Open access
WCWei Cui
Wei Cui
QZQianxi Zhang
Qianxi Zhang
SBSpyros Blanas
Spyros Blanas
JCJesús Camacho-Rodríguez
Jesús Camacho-Rodríguez
BHBrandon Haynes
Brandon Haynes
MIMatteo Interlandi
Matteo Interlandi

4 June 2023
Verified
Conference Paper
Open access
YZYiwen Zhu
Yiwen Zhu
YTYuanyuan Tian
Yuanyuan Tian
JCJoyce Cahoon
Joyce Cahoon
SKSubru Krishnan
Subru Krishnan
AAAnkita Agarwal
Ankita Agarwal
RRRaghu Ramakrishnan
Raghu Ramakrishnan