Fan-out control in scalable distributed data stores

a distributed data store and fan-out control technology, applied in the field of scalable distributed data stores, can solve the problems of tail latency, network congestion, and/or cpu-bounding, and may be time- and/or resource-intensive for complex querying of social and/or online professional network data

Inactive Publication Date: 2017-09-14
MICROSOFT TECH LICENSING LLC
View PDF4 Cites 66 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, complex querying of social and / or online professional network data may be time- and / or resource-intensive.
Moreover, a subset of the individuals and / or organizations may have a significantly larger than average number of links to other individuals and / or organizations, resulting in the added consumption of computational resources and / or time during execution of the query if the individuals and / or organizations are included in the search space of the query.
In turn, an uneven distribution of graph database data and queries among multiple storage and / or query nodes may result in issues such as tail latency, network congestion, and / or CPU-bounding.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Fan-out control in scalable distributed data stores
  • Fan-out control in scalable distributed data stores
  • Fan-out control in scalable distributed data stores

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0022]The following description is presented to enable any person skilled in the art to make and use the embodiments, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present disclosure. Thus, the present invention is not limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.

[0023]The data structures and code described in this detailed description are typically stored on a computer-readable storage medium, which may be any device or medium that can store code and / or data for use by a computer system. The computer-readable storage medium includes, but is not limited to, volatile memory, non-volatile memory, magnetic and optical...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The disclosed embodiments provide a system for processing data. During operation, the system identifies a query type of a query of a graph database storing a graph, wherein the graph comprises nodes, edges between pairs of nodes, and predicates. Next, the system determines, based on the query type, a number of clusters on which the graph database is replicated for fanning out of the query. The system then selects a set of storage nodes in the determined number of clusters for processing of the query. Finally, the system generates a fan-out of the query to the selected storage nodes.

Description

RELATED APPLICATIONS[0001]This application claims the benefit of U.S. Provisional Application No. 62 / 307,025, Attorney Docket Number LI-P1890.LNK.PROV, entitled “Partitioning and Replicating Data in Scalable Distributed Data Stores,” by inventors SungJu Cho, Andrew J. Carter, Joshua D. Ehrlich and Jane Alam Jan, filed 11 Mar. 2016, which is incorporated herein by reference.[0002]The subject matter of this application is related to the subject matter in a co-pending non-provisional application by inventors SungJu Cho, Qingpeng Niu, Andrew Carter and Sanjay Sachdev, entitled “Partial Graph Incremental Update in a Social Network,” having Ser. No. 14 / 546,790, and filing date 18 Nov. 2014 (Attorney Docket No. P1384.LNK.US; 3080.C63US1).[0003]The subject matter of this application is also related to the subject matter in a co-pending non-provisional application by the same inventors as the instant application and filed on the same day as the instant application, entitled “Partitioning and...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(United States)
IPC IPC(8): G06F17/30H04L12/715
CPCH04L45/46G06F17/30958G06F9/505G06F16/278G06F16/2471G06F16/285G06F16/27G06F16/9024G06F16/9535G06F16/9538
Inventor CHO, SUNGJUCARTER, ANDREW J.EHRLICH, JOSHUA D.JAN, JANE ALAM
Owner MICROSOFT TECH LICENSING LLC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products