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

Andrew Layman

dblp:57/2527 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1997
—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
1 paper
Query processing and optimization · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › aggregation
aggregate functions
0.011996
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total · ICDE 1996
Query processing and optimization › OLAP
data cube
0.011996
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total · ICDE 1996
Query processing and optimization › OLAP
OLAP aggregation
0.011996
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total · ICDE 1996
YearPublicationVenuePosition
1997 Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross-Tab, and Sub Totals
Jim Gray 0001, Surajit Chaudhuri, Adam Bosworth, Andrew Layman, Don Reichart, Murali Venkatrao, Frank Pellow, Hamid Pirahesh
Data Min. Knowl. Discov.4
1996 Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
abstract
Data analysis applications typically aggregate data across many dimensions looking for unusual patterns. The SQL aggregate functions and the GROUP BY operator produce zero-dimensional or one-dimensional answers. Applications need the N-dimensional generalization of these operators. The paper defines that operator, called the data cube or simply cube. The cube operator generalizes the histogram, cross-tabulation, roll-up, drill-down, and sub-total constructs found in most report writers. The cube treats each of the N aggregation attributes as a dimension of N-space. The aggregate of a particular set of attribute values is a point in this space. The set of points forms an N-dimensionaI cube. Super-aggregates are computed by aggregating the N-cube to lower dimensional spaces. Aggregation points are represented by an "infinite value": ALL, so the point (ALL,ALL,...,ALL, sum(*)) represents the global sum of all items. Each ALL value actually represents the set of values contributing to that aggregation.
Jim Gray 0001, Adam Bosworth, Andrew Layman, Hamid Pirahesh
ICDE3