Database Value Exploration for Recursive Cross-Table Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current database exploration tools require users to navigate back and forth between user interface pages to explore additional values, are inefficient for handling multiple object identifications, and struggle with the readability of Globally Unique Identifiers (GUIDs) or Universally Unique Identifiers (UUIDs), leading to repetitive and wasteful navigation.
Innovation Solution
A database value exploration system that allows users to search each cell in all database tables for a value, highlights matched cells, supports a global value watch list, and enables recursive searches by allowing direct selection of values from search results, providing enhanced user interface features for efficient database exploration.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If users explore database tables one-by-one using current tools, then users can examine database content, but the process becomes repetitive and time-consuming requiring navigation back and forth between pages
Solution Approach 1:
The patent combines multiple database table explorations into a single unified view. The system displays multiple database tables simultaneously in a grid layout, allowing users to explore related tables without navigating between separate pages. This merging of exploration tasks eliminates repetitive navigation and significantly improves data exploration efficiency.
Solution Approach 2:
The patent transitions from sequential one-dimensional table exploration to a two-dimensional grid view where multiple tables are displayed simultaneously. Users can horizontally scroll through multiple tables while vertically exploring records, adding spatial dimensions to the exploration process and eliminating the need for back-and-forth navigation.
2Ease of operation
If users manually track multiple object identifications, then users can follow entity relationships, but the task becomes increasingly difficult as more identifications need to be handled simultaneously
Solution Approach 1:
The patent segments the entity relationship tracking task by providing unique visual indicators for different entity types and relationships. Each table and record is clearly demarcated with visual cues, allowing users to track multiple object identifications without confusion. The system breaks down the complex tracking task into manageable visual segments.
Solution Approach 2:
The patent uses color coding and visual highlighting to differentiate between various entity types and relationship levels. Different colors indicate different table types, relationship strengths, or exploration depths, making it easy for users to track multiple object identifications simultaneously without increasing cognitive load.
3Difficulty of detecting and measuring
If users search for specific values across database tables, then users can find relevant data, but current tools require users to know which tables to search and how to navigate results
Solution Approach 1:
The patent implements a universal search mechanism that automatically searches across all database tables simultaneously without requiring users to specify which tables to search. The system handles multiple table types and structures uniformly, providing a single search interface that works across the entire database schema, thereby simplifying the search operation.
Solution Approach 2:
The patent introduces an intermediary search processing layer that mediates between the user's search input and the underlying database tables. This intermediary automatically routes search queries to relevant tables, manages result aggregation, and presents unified results, eliminating the need for users to manually navigate to specific tables or understand complex search syntax.
Data Source
AI summary
A computer-implemented method may comprise receiving a first search value and generating a first set of search results based on a first search of database tables for the first search value. The first set of search results may identify each row of each database table that has a corresponding cell that includes the first search value. Each row of one of the database tables that is identified in the first set of search results may be displayed along with a corresponding cell value that is stored in each one of the cells of the row. A second search value defined by a user selection of one of the displayed cell values may be received, and, in response to receiving the second search value, a second set of search results may be generated based on a second search search of the database tables for the second search value.