Relational Database Pattern Matching for Ordered Data Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Database analysts face inefficiencies in analyzing ordered data due to limitations in existing database query languages, leading to excessive queries, increased processing time, and potential human errors when trying to extract information from relational databases.
Innovation Solution
A method and system for analyzing ordered data using pattern matching in a relational database, allowing for pattern specification and matching in a single pass with constant space, and automatic distribution of execution across a parallel computing environment for efficient data processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a limited query language is used in existing database systems, then the database structure remains simple and manageable, but the analyst's ability to effectively obtain information from the database is limited
Solution Approach 1:
The patent segments the query processing into two distinct parts: a pattern specification language for defining complex patterns on ordered data, and a standard SQL-like query language for retrieving results. This segmentation allows the system to handle complex pattern matching requirements without overwhelming the user with a single complex query language, thereby improving query capability while managing language complexity.
Solution Approach 2:
The patent introduces an intermediary pattern specification layer between the user's information needs and the database's data structure. This intermediary allows analysts to express complex requirements on ordered data sequences without directly manipulating the underlying database complexity, effectively bridging the gap between simple database structures and complex analytical needs.
2Productivity
If multiple queries are used to analyze ordered data, then the database structure remains simple, but the processing time and analyst effort increase excessively
Solution Approach 1:
The patent merges multiple separate query operations into a single pattern matching operation. By allowing pattern specifications that can match complex sequences and relationships in ordered data, the system combines what would otherwise require multiple queries into one unified operation, significantly improving data analysis efficiency while reducing query execution time.
Solution Approach 2:
The patent performs preliminary action by pre-compiling pattern specifications into optimized execution plans. This allows the system to prepare the pattern matching logic in advance, so that when queries are executed against ordered data, they can be processed efficiently without the overhead of multiple separate query compilations and executions.
3Measurement precision
If data is transferred to a separate process for analysis, then the database remains simple and centralized, but additional processing time and error potential are introduced
Solution Approach 1:
The patent makes the database system itself multi-functional by enabling it to perform both data storage and complex pattern matching analysis within the same environment. This eliminates the need to transfer data to separate analysis processes, as the database can directly execute pattern specifications and return analyzed results, thereby improving analysis accuracy while reducing data transfer time and potential errors.
4Productivity
If a single pass pattern matching algorithm is used, then processing time is reduced, but the space complexity increases due to constant space requirements
Solution Approach 1:
The patent applies parameter changes by transforming the pattern matching problem into a form that can be solved in a single pass with constant space. This involves changing the parameters of the matching algorithm to use fixed-size buffers and state machines that process data streams efficiently, allowing high processing speed while managing memory complexity through careful parameter selection and algorithm design.
Data Source
AI summary
Several methods and a system for analyzing ordered data using pattern matching over an indefinitely long ordered sequence of rows in a relational database are disclosed. In one embodiment, a method of a server includes receiving an ordered data in a relational database. The method further includes matching a pattern specified in a query on ordered data in a relational database in a single pass in constant space for overlapping mode of results. The method also includes creating an output data in the single pass in constant space for overlapping mode of results based on the matching of the ordered data with the pattern in the relational database query.