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

Richard Michael Grantham Wesley

dblp:10/9727 · also Richard Wesley · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2017
—ORCID · none

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

Databases, data management, data science and information retrieval · 5 · 3 first-authorArtificial intelligence and machine learning · 1

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 · 92% Database system architecture and tuning · 8%
Computer graphics and multimedia
2 papers
Visualization and visual analytics · 100%

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

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
interactive visualization
0.322015
On Improving User Response Times in Tableau · SIGMOD Conference 2015
An analytic data engine for visualization in tableau · SIGMOD Conference 2011
Query processing and optimization › cardinality estimation
distinct element counting
0.212016
Incremental Computation of Common Windowed Holistic Aggregates · Proc. VLDB Endow. 2016
Query processing and optimization
incremental computation
0.212016
Incremental Computation of Common Windowed Holistic Aggregates · Proc. VLDB Endow. 2016
Query processing and optimization
parallel query processing
0.212015
On Improving User Response Times in Tableau · SIGMOD Conference 2015
Query processing and optimization
query result caching
0.212015
On Improving User Response Times in Tableau · SIGMOD Conference 2015
Query processing and optimization
compressed data processing
0.212014
Leveraging compression in the tableau data engine · SIGMOD Conference 2014
Query processing and optimization
query optimization
0.112014
Leveraging compression in the tableau data engine · SIGMOD Conference 2014

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

prefetching · 0.4caching · 0.4incremental state reuse · 0.2compression · 0.2
YearPublicationVenuePosition
2017 Spreadsheet Property Detection With Rule-assisted Active Learning
abstract
Spreadsheets are a critical and widely-used data management tool. Converting spreadsheet data into relational tables would bring benefits to a number of fields, including public policy, public health, and economics. Research to date has focused on designing domain-specific languages to describe transformation processes or automatically converting a specific type of spreadsheets. To handle a larger variety of spreadsheets, we have to identify various spreadsheet properties, which correspond to a series of transformation programs that contribute towards a general framework that converts spreadsheets to relational tables.
Zhe Chen 0014, Sasha Dadiomov, Richard Michael Grantham Wesley, Daniel Cory, Michael J. Cafarella, Jock D. Mackinlay
CIKM3
2016 Incremental Computation of Common Windowed Holistic Aggregates
abstract
Windowed aggregates are a SQL 2003 feature for computing aggregates in moving windows. Common examples include cumulative sums, local maxima and moving quantiles. With the advent over the last few years of easy-to-use data analytics tools, these functions are becoming widely used by more and more analysts, but some aggregates (such as local maxima) are much easier to compute than others (such as moving quantiles). Nevertheless, aggregates that are more difficult to compute, like quantile and mode (or "most frequent") provide more appropriate statistical summaries in the common situation when a distribution is not Gaussian and are an essential part of a data analysis toolkit. Recent work has described highly efficient windowed implementations of the most common aggregate function categories, including distributive 1 aggregates such as cumulative sums and algebraic aggregates such as moving averages. But little has been published on either the implementation or the performance of the more complex holistic windowed aggregates such as moving quantiles. This paper provides the first in-depth study of how to efficiently implement the three most common holistic windowed aggregates (count distinct, mode and quantile) by reusing the aggregate state between consecutive frames. Our measurements show that these incremental algorithms generally achieve improvements of about 10x over naïve implementations, and that they can effectively detect when to reset the internal state during extreme frame variation.
Richard Michael Grantham Wesley
Proc. VLDB Endow.1
2015 On Improving User Response Times in Tableau
abstract
The rapid increase in data volumes and complexity of applied analytical tasks poses a big challenge for visualization solutions. It is important to keep the experience highly interactive, so that users stay engaged and can perform insightful data exploration. Query processing usually dominates the cost of visualization generation. Therefore, in order to achieve acceptable response times, one needs to utilize backend capabilities to the fullest and apply techniques, such as caching or prefetching. In this paper we discuss key data processing components in Tableau: the query processor, query caches, Tableau Data Engine [1, 2] and Data Server. Furthermore, we cover recent performance improvements related to the number and quality of remote queries, broader reuse of cached data, and application of inter and intra query parallelism.
Pawel Terlecki, Marianne Shaw, Valeri Kim, Richard Michael Grantham Wesley
SIGMOD Conference5
2014 Leveraging compression in the tableau data engine
abstract
Data sets are growing rapidly and there is an attendant need for tools that facilitate human analysis of them in a timely manner. To help meet this need, column-oriented databases (or "column stores") have come into wide use because of their low latency on analytic workloads. Column stores use a number of techniques to produce these dramatic performance techniques, including the ability to perform operations directly on compressed data. In this paper, we describe how the Tableau Data Engine (an internally developed column store) leverages a number of compression techniques to improve query performance. The approach is simpler than existing systems for operating on compressed data and more unified, removing the necessity for custom data access mechanisms. The approach also uses some novel metadata extraction techniques to improve the choices made by the system's run-time optimizer.
Richard Michael Grantham Wesley, Pawel Terlecki
SIGMOD Conference1
2011 An analytic data engine for visualization in tableau
abstract
Efficient data processing is critical for interactive visualization of analytic data sets. Inspired by the large amount of recent research on column-oriented stores, we have developed a new specialized analytic data engine tightly-coupled with the Tableau data visualization system. The Tableau Data Engine ships as an integral part of Tableau 6.0 and is intended for the desktop and server environments. This paper covers the main requirements of our project, system architecture and query-processing pipeline. We use real-life visualization scenarios to illustrate basic concepts and provide experimental evaluation.
Richard Michael Grantham Wesley, Matthew Eldridge, Pawel Terlecki
SIGMOD Conference1