International business machines corporation (20240104075). HIERARCHICAL DATA SKIPPING USING DATA SKETCHES simplified abstract

From WikiPatents
Jump to navigation Jump to search

HIERARCHICAL DATA SKIPPING USING DATA SKETCHES

Organization Name

international business machines corporation

Inventor(s)

MUDHAKAR Srivatsa of White Plains NY (US)

RAGHU KIRAN Ganti of White Plains NY (US)

Joshua M. Rosenkranz of White Plains NY (US)

Linsong Chu of White Plains NY (US)

Tuan Minh Hoang Trong of Jackson Heights NY (US)

Utpal Mangla of Toronto (CA)

SATISHKUMAR Sadagopan of Leawood KS (US)

Mathews Thomas of Flower Mound TX (US)

HIERARCHICAL DATA SKIPPING USING DATA SKETCHES - A simplified explanation of the abstract

This abstract first appeared for US patent application 20240104075 titled 'HIERARCHICAL DATA SKIPPING USING DATA SKETCHES

Simplified Explanation

The patent application describes a computer-implemented method for data skipping in a hierarchically organized computing system. The method involves determining leaf node data sketches, aggregating them at intermediate nodes, and using the retained data sketches to search the data in response to queries.

  • Group of processor units determines leaf node data sketches for data in leaf nodes
  • Leaf node data sketches summarize attributes of data in the leaf nodes
  • Processor units aggregate leaf node data sketches at intermediate nodes to form aggregated data sketches
  • Retained data sketches are formed by retaining data sketches received from child nodes
  • Retained data sketches are used to search the data and perform data skipping within the computing system

Potential Applications

This technology could be applied in:

  • Big data analytics
  • Distributed computing systems
  • Network traffic analysis

Problems Solved

  • Efficient data searching in hierarchically organized systems
  • Reduction of computational overhead
  • Improved query response times

Benefits

  • Faster data retrieval
  • Reduced resource consumption
  • Scalability in large computing systems

Potential Commercial Applications

  • Cloud computing services
  • Data centers
  • Internet of Things (IoT) platforms

Possible Prior Art

One possible prior art could be the use of data sketches in distributed computing systems for query optimization and data summarization.

Unanswered Questions

How does this technology handle data consistency in distributed systems?

The patent application does not provide details on how data consistency is maintained across different nodes in the hierarchically organized computing system.

What are the potential security implications of using data sketches for data skipping?

The patent application does not address the security aspects of using data sketches for searching and skipping data in the computing system.


Original Abstract Submitted

a computer implemented method performs data skipping in a hierarchically organized computing system. a group of processor units determines leaf node data sketches for data in leaf nodes in the hierarchically organized computing system. the leaf node data sketches summarize attributes of data in the leaf nodes. the group of processor units aggregates the leaf node data sketches at intermediate nodes in the hierarchically organized computing system to form aggregated data sketches at the intermediate nodes and retains data sketches received at the intermediate nodes from a group of child nodes to form retained data sketches. the retained data sketches are one of leaf node data sketches and the aggregated data sketches. the group of processor units searches the data using the retained data sketches and the data skipping within the hierarchically organized computing system in response to queries made to the intermediate nodes in the hierarchically organized computing system.