Database Query Template Storage Using Parsable Data Structures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional database query criteria templates are inefficiently stored in multiple tables, leading to storage space issues and complex management, especially when a large number of templates are created, as they require joining multiple records which can be tedious and inefficient for users conducting similar searches.
Innovation Solution
A system that stores query criteria templates in a single template table with each record containing search-field names and values in a parsable format, such as XML, CLOB, or BLOB, allowing users to select and reuse templates, reducing manual input and simplifying management by eliminating the need for separate records and tables.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If query criteria templates are stored in multiple tables (master-child structure), then the templates can be organized with header information and search field details separated, but the storage space increases and management complexity increases due to requiring joins between multiple records
Solution Approach 1:
The patent merges the master table and child table into a single template table where each record contains both header information and search field details. This is achieved by storing search field names and values in a parsable format (XML, JSON, or delimited text) within a single column of the template table, eliminating the need for separate child records and join operations.
Solution Approach 2:
Within the single template table record, the search criteria are segmented into a parsable format structure that separates search field names from their values. This allows the system to maintain organized, structured data while keeping everything in one record, enabling easy parsing and reconstruction of query criteria without requiring multiple table joins.
2Adaptability or versatility
If query criteria templates are stored in multiple tables, then the templates can be created with detailed search fields, but the number of records increases occupying more storage space
Solution Approach 1:
Multiple child records that would otherwise be stored separately are merged into a single record by encoding the search field name-value pairs in a compact parsable format. This reduces the total number of records in the database while preserving all search capability information.
Solution Approach 2:
The patent changes the data format parameter from normalized relational structure (multiple records) to a condensed structured format (single record with embedded structure). By storing search criteria as XML, JSON, or delimited text within a single column, the system maintains full adaptability while significantly reducing storage requirements.
3Manufacturing precision
If users manually enter search-field values for each query, then the queries can be customized precisely, but the process becomes tedious and inefficient especially for regular searches
Solution Approach 1:
The system performs preliminary action by pre-configuring query criteria templates with complete search field names and values. Users can save frequently used query configurations as templates, which are then stored in the template table. When executing a query, users can select from these pre-configured templates rather than manually entering all search criteria, thus maintaining precision while improving efficiency.
Solution Approach 2:
The patent implements copying by allowing users to select and reuse stored template records for new queries. The template data is retrieved from the template table and applied to populate the query interface, enabling users to copy proven search configurations and modify them as needed, rather than recreating them from scratch each time.
4Adaptability or versatility
If a large number of templates are created, then users have more query options, but the burden of managing the master table and child tables increases due to required joins
Solution Approach 1:
The patent merges the management of header information and search field details into a single template table, eliminating the need for complex join operations when managing or retrieving templates. Each template is a self-contained record that can be independently created, modified, deleted, or retrieved, significantly reducing management overhead even as the number of templates grows.
Solution Approach 2:
Each template record in the template table is self-contained with all necessary information (header fields and search criteria) embedded in parsable format. This self-service structure allows templates to be managed independently without requiring system-wide join operations, enabling efficient creation, retrieval, and maintenance of large numbers of templates.
Data Source
AI summary
One embodiment of the present invention provides a system that facilitates user queries to a database. During operation, the system stores one or more query criteria templates in a template table in the database. Each record in the template table corresponds to a query criteria template. A query criteria template contains information on search-field names and search-field values for a query. The system also allows a user to select a template from the stored templates prior to performing a query, thereby reducing the number of search-field values the user has to manually enter. In this way, a number of query criteria templates can be stored in a single table with a column containing parsable query criteria.