Other Databases Indexing TRIZ Cases
- Data Governance Graph for Visualizing Dataset Interconnections
A governance graph maps direct and indirect dataset links to improve data management, security, and compliance through clearer interconnection visibility.
- Node-Port Betweenness Centrality for Wafer Transport Bottlenecks
Port-aware betweenness centrality improves wafer transport congestion analysis by capturing node-port paths with lower time and space complexity.
- Topological Graph Generation for Interpretable Relationship Discovery
Entropy-scored metric-lens selection improves topological graph analysis of multidimensional data and makes key relationships easier to interpret.
- Hashmap Key Indexing for Faster Computing Operation Retrieval
Pre-generated hash keys and indexed storage reduce delays in multi-step computing operations and speed data retrieval for large input sets.
- Distributed Aggregate Reduction by Fragment Splitting in MLlib
Splitting aggregates into fragments enables parallel reduction across workstations, improving MLlib scalability and processing performance.
- Bidirectional Query Graph Encoding for Missing Entity Reasoning
Masked path-query encoding with bidirectional transformers improves answers to complex knowledge graph queries with multiple missing entities.
- Contextual Cloud Risk Assessment Across Multi-Platform Security Graphs
A security graph applies uniform policies across cloud platforms to benchmark risk consistently, detect vulnerabilities quickly, and trigger mitigation.
- Iterative Graph Learning for Noisy or Missing GNN Topology
An iterative graph learning framework refines noisy or missing graph topology with GNN embeddings to improve downstream tasks and robustness.
- AS-Level Bottleneck Detection for Application-Aware Traffic Rerouting
QoE metrics and path tracing pinpoint bottleneck autonomous systems so application traffic can be rerouted before SLA failures.
- Unified Network Graph Modeling for Explicit and Implicit Entities
Maps explicit and imputed cloud network entities into one graph model, improving cross-layer analysis while reducing separate object handling costs.
- Radar Data Access Using Shuffle LUTs for Non-Contiguous FFT Input
A shuffle LUT and wraparound indexing fetch scattered Doppler data directly from memory, speeding FFT processing in MIMO radar.
- Stable Identifier Generation for Real-Time Data Unification
Generates stableIDs from selected record fields to unify changing customer data in near real time while reducing duplicates and key churn.
- Record Linkage Clustering Using Superblocks and K-Mers
Superblocking with k-mers and graph clustering cuts record linkage runtime while preserving accurate entity resolution across diverse, error-prone data.
- Knowledge Graph Retrieval for Context-Coherent LLM Responses
Knowledge graph clustering filters superficially similar documents so LLM chatbots return more coherent answers with fewer hallucinations.
- Knowledge Graph Change History Using RDF-Star Triples
RDF-star triples store granular changes in a second knowledge graph, enabling direct history queries, earlier-version restoration, and time-based access.
- Dynamic Graph Embeddings for Low-Latency Transaction Streams
A recurrent DGS architecture updates node states in real time to cut memory load while preserving long-term dependencies in transactional graphs.
- Local Knowledge Graph Linking for Consistent User Customization
Core and local graphs let users customize linked elements without modifying shared data, preserving consistency while reducing processing demands.
- Multi-Dimensional Search Space Refinement Through Representative Sampling
Representative sampling and statistical guarantees narrow enormous parameter spaces, reducing exhaustive search time and computing resources.
- Queryable Supergraph Subset Infrastructure for Federated Graph Queries
Federated subgraph services and a gateway coordinate filtered schema subsets, improving query efficiency while controlling entity access.