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

Christopher Dudley

dblp:132/9175 · DBLP profile ↗
← Back
2ranked-venue papers
0as 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 · 2

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
2 papers
Query processing and optimization · 28% Machine learning and data management · 26% Data mining · 26%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization › aggregation
user-defined aggregate
0.322017
UDA-GIST: An In-database Framework to Unify Data-Parallel and State-Parallel Analytics · Proc. VLDB Endow. 2015
In-database batch and query-time inference over probabilistic graphical models using UDA-GIST · VLDB J. 2017
Machine learning and data management › in-database machine learning
in-database inference
0.312017
In-database batch and query-time inference over probabilistic graphical models using UDA-GIST · VLDB J. 2017
Data mining
probabilistic graphical models
0.312017
In-database batch and query-time inference over probabilistic graphical models using UDA-GIST · VLDB J. 2017
Database system architecture and tuning › analytical database system
in-database analytics
0.212015
UDA-GIST: An In-database Framework to Unify Data-Parallel and State-Parallel Analytics · Proc. VLDB Endow. 2015

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

markov chain monte carlo · 0.4iterative state transition · 0.4
YearPublicationVenuePosition
2017 In-database batch and query-time inference over probabilistic graphical models using UDA-GIST
Xiaofeng Zhou 0003, Daisy Zhe Wang, Christan Grant, Alin Dobra, Christopher Dudley
VLDB J.6
2015 UDA-GIST: An In-database Framework to Unify Data-Parallel and State-Parallel Analytics
abstract
Enterprise applications need sophisticated in-database analytics in addition to traditional online analytical processing from a database. To meet customers' pressing demands, database vendors have been pushing advanced analytical techniques into databases. Most major DBMSes offer User-Defined Aggregate (UDA), a data-driven operator, to implement many of the analytical techniques in parallel. However, UDAs can not be used to implement statistical algorithms such as Markov chain Monte Carlo (MCMC), where most of the work is performed by iterative transitions over a large state that can not be naively partitioned due to data dependency. Typically, this type of statistical algorithm requires pre-processing to setup the large state in the first place and demands post-processing after the statistical inference. This paper presents General Iterative State Transition (GIST), a new database operator for parallel iterative state transitions over large states. GIST receives a state constructed by a UDA, and then performs rounds of transitions on the state until it converges. A final UDA performs post-processing and result extraction. We argue that the combination of UDA and GIST (UDA-GIST) unifies data-parallel and state-parallel processing in a single system, thus significantly extending the analytical capabilities of DBMSes. We exemplify the framework through two high-profile applications: cross-document coreference and image denoising. We show that the in-database framework allows us to tackle a 27 times larger problem than solved by the state-of-the-art for the first application and achieves 43 times speedup over the state-of-the-art for the second application.
Daisy Zhe Wang, Alin Dobra, Christopher Dudley
Proc. VLDB Endow.4