Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Matthew Russo

dblp:126/0229 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2026
0009-0005-9685-3976ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 3 first-author · 5 since 2021

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
3 papers
Query processing and optimization · 85% Data stream processing · 15%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization › query optimization
cost-based optimization
1.012026
Abacus: A Cost-Based Optimizer for Semantic Operator Systems · Proc. VLDB Endow. 2026
Query processing and optimization
semantic query processing
1.012026
SemBench: A Benchmark for Semantic Query Processing Engines · Proc. VLDB Endow. 2026
Query processing and optimization
aggregate query processing
0.712023
Accelerating Aggregation Queries on Unstructured Streams of Data · Proc. VLDB Endow. 2023
Query processing and optimization
approximate query processing
0.712023
Accelerating Aggregation Queries on Unstructured Streams of Data · Proc. VLDB Endow. 2023
Query processing and optimization
query optimization
0.312026
Abacus: A Cost-Based Optimizer for Semantic Operator Systems · Proc. VLDB Endow. 2026
Performance modeling and evaluation
benchmarking
0.312026
SemBench: A Benchmark for Semantic Query Processing Engines · Proc. VLDB Endow. 2026
Machine learning › Deep learning architectures and training
neural network inference
0.212023
Accelerating Aggregation Queries on Unstructured Streams of Data · Proc. VLDB Endow. 2023

Methods — techniques the papers use, named apart from their topics

sampling · 1.3proxy model · 1.3oracle models · 1.3cost model · 1.0
YearPublicationVenuePosition
2026 Deep Research is the New Analytics System: Towards Building the Runtime for AI-Driven Analytics
Matthew Russo, Tim Kraska
CIDR1
2026 SemBench: A Benchmark for Semantic Query Processing Engines
Jiale Lao, Andreas Zimmerer, Olga Ovcharenko, Tianji Cong, Matthew Russo, Gerardo Vitagliano, Michael Cochez, Fatma Özcan 0001, Gautam Gupta, Thibaud Hottelier, H. V. Jagadish, Kris Kissel, Sebastian Schelter, Andreas Kipf, Immanuel Trummer
Proc. VLDB Endow.5
2026 Abacus: A Cost-Based Optimizer for Semantic Operator Systems
Matthew Russo, Chunwei Liu, Sivaprasad Sudhir, Gerardo Vitagliano, Michael J. Cafarella, Tim Kraska, Samuel Madden 0001
Proc. VLDB Endow.1
2025 Palimpzest: Optimizing AI-Powered Analytics with Declarative Query Processing
Chunwei Liu, Matthew Russo, Michael J. Cafarella, Lei Cao 0004, Peter Baile Chen, Zui Chen, Michael J. Franklin, Tim Kraska, Samuel Madden 0001, Rana Shahout, Gerardo Vitagliano
CIDR2
2023 Accelerating Aggregation Queries on Unstructured Streams of Data
abstract
Analysts and scientists are interested in querying streams of video, audio, and text to extract quantitative insights. For example, an urban planner may wish to measure congestion by querying the live feed from a traffic camera. Prior work has used deep neural networks (DNNs) to answer such queries in the batch setting. However, much of this work is not suited for the streaming setting because it requires access to the entire dataset before a query can be submitted or is specific to video. Thus, to the best of our knowledge, no prior work addresses the problem of efficiently answering queries over multiple modalities of streams. In this work we propose InQuest, a system for accelerating aggregation queries on unstructured streams of data with statistical guarantees on query accuracy. InQuest leverages inexpensive approximation models ("proxies") and sampling techniques to limit the execution of an expensive high-precision model (an "oracle") to a subset of the stream. It then uses the oracle predictions to compute an approximate query answer in real-time. We theoretically analyzed InQuest and show that the expected error of its query estimates converges on stationary streams at a rate inversely proportional to the oracle budget. We evaluated our algorithm on six real-world video and text datasets and show that InQuest achieves the same root mean squared error (RMSE) as two streaming baselines with up to 5.0x fewer oracle invocations. We further show that InQuest can achieve up to 1.9x lower RMSE at a fixed number of oracle invocations than a state-of-the-art batch setting algorithm.
Matthew Russo, Tatsunori B. Hashimoto, Daniel Kang 0001, Yi Sun 0010, Matei Zaharia
Proc. VLDB Endow.1