SELECTING SUBSCRIBING COMPUTING NODE TO EXECUTE DATA STORAGE PLAN FOR DATA SHARD

A distributed database system maintains a database including a data shard for which a primary computing node is responsible. The primary computing node identifies a data storage plan for the data shard. The plan identifies a file subset of data storage files of the shard to be merged into a larger d...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Deng, Ning, Bei, Yuanzhe, Kalinin, Alexander
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Deng, Ning
Bei, Yuanzhe
Kalinin, Alexander
description A distributed database system maintains a database including a data shard for which a primary computing node is responsible. The primary computing node identifies a data storage plan for the data shard. The plan identifies a file subset of data storage files of the shard to be merged into a larger data storage file, and a node subset of computing nodes of the system that subscribe to the data shard. The primary node identifies which computing nodes of the node subset each have sufficient computing resources to execute the plan, as candidate computing nodes. The primary node identifies which files of the file subset each candidate computing node locally caches. The primary node selects one candidate computing node to execute the plan, based on the files of the file subset that each candidate computing node locally caches. The primary node causes the selected candidate computing node to execute the plan.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2023229629A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2023229629A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2023229629A13</originalsourceid><addsrcrecordid>eNrjZAgIdvVxdQ7x9HNXCA51CnYO8nQCsZ39fQNCwaJ-_i6uCiH-Cq4Rrs6hIa4KLo4hjgrBIf5Bju6uCgE-jn4Kbv5BUFEPxyAXHgbWtMSc4lReKM3NoOzmGuLsoZtakB-fWlyQmJyal1oSHxpsZGBkbGRkaWZk6WhoTJwqACLaL80</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>SELECTING SUBSCRIBING COMPUTING NODE TO EXECUTE DATA STORAGE PLAN FOR DATA SHARD</title><source>esp@cenet</source><creator>Deng, Ning ; Bei, Yuanzhe ; Kalinin, Alexander</creator><creatorcontrib>Deng, Ning ; Bei, Yuanzhe ; Kalinin, Alexander</creatorcontrib><description>A distributed database system maintains a database including a data shard for which a primary computing node is responsible. The primary computing node identifies a data storage plan for the data shard. The plan identifies a file subset of data storage files of the shard to be merged into a larger data storage file, and a node subset of computing nodes of the system that subscribe to the data shard. The primary node identifies which computing nodes of the node subset each have sufficient computing resources to execute the plan, as candidate computing nodes. The primary node identifies which files of the file subset each candidate computing node locally caches. The primary node selects one candidate computing node to execute the plan, based on the files of the file subset that each candidate computing node locally caches. The primary node causes the selected candidate computing node to execute the plan.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2023</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20230720&amp;DB=EPODOC&amp;CC=US&amp;NR=2023229629A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20230720&amp;DB=EPODOC&amp;CC=US&amp;NR=2023229629A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Deng, Ning</creatorcontrib><creatorcontrib>Bei, Yuanzhe</creatorcontrib><creatorcontrib>Kalinin, Alexander</creatorcontrib><title>SELECTING SUBSCRIBING COMPUTING NODE TO EXECUTE DATA STORAGE PLAN FOR DATA SHARD</title><description>A distributed database system maintains a database including a data shard for which a primary computing node is responsible. The primary computing node identifies a data storage plan for the data shard. The plan identifies a file subset of data storage files of the shard to be merged into a larger data storage file, and a node subset of computing nodes of the system that subscribe to the data shard. The primary node identifies which computing nodes of the node subset each have sufficient computing resources to execute the plan, as candidate computing nodes. The primary node identifies which files of the file subset each candidate computing node locally caches. The primary node selects one candidate computing node to execute the plan, based on the files of the file subset that each candidate computing node locally caches. The primary node causes the selected candidate computing node to execute the plan.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZAgIdvVxdQ7x9HNXCA51CnYO8nQCsZ39fQNCwaJ-_i6uCiH-Cq4Rrs6hIa4KLo4hjgrBIf5Bju6uCgE-jn4Kbv5BUFEPxyAXHgbWtMSc4lReKM3NoOzmGuLsoZtakB-fWlyQmJyal1oSHxpsZGBkbGRkaWZk6WhoTJwqACLaL80</recordid><startdate>20230720</startdate><enddate>20230720</enddate><creator>Deng, Ning</creator><creator>Bei, Yuanzhe</creator><creator>Kalinin, Alexander</creator><scope>EVB</scope></search><sort><creationdate>20230720</creationdate><title>SELECTING SUBSCRIBING COMPUTING NODE TO EXECUTE DATA STORAGE PLAN FOR DATA SHARD</title><author>Deng, Ning ; Bei, Yuanzhe ; Kalinin, Alexander</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2023229629A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2023</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Deng, Ning</creatorcontrib><creatorcontrib>Bei, Yuanzhe</creatorcontrib><creatorcontrib>Kalinin, Alexander</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Deng, Ning</au><au>Bei, Yuanzhe</au><au>Kalinin, Alexander</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>SELECTING SUBSCRIBING COMPUTING NODE TO EXECUTE DATA STORAGE PLAN FOR DATA SHARD</title><date>2023-07-20</date><risdate>2023</risdate><abstract>A distributed database system maintains a database including a data shard for which a primary computing node is responsible. The primary computing node identifies a data storage plan for the data shard. The plan identifies a file subset of data storage files of the shard to be merged into a larger data storage file, and a node subset of computing nodes of the system that subscribe to the data shard. The primary node identifies which computing nodes of the node subset each have sufficient computing resources to execute the plan, as candidate computing nodes. The primary node identifies which files of the file subset each candidate computing node locally caches. The primary node selects one candidate computing node to execute the plan, based on the files of the file subset that each candidate computing node locally caches. The primary node causes the selected candidate computing node to execute the plan.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2023229629A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title SELECTING SUBSCRIBING COMPUTING NODE TO EXECUTE DATA STORAGE PLAN FOR DATA SHARD
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T14%3A47%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Deng,%20Ning&rft.date=2023-07-20&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2023229629A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true