Method and system for tree management of trees under multi-version concurrency control

Method and system for tree management of trees under multi-version concurrency control

Method for tree management of trees under multi-version concurrency control is described herein. Method starts by detecting change in a size of a cluster. The number of nodes in the cluster is counted to obtain the changed size of the cluster. The number of trees needed for the number of nodes in th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Malygin, Mikhail, Danilov, Mikhail, Buinov, Konstantin, Kurilov, Andrey, Tchoub, Ivan
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
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 Malygin, Mikhail
Danilov, Mikhail
Buinov, Konstantin
Kurilov, Andrey
Tchoub, Ivan
description Method for tree management of trees under multi-version concurrency control is described herein. Method starts by detecting change in a size of a cluster. The number of nodes in the cluster is counted to obtain the changed size of the cluster. The number of trees needed for the number of nodes in the cluster is determined. The number of trees may be based on the number of nodes in the cluster and predetermined system balancing coefficient. When the number of trees needed is greater than existing number of trees, existing number of trees is doubled as a single-step operation which includes modifying and scaling hash function used to derive each tree to generate new hash function and using new hash function to partition each tree instantly into two new trees. Scaling happens on demand without service disruption. Hash function scales automatically when number of trees increases. Other embodiments are described.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US10614055B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US10614055B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US10614055B23</originalsourceid><addsrcrecordid>eNqNiksKwkAQBbNxIeod2gMEEjUeQFHcuPKzDcPkRQMz3aGnI-T2ongAV1UUNc3uZ9hTGnLcUBqTIVIrSqYARcfugQg2kvabEg3cQCkOwbr8BU2dMHlhP6iC_fhxUwnzbNK6kLD4cZYtj4fr_pSjlxqpdx4Mq2-XstiWm6Kqdqv1P88bR1U6Kg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method and system for tree management of trees under multi-version concurrency control</title><source>esp@cenet</source><creator>Malygin, Mikhail ; Danilov, Mikhail ; Buinov, Konstantin ; Kurilov, Andrey ; Tchoub, Ivan</creator><creatorcontrib>Malygin, Mikhail ; Danilov, Mikhail ; Buinov, Konstantin ; Kurilov, Andrey ; Tchoub, Ivan</creatorcontrib><description>Method for tree management of trees under multi-version concurrency control is described herein. Method starts by detecting change in a size of a cluster. The number of nodes in the cluster is counted to obtain the changed size of the cluster. The number of trees needed for the number of nodes in the cluster is determined. The number of trees may be based on the number of nodes in the cluster and predetermined system balancing coefficient. When the number of trees needed is greater than existing number of trees, existing number of trees is doubled as a single-step operation which includes modifying and scaling hash function used to derive each tree to generate new hash function and using new hash function to partition each tree instantly into two new trees. Scaling happens on demand without service disruption. Hash function scales automatically when number of trees increases. Other embodiments are described.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2020</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=20200407&amp;DB=EPODOC&amp;CC=US&amp;NR=10614055B2$$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=20200407&amp;DB=EPODOC&amp;CC=US&amp;NR=10614055B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Malygin, Mikhail</creatorcontrib><creatorcontrib>Danilov, Mikhail</creatorcontrib><creatorcontrib>Buinov, Konstantin</creatorcontrib><creatorcontrib>Kurilov, Andrey</creatorcontrib><creatorcontrib>Tchoub, Ivan</creatorcontrib><title>Method and system for tree management of trees under multi-version concurrency control</title><description>Method for tree management of trees under multi-version concurrency control is described herein. Method starts by detecting change in a size of a cluster. The number of nodes in the cluster is counted to obtain the changed size of the cluster. The number of trees needed for the number of nodes in the cluster is determined. The number of trees may be based on the number of nodes in the cluster and predetermined system balancing coefficient. When the number of trees needed is greater than existing number of trees, existing number of trees is doubled as a single-step operation which includes modifying and scaling hash function used to derive each tree to generate new hash function and using new hash function to partition each tree instantly into two new trees. Scaling happens on demand without service disruption. Hash function scales automatically when number of trees increases. Other embodiments are described.</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>2020</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNiksKwkAQBbNxIeod2gMEEjUeQFHcuPKzDcPkRQMz3aGnI-T2ongAV1UUNc3uZ9hTGnLcUBqTIVIrSqYARcfugQg2kvabEg3cQCkOwbr8BU2dMHlhP6iC_fhxUwnzbNK6kLD4cZYtj4fr_pSjlxqpdx4Mq2-XstiWm6Kqdqv1P88bR1U6Kg</recordid><startdate>20200407</startdate><enddate>20200407</enddate><creator>Malygin, Mikhail</creator><creator>Danilov, Mikhail</creator><creator>Buinov, Konstantin</creator><creator>Kurilov, Andrey</creator><creator>Tchoub, Ivan</creator><scope>EVB</scope></search><sort><creationdate>20200407</creationdate><title>Method and system for tree management of trees under multi-version concurrency control</title><author>Malygin, Mikhail ; Danilov, Mikhail ; Buinov, Konstantin ; Kurilov, Andrey ; Tchoub, Ivan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US10614055B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2020</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Malygin, Mikhail</creatorcontrib><creatorcontrib>Danilov, Mikhail</creatorcontrib><creatorcontrib>Buinov, Konstantin</creatorcontrib><creatorcontrib>Kurilov, Andrey</creatorcontrib><creatorcontrib>Tchoub, Ivan</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Malygin, Mikhail</au><au>Danilov, Mikhail</au><au>Buinov, Konstantin</au><au>Kurilov, Andrey</au><au>Tchoub, Ivan</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method and system for tree management of trees under multi-version concurrency control</title><date>2020-04-07</date><risdate>2020</risdate><abstract>Method for tree management of trees under multi-version concurrency control is described herein. Method starts by detecting change in a size of a cluster. The number of nodes in the cluster is counted to obtain the changed size of the cluster. The number of trees needed for the number of nodes in the cluster is determined. The number of trees may be based on the number of nodes in the cluster and predetermined system balancing coefficient. When the number of trees needed is greater than existing number of trees, existing number of trees is doubled as a single-step operation which includes modifying and scaling hash function used to derive each tree to generate new hash function and using new hash function to partition each tree instantly into two new trees. Scaling happens on demand without service disruption. Hash function scales automatically when number of trees increases. Other embodiments are described.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US10614055B2
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Method and system for tree management of trees under multi-version concurrency control
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T09%3A50%3A51IST&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=Malygin,%20Mikhail&rft.date=2020-04-07&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS10614055B2%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