Analysis of Large Data Sets Using Distributed Polynomial Interpolation

• US 20120130659A1
• Filed: 11/22/2010
• Published: 05/24/2012
• Est. Priority Date: 11/22/2010
• Status: Abandoned Application

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Chaves, Leonardo Weiss F.
• Application Number:
  US12/952,011
• Publication Number:
  US 20120130659A1
• Time in Patent Office: Days
• US Class Current: 702/62
• CPC Class Codes: H03M 7/30 Compression speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N; Expansion; Suppression of unnecessary data, e.g. redundancy reduction

Abstract

Embodiments of the present invention relate to analysis of large data sets using distributed polynomial interpolation. Particular embodiments compile such data sets from a large number of nodes. According to certain embodiments, a node gathers data for a certain time interval, and then approximates the gathered data with a polynomial. The node then sends its data in the form of the polynomial and an identification (ID), to a repository such as a database. For each node the polynomial may be queried from the database, and then the integral for the required interval calculated therefrom. Embodiments of the present invention may be particularly suited to allow real-time analytics of data collected from a large number of electrical power smart meters.

Claims

1. A computer-implemented method comprising:

collecting information at a node;

approximating the collected information as a polynomial;

transmitting the polynomial and an identifier to a repository;

storing the polynomial and the identifier in a computer readable storage medium at the repository;

converting the polynomial into data; and

performing analytics on the data.

2. The method of claim 1 wherein the collected information is approximated as a polynomial utilizing a technique selected from calculation of a Lagrange polynomial, calculation of a Newton polynomial, or application of the Neville algorithm.

3. The method of claim 1 wherein the node comprises an electrical smart meter, and the information comprises electricity consumption or production.

4. The method of claim 1 wherein the information is collected at the node over a time period, and the polynomial is converted into the data by integration over the time period.

5. The method of claim 4 further comprising the repository transmitting the time period to the node.

6. The method of claim 1 further comprising:

the node collecting additional information;

the node determining whether the additional information continues to match the polynomial; and

if the additional information does not continue to match the polynomial, causing the node to transmit a second polynomial to the repository.

7. A non-transitory computer readable storage medium embodying a computer program for performing a method, said method comprising:

collecting information at a node;

approximating the collected information as a polynomial; and

transmitting the polynomial and an identifier to a repository.

8. The computer readable storage medium of claim 7 wherein the collected information is approximated as a polynomial utilizing a technique selected from calculation of a Lagrange polynomial, calculation of a Newton polynomial, or application of the Neville algorithm.

9. The computer readable storage medium of claim 7 wherein the node comprises an electrical smart meter, and the information comprises electricity consumption or production.

10. The computer readable storage medium of claim 7 wherein the information is collected at the node over a time period.

11. The computer readable storage medium of claim 10 wherein the time period is transmitted to the node from the repository.

12. The method of claim 7 further comprising:

the node collecting additional information;

the node determining whether the additional information continues to match the polynomial; and

if the additional information does not continue to match the polynomial, causing the node to transmit a second polynomial to the repository.

13. A computer system comprising:

one or more processors;

a software program, executable on said computer system, the software program configured to;

collect information at a node;

approximate the collected information as a polynomial;

transmit the polynomial and an identifier to a repository;

store the polynomial and the identifier in a computer readable storage medium at the repository;

convert the polynomial into data; and

perform analytics on the data.

14. The computer system of claim 13 wherein the collected information is approximated as a polynomial utilizing a technique selected from calculation of a Lagrange polynomial, calculation of a Newton polynomial, or application of the Neville algorithm.

15. The computer system of claim 13 wherein the node comprises an electrical smart meter, and the information comprises electricity consumption or production.

16. The computer system of claim 13 wherein the information is collected at the node over a time period, and the polynomial is converted into the data by integration over the time period.

17. The computer system of claim 16 wherein the repository is configured to transmit the time period to the node.

18. The computer system of claim 13 wherein:

the node collects additional information;

the node determines whether the additional information continues to match the polynomial; and

if the additional information does not continue to match the polynomial, the node is caused to transmit a second polynomial to the repository.