H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 42 Citations 7,942 82 World Ranking 4180 National Ranking 2103

Research.com Recognitions

Awards & Achievements

2004 - ACM Fellow For contributions to query processing and access methods in database systems.

Overview

What is he best known for?

The fields of study he is best known for:

  • Database
  • Operating system
  • Programming language

Per-Ake Larson spends much of his time researching Database, Theoretical computer science, Query optimization, View and Algorithm. His study in Database transaction, Multiversion concurrency control, Distributed transaction, Serializability and Optimistic concurrency control are all subfields of Database. His Theoretical computer science research focuses on subjects like Sargable, which are linked to RDF query language and Data mining.

His Query optimization study combines topics in areas such as Scalability, Joins, Scripting language and Materialized view. His studies deal with areas such as Data access and Data mapping as well as View. His Algorithm research includes elements of Representation, Dynamic perfect hashing and Index.

His most cited work include:

  • SCOPE: easy and efficient parallel processing of massive data sets (736 citations)
  • Hekaton: SQL server's memory-optimized OLTP engine (340 citations)
  • Optimizing queries using materialized views: a practical, scalable solution (278 citations)

What are the main themes of his work throughout his whole career to date?

Per-Ake Larson mostly deals with Database, Query optimization, Data mining, Materialized view and Database transaction. As part of his studies on Database, he often connects relevant subjects like Database index. His Query optimization research incorporates elements of Theoretical computer science, View and Online aggregation, Sargable.

He interconnects Joins, SQL and Selection in the investigation of issues within Theoretical computer science. His work in Data mining addresses issues such as Expression, which are connected to fields such as Tree. The concepts of his Database transaction study are interwoven with issues in Timestamp and Table.

He most often published in these fields:

  • Database (39.22%)
  • Query optimization (24.51%)
  • Data mining (23.53%)

What were the highlights of his more recent work (between 2011-2020)?

  • Database (39.22%)
  • Database transaction (14.71%)
  • Computing systems (4.90%)

In recent papers he was focusing on the following fields of study:

Per-Ake Larson mainly focuses on Database, Database transaction, Computing systems, Data mining and Sequence. In general Database, his work in Online transaction processing, Table and Transaction processing is often linked to System of record linking many areas of study. Per-Ake Larson has included themes like Data structure, Operating system, Database engine, Stored procedure and Multiversion concurrency control in his Online transaction processing study.

His work deals with themes such as Component-oriented database, Process, Sargable and Optimistic concurrency control, which intersect with Table. The study incorporates disciplines such as Range, Trie and Reinforcement learning in addition to Data mining. In his work, Query optimization is strongly intertwined with Distributed computing, which is a subfield of Transaction processing system.

Between 2011 and 2020, his most popular works were:

  • Hekaton: SQL server's memory-optimized OLTP engine (340 citations)
  • SCOPE: parallel databases meet MapReduce (124 citations)
  • Bztree: a high-performance latch-free range index for non-volatile memory (49 citations)

In his most recent research, the most cited papers focused on:

  • Database
  • Operating system
  • Programming language

The scientist’s investigation covers issues in Data structure, Online transaction processing, Database, Throughput and Auxiliary memory. His Data structure research integrates issues from Bloom filter, Database transaction, Multiversion concurrency control and Stored procedure. His studies in Multiversion concurrency control integrate themes in fields like Sql server and Machine code.

His work in Online transaction processing tackles topics such as Database engine which are related to areas like Table and Optimistic concurrency control. The Scalability research Per-Ake Larson does as part of his general Database study is frequently linked to other disciplines of science, such as Explicit parallelism, therefore creating a link between diverse domains of science. The various areas that Per-Ake Larson examines in his Auxiliary memory study include Dram, Key, Overhead and Non-blocking algorithm.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

SCOPE: easy and efficient parallel processing of massive data sets

Ronnie Chaiken;Bob Jenkins;Per-Åke Larson;Bill Ramsey.
very large data bases (2008)

1012 Citations

Hekaton: SQL server's memory-optimized OLTP engine

Cristian Diaconu;Craig Freedman;Erik Ismert;Per-Ake Larson.
international conference on management of data (2013)

480 Citations

Updating derived relations: detecting irrelevant and autonomously computable updates

José A. Blakeley;Neil Coburn;Per-Åke Larson.
ACM Transactions on Database Systems (1989)

444 Citations

Optimizing queries using materialized views: a practical, scalable solution

Jonathan Goldstein;Per-Åke Larson.
international conference on management of data (2001)

414 Citations

High-performance concurrency control mechanisms for main-memory databases

Per-Åke Larson;Spyros Blanas;Cristian Diaconu;Craig Freedman.
very large data bases (2011)

338 Citations

Eager Aggregation and Lazy Aggregation

Weipeng P. Yan;Per-Åke Larson.
very large data bases (1995)

304 Citations

Dynamic hashing

Per-Åke Larson.
(1978)

275 Citations

Performing group-by before join /spl lsqb/query processing/spl rsqb/

W.P. Yan;P.-A. Larson.
international conference on data engineering (1994)

201 Citations

Performing Group-By before Join

Weipeng P. Yan;Per-Åke Larson.
international conference on data engineering (1994)

176 Citations

SCOPE: parallel databases meet MapReduce

Jingren Zhou;Nicolas Bruno;Ming-Chuan Wu;Per-Ake Larson.
very large data bases (2012)

169 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Per-Ake Larson

Surajit Chaudhuri

Surajit Chaudhuri

Microsoft (United States)

Publications: 38

Wolfgang Lehner

Wolfgang Lehner

TU Dresden

Publications: 37

Thomas Neumann

Thomas Neumann

Technical University of Munich

Publications: 34

Anastasia Ailamaki

Anastasia Ailamaki

École Polytechnique Fédérale de Lausanne

Publications: 31

Alfons Kemper

Alfons Kemper

Technical University of Munich

Publications: 29

Anand Srinivasan

Anand Srinivasan

Business International Corporation

Publications: 26

Srikanth Kandula

Srikanth Kandula

Microsoft (United States)

Publications: 25

Volker Markl

Volker Markl

Technical University of Berlin

Publications: 25

Vijayshankar Raman

Vijayshankar Raman

IBM (United States)

Publications: 23

Walid G. Aref

Walid G. Aref

Purdue University West Lafayette

Publications: 22

Nicolas Bruno

Nicolas Bruno

Microsoft (United States)

Publications: 22

Guido Moerkotte

Guido Moerkotte

University of Mannheim

Publications: 21

Dan Suciu

Dan Suciu

University of Washington

Publications: 21

Jingren Zhou

Jingren Zhou

Alibaba Group (China)

Publications: 21

Ion Stoica

Ion Stoica

University of California, Berkeley

Publications: 21

Something went wrong. Please try again later.