18541949. FINGERPRINTS FOR DATABASE QUERIES simplified abstract (HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP)

From WikiPatents
Jump to navigation Jump to search

FINGERPRINTS FOR DATABASE QUERIES

Organization Name

HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor(s)

Shine Mathew of Bangalore (IN)

Ashish Dange of Bangalore (IN)

Harsh Singh of Bangalore (IN)

Lakshmi Pathy S. N. of Bangalore (IN)

FINGERPRINTS FOR DATABASE QUERIES - A simplified explanation of the abstract

This abstract first appeared for US patent application 18541949 titled 'FINGERPRINTS FOR DATABASE QUERIES

Simplified Explanation

The abstract of the patent application describes a system that identifies sub-portions of a database query, assigns identifiers to these sub-portions, and generates a fingerprint representing the query based on these identifiers.

  • The system identifies sub-portions of a database query.
  • It assigns identifiers to the identified sub-portions.
  • The identifiers are added to a data structure.
  • A fingerprint representing the database query is generated by applying a fingerprint function on the data structure including the identifiers.

Potential Applications

This technology could be applied in:

  • Database management systems
  • Data security systems
  • Query optimization tools

Problems Solved

This technology helps in:

  • Efficiently representing database queries
  • Enhancing data security by generating unique fingerprints
  • Improving query performance by optimizing query processing

Benefits

The benefits of this technology include:

  • Improved query processing speed
  • Enhanced data security
  • Simplified database query representation

Potential Commercial Applications

The potential commercial applications of this technology could be in:

  • Database software development
  • Data analytics companies
  • Cybersecurity firms

Possible Prior Art

One possible prior art for this technology could be:

  • Fingerprinting techniques used in data security systems

Unanswered Questions

How does the system handle complex database queries with multiple sub-portions?

The system's ability to handle complex queries with multiple sub-portions is not explicitly mentioned in the abstract. Further details on this aspect would be helpful.

What is the scalability of the system in handling a large volume of database queries?

The scalability of the system in processing a large number of database queries simultaneously is not discussed in the abstract. Understanding the system's scalability would be crucial for real-world applications.


Original Abstract Submitted

In some examples, a system identifies sub-portions of a database query, assigns identifiers to the identified sub-portions, and adds the identifiers to a data structure. The system generates a fingerprint representing the database query based on applying a fingerprint function on the data structure including the identifiers.