Oriented Query Paths for Database Join Ambiguity

The patent applies asymmetry by transitioning from undirected graphs to directed graphs where joins have explicit orientations. Each join is represented as a directed edge from the parent table to the child table, allowing the system to distinguish between different semantic meanings of queries. This directional approach eliminates ambiguity in query semantics while maintaining manageable system complexity through standardized directed graph processing.

The system performs self-service by automatically determining the correct query path based on the orientation of joins. Instead of requiring user intervention to resolve ambiguities, the directed graph structure inherently provides semantic information that guides the query path selection. The system autonomously interprets query intentions by following directed edges from parent to child tables, eliminating the need for user input to resolve path ambiguities.

The patent replaces complex mechanical systems (sophisticated context and alias generation mechanisms) with a simpler conceptual framework based on directed graphs. Instead of using complex algorithms to generate and manage contexts and aliases, the system uses the inherent orientation information in directed edges to automatically determine query semantics. This substitution simplifies the system architecture and reduces maintenance requirements while maintaining high reliability in query result accuracy.

The patent applies local quality by assigning directional properties to individual edges (joins) in the graph. Each directed edge carries local information about the join cardinality and orientation, allowing the system to distinguish between different types of joins (one-to-one, one-to-many, many-to-one, many-to-many) based on the direction and properties of individual edges. This localized approach to quality differentiation enables precise join cardinality detection without requiring complex global graph analysis.