Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Rewriting a query in terms of a summary based on one-to-one and one-to-many losslessness of joins

Rewriting a query in terms of a summary based on one-to-one and one-to-many losslessness of joins

US Patent 6477525 · Granted Nov 5, 2002

Estimated economic value: $690,521,000 ⓘ

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Out-of-core BFS for shortest path graph queries2025
Extending database data with intended usage information2025
Efficient compilation of bounded recursive graph queries on top of SQL based rel2025
Outer semi join for disjunctive subquery unnesting2025
Automatic partitioning of materialized views2024
Automatic partitioning of materialized views2024
Using temporary tables to store graph algorithm results for a relational databas2024
Method and system to implement error handling with fine-grained SQL hints2024
Shard management for scaling database tables2024
Efficient compilation of graph queries including complex expressions on top of s2024
Machine learning inference calls for database query processing2024
Intelligent query routing across shards of scalable database tables2024