Translating Relational Queries Into Spreadsheets

 ABSTRACT:

Spreadsheets are among the most commonly used applications for data management and analysis. They combine data processing with very diverse supplementary features: statistics, visualization, reporting, linear programming solvers, Web queries periodically downloading data from external sources, etc. However, the spreadsheet paradigm of computation still lacks sufficient analysis. In this article we demonstrate that a spreadsheet can implement all data transformations definable in SQL, merely by utilizing spreadsheet formulas. We provide a query compiler, which translates any given SQL query into a worksheet of the same semantics, including NULL values. Thereby database operations become available to the users who do not want to migrate to a database. They can define their queries using a high-level language and then get their execution plans in a plain vanilla spreadsheet. The functions available in spreadsheets impose limitations on the algorithms one can implement. In this paper we offer O(n log2 n) sorting spreadsheet, using a non-constant number of rows, and, surprisingly, Depth-First-Search and Breadth-First- Search on graphs.

 AIM

The aims of this paper is demonstrate that a spreadsheet can implement all data transformations definable in SQL, merely by utilizing spreadsheet formulas

 SCOPE

 The Scope of this project is offer O(n log2 n) sorting spreadsheet, using a non-constant number of rows, and, surprisingly, Depth-First-Search and Breadth-First- Search on graphs.

EXISTING SYSTEM

Our  claim of translating SQL queries into spreadsheets does not mean, that we can translate the algorithms typical RDBMS systems employ to implement SQL. In particular, most of the algorithms we use are quadratic, and hence inefficient if used on large data sets. Moreover, our translation tool in its present form does not perform optimization.

DISADVANTAGES:

1.  Query function does not permit joining relations, and is incompatible with other spreadsheet systems
2.  The spreadsheet paradigm of computation still lacks sufficient analysis.

PROPOSED SYSTEM

One of them is an efficient sorting algorithm, implemented by spreadsheet formulas, improving on the quadratic sorting of [8]. The present algorithm is O(n log2 n), but requires 4 log n columns to sort n items. The other two algorithms go beyond standard SQL. We present a recursive implementation of Breadth-First-Search for directed acyclic graphs, and an iterative implementation of Depth-First-Search for arbitrary graphs. This sheds additional light on the real computational capabilities of spreadsheets, and their ability to express recursive queries.

ADVANTAGES

1. To  develop optimizations for SQL queries translated into spreadsheets
2.  Implemented  a few specific algorithms: a linearithmic sorting procedure and two graph traversing algorithms: BFS and DFS

SYSTEM CONFIGURATION:-

HARDWARE REQUIREMENTS:-

·       Processor  -   Pentium –III

·      Speed            -    1.1 Ghz

·      RAM             -    256 MB(min)

·      Hard Disk              -   20 GB

·      Floppy Drive         -    1.44 MB

·      Key Board             -    Standard Windows Keyboard

·      Mouse           -    Two or Three Button Mouse

·      Monitor                 -    SVGA

SOFTWARE REQUIREMENTS:-

·      Operating System          : Windows  7                                  

·      Front End                      : JSP AND SERVLET

·      Database                       : MYSQL

REFERENCE:

Panasiuk, A. ; Stencel, K. ; Tyszkiewicz, J. “Translating Relational Queries Into Spreadsheets”, IEEE Transactions on Knowledge and Data Engineering,  Volume 27   Issue 8, FEBRUARY  2015.