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

Theo Vassilakis

dblp:11/780 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

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

Databases, data management, data science and information retrieval · 3

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
Database system architecture and tuning · 44% Query processing and optimization · 35% Data integration and cleaning · 9%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Database system architecture and tuning
disaggregated storage and compute
0.412020
Dremel: A Decade of Interactive SQL Analysis at Web Scale · Proc. VLDB Endow. 2020
Indexing and storage engines
columnar storage
0.112010
Dremel: Interactive Analysis of Web-Scale Datasets · Proc. VLDB Endow. 2010
Data integration and cleaning
approximate matching
0.112005
Data cleaning in microsoft SQL server 2005 · SIGMOD Conference 2005
Data integration and cleaning › data preprocessing
data cleaning
0.112005
Data cleaning in microsoft SQL server 2005 · SIGMOD Conference 2005
Distributed and cloud data management
mapreduce
0.012010
Dremel: Interactive Analysis of Web-Scale Datasets · Proc. VLDB Endow. 2010

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

columnar storage · 0.9in-situ analysis · 0.4in situ analysis · 0.4multi-level execution trees · 0.1columnar data layout · 0.1
YearPublicationVenuePosition
2020 Dremel: A Decade of Interactive SQL Analysis at Web Scale
abstract
Google's Dremel was one of the first systems that combined a set of architectural principles that have become a common practice in today's cloud-native analytics tools, including disaggregated storage and compute, in situ analysis, and columnar storage for semistructured data. In this paper, we discuss how these ideas evolved in the past decade and became the foundation for Google BigQuery.
Sergey Melnik 0001, Andrey Gubarev, Jing Jing Long, Geoffrey Romer, Shiva Shivakumar, Matt Tolton, Theo Vassilakis, Hossein Ahmadi 0001, Dan Delorey, Slava Min, Mosha Pasumansky, Jeff Shute
Proc. VLDB Endow.7
2010 Dremel: Interactive Analysis of Web-Scale Datasets
abstract
Dremel is a scalable, interactive ad-hoc query system for analysis of read-only nested data. By combining multi-level execution trees and columnar data layout, it is capable of running aggregation queries over trillion-row tables in seconds. The system scales to thousands of CPUs and petabytes of data, and has thousands of users at Google. In this paper, we describe the architecture and implementation of Dremel, and explain how it complements MapReduce-based computing. We present a novel columnar storage representation for nested records and discuss experiments on few-thousand node instances of the system.
Sergey Melnik 0001, Andrey Gubarev, Jing Jing Long, Geoffrey Romer, Shiva Shivakumar, Matt Tolton, Theo Vassilakis
Proc. VLDB Endow.7
2005 Data cleaning in microsoft SQL server 2005
abstract
When collecting and combining data from various sources into a data warehouse, ensuring high data quality and consistency becomes a significant, often expensive, challenge. Common data quality problems include inconsistent data conventions amongst sources such as different abbreviations or synonyms; data entry errors such as spelling mistakes; missing, incomplete, outdated or otherwise incorrect attribute values. These data defects generally manifest themselves as foreign-key mismatches and approximately duplicate records, both of which make further data mining and decision support analyses either impossible or suspect. We demonstrate two new data cleansing operators, Fuzzy Lookup and Fuzzy Grouping, which address these problems in a scalable and domain-independent manner. These operators are implemented within Microsoft SQL Server 2005 Integration Services. Our demo will explain their functionality and highlight multiple real-world scenarios in which they can be used to achieve high data quality.
Surajit Chaudhuri, Kris Ganjam, Venkatesh Ganti, Rahul Kapoor, Vivek R. Narasayya, Theo Vassilakis
SIGMOD Conference6