Spreadsheets in RDBMS for OLAP

Witkowski, Andrew; Bellamkonda, Srikanth; Bozkaya, Tolga; Dorman, Gregory; Folkert, Nathan; Gupta, Abhinav; Shen, Lei; Subramanian, Sankar

doi:10.1145/872757.872767

Cited by 39 publications

(8 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If we have style(ai) = style(aj), then (ai, aj) is not likely to be a true ParentChild pair. For example in Figure 1, the left attribute at row 23 has the same formatting style as the one at row 21: style(23) = style (21), and so we do not consider this a ParentChild candidate (21,23).…”

Section: Algorithm 1: Classificationmentioning

confidence: 99%

“…There is other research on spreadsheets attempting to build database-like operators on a spreadsheet-style interface [14,22,23,25], but these systems cannot be directly used to manage the large number of spreadsheets that already exist on the Web. The QueryByExcel project [23,24,25] uses a spreadsheet as a front end of the relational database.…”

Section: Related Workmentioning

confidence: 99%

“…The QueryByExcel project [23,24,25] uses a spreadsheet as a front end of the relational database. It translates Excel formulas using an extension of SQL relational operations and performs on RDBMS tables.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Automatic web spreadsheet data extraction

Chen

Cafarella

2013

Proceedings of the 3rd International Workshop on Semantic Search Over the Web

View full text Add to dashboard Cite

Spreadsheets contain a huge amount of high-value data but do not observe a standard data model and thus are difficult to integrate. A large number of data integration tools exist, but they generally can only work on relational data. Existing systems for extracting relational data from spreadsheets are too labor intensive to support ad-hoc integration tasks, in which the correct extraction target is only learned during the course of user interaction.This paper introduces a system that automatically extracts relational data from spreadsheets, thereby enabling relational spreadsheet integration. The resulting integrated relational data can be queried directly or can be translated into RDF triples. When compared to standard techniques for spreadsheet data extraction on a set of 100 random Web spreadsheets, the system reduces the amount of human labor by 72% to 92%. In addition to the system design, we present the results of a general survey of more than 400,000 spreadsheets we downloaded from the Web, giving a novel view of how users organize their data in spreadsheets.

show abstract

Section: Algorithm 1: Classificationmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Automatic web spreadsheet data extraction

Chen

Cafarella

2013

Proceedings of the 3rd International Workshop on Semantic Search Over the Web

View full text Add to dashboard Cite

show abstract

“…A clustering algorithm programming with SQL queries is explored in [3], which shows a horizontal layout of the data set enables easier & simple SQL queries. To perform spreadsheet-like operations alternative SQL extensions were introduced in [4]. Their optimizations have the purpose of avoiding joins to express cell formulas but they are not optimized to perform partial transposition for each group of result rows.…”

Section: Literature Surveymentioning

confidence: 99%

A Survey on Preparing Data Sets for Data Mining Analysis using Horizontal Aggregations in SQL

Rajole¹

2017

IJARCSSE

View full text Add to dashboard Cite

Abstract-Data mining is the field which has effectiveness in real world scenarios. Data sets are prepared from accepted transactional databases for the purpose of data mining. A vast amount of time is needed for creating the dataset for the data mining analysis because data mining developers required to write multifaceted SQL queries and many tables are to be coupled to get the aggregated result. Here, we recommended simple, however powerful, techniques to generate SQL code to formulate aggregated columns in a very horizontal tabular page layout, getting a few numbers as opposed to one variety per short period. This new functions class is named horizontal aggregations. Data sets are build using horizontal aggregations with a horizontal de-normalized layout (e.g., observation-variable, point dimension, instance-feature) which is the standard layout required by most data mining algorithms. Building user-defined new aggregate function that aggregate numeric expressions and transpose results to produce a data set with a horizontal layout is focused in this paper. Horizontal aggregations represent an ex-tended form of traditional SQL aggregations in which it returns a set of values in a horizontal layout. It is a new class of aggregations that have similar behavior to SQL standard aggregations which produces tables with a horizontal layout. As compare to standard SQL aggregations we call it vertical aggregations since they produce tables with a vertical layout. In Horizontal aggregations just require a small syntax extension to aggregate functions called in a SELECT statement. In other words, horizontal aggregations can be used to generate SQL code from a data mining tool to build data sets for data mining analysis.

show abstract

“…The proposed syntactic constructs enable the succinct expression of queries that manipulate bounded multisets. Further, specialized syntax for commonly used operations can help the database system choose efficient query processing algorithms to execute the query [2,11].…”

Section: Extending Sqlmentioning

confidence: 99%

Symmetric Relations and Cardinality-Bounded Multisets in Database Systems

ROSS¹,

STOYANOVICH²

2004

Proceedings 2004 VLDB Conference

View full text Add to dashboard Cite

In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of cardinality k. Cardinality-bounded multisets are natural in several real-world applications. Conventional representations in relational databases suffer from several consistency and performance problems. We argue that the database system itself should provide native support for cardinality-bounded multisets. We provide techniques to be implemented by the database engine that avoid the drawbacks, and allow a schema designer to simply declare a table to be symmetric in certain attributes. We describe a compact data structure, and update methods for the structure. We describe an algebraic symmetric closure operator, and show how it can be moved around in a query plan during query optimization in order to improve performance. We describe indexing methods that allow efficient lookups on the symmetric columns. We show how to perform database normalization in the presence of symmetric relations. We provide techniques for inferring that a view is symmetric. We also describe a syntactic SQL extension that allows the succinct formulation of queries over symmetric relations.

show abstract

Spreadsheets in RDBMS for OLAP

Cited by 39 publications

References 13 publications

Automatic web spreadsheet data extraction

Automatic web spreadsheet data extraction

A Survey on Preparing Data Sets for Data Mining Analysis using Horizontal Aggregations in SQL

Symmetric Relations and Cardinality-Bounded Multisets in Database Systems

Contact Info

Product

Resources

About