US Patent Application 17828879. DISTRIBUTED DATA QUERY UNDER DATA FLOW LIMITATIONS simplified abstract

From WikiPatents
Jump to navigation Jump to search

DISTRIBUTED DATA QUERY UNDER DATA FLOW LIMITATIONS

Organization Name

Microsoft Technology Licensing, LLC==Inventor(s)==

[[Category:Anders Tungeland Gjerdrum of Tromso (NO)]]

[[Category:Tor Kreutzer of Tromso (NO)]]

[[Category:Jan-Ove Karlberg of Tromso (NO)]]

DISTRIBUTED DATA QUERY UNDER DATA FLOW LIMITATIONS - A simplified explanation of the abstract

This abstract first appeared for US patent application 17828879 titled 'DISTRIBUTED DATA QUERY UNDER DATA FLOW LIMITATIONS

Simplified Explanation

The patent application describes example solutions for performing distributed data queries on a connected data set that is distributed across multiple regions under data flow limitations.

  • The solutions are applicable to property graphs or relational databases that are spread across different geographic regions.
  • In cases where a data entity in one region is subject to a data flow limitation, the actual data entity is stored in the first region, while the second region only stores a reference to it.
  • The query is executed in the first region, but a partial representation of the query's state is injected into the query for execution in the second region.
  • The query in the second region locates the reference to the data entity and returns the state of the query back to the first region.
  • The query results from all the regions are then combined to produce a final result.
  • The patent application also addresses scenarios where references are not permitted due to prohibitive limitations.


Original Abstract Submitted

Example solutions are disclosed for performing a distributed data query for a connected data set, such as a property graph or a relational database, distributed across a plurality of regions (e.g., different geographic regions) under data flow limitations. For a restrictive limitation, a first region stores a data entity that is subject to a data flow limitation, and a second region stores only a reference to the data entity (e.g., a pseudonymous reference). The query is executed in the first region, and at least a partial representation of the state is injected into the query for execution in the second region. The query locates the reference to the data entity in the second region, and the state of the query from the second region is returned. Query results from the plurality of regions are synthesized into a final result. Further solutions address prohibitive limitations when references are not permitted.

Retrieved from "http://wikipatents.org/index.php?title=US_Patent_Application_17828879._DISTRIBUTED_DATA_QUERY_UNDER_DATA_FLOW_LIMITATIONS_simplified_abstract&oldid=9415"