The patent's assignee for patent number 8782075 is
News editors obtained the following quote from the background information supplied by the inventors: "The present invention relates to database management systems, and more particularly to database query handling.
"Commercial database systems accumulate data through OLTP (On Line Transaction Processing) operations. FIG. 1 illustrates a number of OLTP clients 110 each of which may be, for example, a cash register in a company store. Each sale of a particular product may generate a record such as:
"The ordinary normalization process leads to inefficiencies for analytical purposes, where it may become necessary to read data from a large number of tables in order to calculate aggregated or fully qualified results. Consequently, many companies create a third representational form of the data by reorganizing the contents of the DW into multiple data marts (DMs) using star schema structures to reduce the number of tables involved in join operations. While this approach has benefits that make it more efficient than attempting to report against the DW, inherent problems remain which limit the usefulness of the DM approach in the presence of divergent reporting requirements and increasing data volumes. Among these are that the rows in star schema dimensional and fact tables tend to be wide, and the number of rows in the fact tables tends to grow over time. Thus, the IO problem remains a constraint limiting the usability of star schema solutions.
"The use of multidimensional representations (OLAP cubes) addresses these limitations to some degree, by precalculating aggregated results of interest and storing them in atomic form. Immediate results may often be acquired from cubes, but introduce additional costs that mitigate their value. Since the data is stored in aggregated results form in the cube, secondary query operations are required to retrieve the detailed atomic data that underlies the cube elements. This may require that DMs still be retained, which therefore expands the number of data representations to four. Second, the cube is limited in the scope of analytics that can be retrieved to those which it calculates when it is constructed. This restricts business intelligence access to timely and changing answers to important business questions and often leads to a proliferation of cubes within an organization. Third, the maintenance cost to prepare and update the cubes introduces additional overhead within organizations, further increasing costs and latency concerns for timely reporting.
"Data searches can be accelerated using a columnar (column-oriented) data representation. See U.S. Pat. No. 7,024,414 issued
"Consider an example that demonstrates the cost savings when analyzing columnar vs row-wise data storage. According to the 2000 US census, there are approximate 300 million people in
"As described in the aforementioned U.S. Pat. No. 7,024,414, CDB data can be divided among different compute nodes, each with its own storage node. Each storage node stores its data in columnar form. Data may be replicated on adjacent storage nodes to provide security against storage or compute node failures. A query master divides query processing among compute nodes as needed. Efficient selection of compute nodes for each query execution is critical for short execution times."
As a supplement to the background information on this patent, VerticalNews correspondents also obtained the inventors' summary information for this patent: "This section summarizes some features of the invention. Other features are described in the subsequent sections. The invention is defined by the appended claims which are incorporated into this section by reference.
"In some embodiments of the present invention, the same data is stored in at least two different database management systems (DBMS's), including a columnar DBMS and a non-columnar (e.g. row-oriented) DBMS. The columnar DBMS may provide fast responses to queries involving aggregation, and such queries can be routed to the columnar DBMS. A query may be routed to the non-columnar DBMS if for example the query execution involves only small DBMS tables on the non-columnar DBMS. In some situations, an execution time estimate can be obtained from each DBMS, and the query is routed to the DBMS providing the shortest estimate.
"In some embodiments, the performance gains due to such query handling may eliminate the need for DMs and OLAP cubes as partial solutions to the organizational problems outlined here.
"The invention is not limited to the features and advantages described above. Other features are described below. The invention is defined by the appended claims."
For additional information on this patent, see: Zane, Barry M.;
Keywords for this news article include: Information Technology, Information and Data Management,
Our reports deliver fact-based news of research and discoveries from around the world. Copyright 2014, NewsRx LLC
Most Popular Stories
- Bently Creates Alabama Small Business Commission
- Bolivar Appointed to NSHMBA National Board
- When to Say No to Investors, Yes to Mentors
- SBA Kicks off Hispanic Heritage Month
- Rosneft Growth Slowed by Western Sanctions
- Duke Energy, Strata Partner on Big Solar Project
- Ukraine Offers Temporary Autonomy to Rebel-held Areas
- Thousands Risk Losing Health Care Aid
- Lindsay Lohan Claims She Handled Whitney Houston's Body Bag
- Cat Stevens Touring U.S., First Since 1970s