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

Aleksandras Surna

dblp:58/2916 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2011
—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
Query processing and optimization · 58% Indexing and storage engines · 25% Database system architecture and tuning · 12%
Software engineering, system software, and programming languages
1 paper
Software testing · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
query optimization
0.222011
SQL server column store indexes · SIGMOD Conference 2011
Optimizing Star Join Queries for Data Warehousing in Microsoft SQL Server · ICDE 2008
Indexing and storage engines
column store
0.112011
SQL server column store indexes · SIGMOD Conference 2011
Query processing and optimization
query execution
0.112008
Optimizing Star Join Queries for Data Warehousing in Microsoft SQL Server · ICDE 2008
Software testing
random testing
0.112007
A genetic approach for random testing of database systems · VLDB 2007
Data integration and cleaning
data warehouse
0.012008
Optimizing Star Join Queries for Data Warehousing in Microsoft SQL Server · ICDE 2008
Database system architecture and tuning
database engine testing
0.012007
A genetic approach for random testing of database systems · VLDB 2007

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

genetic algorithm · 0.1batch processing · 0.1right-deep hash joins · 0.1nested loops joins · 0.1cost-based optimization · 0.1
YearPublicationVenuePosition
2011 SQL server column store indexes
abstract
The SQL Server 11 release (code named Denali) introduces a new data warehouse query acceleration feature based on a new index type called a column store index. The new index type combined with new query operators processing batches of rows greatly improves data warehouse query performance: in some cases by hundreds of times and routinely a tenfold speedup for a broad range of decision support queries. Column store indexes are fully integrated with the rest of the system, including query processing and optimization. This paper gives an overview of the design and implementation of column store indexes including enhancements to query processing and query optimization to take full advantage of the new indexes. The resulting performance improvements are illustrated by a number of example queries.
Per-Åke Larson, Cipri Clinciu, Eric N. Hanson, Artem Oks, Susan Price, Srikumar Rangarajan, Aleksandras Surna
SIGMOD Conference7
2008 Optimizing Star Join Queries for Data Warehousing in Microsoft SQL Server
abstract
As mainstream data warehouses are growing into the multi-terabyte range, adequate performance for decision support queries remains challenging for database query processors. Proper choice of query plan is essential in data warehouses where fact tables often store billions of rows. This paper discusses query optimization and execution strategies that Microsoft SQL Server employs for decision support queries in dimensionally modeled relational data warehouses. Our approach is based on pattern matching to detect typical star query patterns. When matching the pattern, the optimizer generates additional query plan alternatives specifically optimized for data warehouse performance. For high selectivity queries, the plans use nested loops joins and seeks. Medium selectivity queries in turn rely on right-deep hash joins with bitmap filters. Bitmap filters perform semi-join reductions to efficiently prune out non-qualifying rows early. Final plan choice is left for cost-based optimization which also compares the data warehouse specific plans against conventional query plans. We conducted an extensive experimental investigation using both synthetic workloads and several customer workloads. As our results show, the new plan shapes and execution strategies yield significant performance improvements across the targeted workloads as compared to earlier versions of Microsoft SQL Server.
César A. Galindo-Legaria, Torsten Grabs, Sreenivas Gukal, Steve Herbert, Aleksandras Surna, Shirley Wang, Peter Zabback, Shin Zhang
ICDE5
2007 A genetic approach for random testing of database systems
Hardik Bati, Leo Giakoumakis, Steve Herbert, Aleksandras Surna
VLDB4