Demo Data from VLDB 2026 / reviewers in the wild / expert
Matthew Denny
dblp:72/5226
· DBLP profile ↗
6ranked-venue papers
5as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 6 · 5 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
4 papers |
Query processing and optimization · 57% Data stream processing · 34% Data integration and cleaning · 9% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data stream processing
continuous query processing |
0.1 | 2 | 2006 | Operators for Expensive Functions in Continuous Queries · ICDE 2006 Predicate Result Range Caching for Continuous Queries · SIGMOD Conference 2005 |
Query processing and optimization
adaptive query processing |
0.1 | 1 | 2006 | Adaptive Execution of Variable-Accuracy Functions · VLDB 2006 |
Query processing and optimization › query optimization
user-defined function optimization |
0.1 | 1 | 2006 | Operators for Expensive Functions in Continuous Queries · ICDE 2006 |
Data integration and cleaning › data extraction › web data extraction
wrapper generation |
0.0 | 1 | 1999 | Nodose Version 2.0 · SIGMOD Conference 1999 |
Query processing and optimization
query optimization |
0.0 | 1 | 2006 | Operators for Expensive Functions in Continuous Queries · ICDE 2006 |
Data integration and cleaning
data extraction |
0.0 | 1 | 1999 | Nodose Version 2.0 · SIGMOD Conference 1999 |
Methods — techniques the papers use, named apart from their topics
adaptive execution · 0.1accuracy-work trade-off · 0.1range expansion algorithms · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Operators for Expensive Functions in Continuous QueriesabstractMany analysis and monitoring applications require the repeated execution of expensive functions over streams of rapidly changing data. These applications appear in fields as varied as finance, supply chain management, and power utility monitoring.While many of these applications can be expressed declaratively, current continuous query processors are not designed to optimize queries with expensive user-defined functions. Such optimizations are hindered by "black box" function interfaces, where the operator has no control over the processing inside each invocation. We are currently developing VAOs (Variable Accuracy Operators), a new class of operators that allow the query processor to speed up individual function calls. VAOs use a new function interface that exposes the trade-off between work and accuracy inherent inmany functions. Using this new interface, VAOs can eliminate unneeded work by running each function call to only the accuracy needed by the query. VAOs play a key role in our larger research agenda of optimizing queries with expensive functions, and we briefly describe this larger agenda as well. Matthew Denny, Michael J. Franklin |
ICDE | 1 |
| 2006 | Adaptive Execution of Variable-Accuracy Functions
Matthew Denny, Michael J. Franklin |
VLDB | 1 |
| 2005 | Predicate Result Range Caching for Continuous QueriesabstractMany analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be expressed declaratively, but the continuous query processors developed to date are not designed to optimize queries with expensive functions. To speed up such queries, we present CASPER: the CAching System for PrEdicate Result ranges. CASPER computes and caches predicate result ranges, which are ranges of stream input values where the system knows the results of expensive predicate evaluations. Over time, CASPER expands ranges so that they are more likely to contain future stream values. This paper presents the CASPER architecture, as well as algorithms for computing and expanding ranges for a large class of predicates. We demonstrate the effectiveness of CASPER using a prototype implementation and a financial application using real bond market data. Matthew Denny, Michael J. Franklin |
SIGMOD Conference | 1 |
| 2004 | Edison: Database-Supported Synchronization for PDAs
Matthew Denny, Michael J. Franklin |
Distributed Parallel Databases | 1 |
| 2003 | Mobiscope: A Scalable Spatial Discovery Service for Mobile Network Resources
Matthew Denny, Michael J. Franklin, Paul C. Castro, Apratim Purakayastha |
Mobile Data Management | 1 |
| 1999 | Nodose Version 2.0abstractThis paper describes a tool, called Nodose, we have developed to expedite the creation of robust wrappers. Nodose allows non-programmers to build components that can convert data from the source format to XML or another generic format. Further, the generated code performs a set of statistical checks at runtime that attempt to find extraction errors before they are propogated back to users. Brad Adelberg, Matthew Denny |
SIGMOD Conference | 2 |