TECHNIQUES TO BALANCE LOG STRUCTURED MERGE TREES
Methods, systems, and devices for techniques to balance log structured merge trees are described. A computing system may rebalance a tree structure having an ordered set of leaf nodes by splitting or joining leaf nodes of the tree structure. To split a leaf node, the computing system may select a ke...
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| 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 | Meeramohideen Mohamed, Nabeel Ramdasi, Gaurav Sanjay Becker, Greg Alan Tomlinson, Alexander Partin, Tristan Antonio Moyer, Steven Andrew |
| description | Methods, systems, and devices for techniques to balance log structured merge trees are described. A computing system may rebalance a tree structure having an ordered set of leaf nodes by splitting or joining leaf nodes of the tree structure. To split a leaf node, the computing system may select a key to evenly partition key and value data stored in the leaf. The computing system may place each key block of the leaf node having keys less than or equal to the selected key in a first new leaf node, and may place each key block of the leaf node having keys greater than the selected key in a second new leaf node. To join leaf nodes of the tree structure, the computing system may place each key block and each value block of the leaf node and the adjacent leaf node in a new leaf node. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2024056387A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2024056387A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2024056387A13</originalsourceid><addsrcrecordid>eNrjZDAIcXX28PMMDHUNVgjxV3By9HH0c3ZV8PF3VwgOCQp1DgkNcnVR8HUNcndVCAlydQ3mYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXxocFGBkYmBqZmxhbmjobGxKkCAMfNJ0E</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>TECHNIQUES TO BALANCE LOG STRUCTURED MERGE TREES</title><source>esp@cenet</source><creator>Meeramohideen Mohamed, Nabeel ; Ramdasi, Gaurav Sanjay ; Becker, Greg Alan ; Tomlinson, Alexander ; Partin, Tristan Antonio ; Moyer, Steven Andrew</creator><creatorcontrib>Meeramohideen Mohamed, Nabeel ; Ramdasi, Gaurav Sanjay ; Becker, Greg Alan ; Tomlinson, Alexander ; Partin, Tristan Antonio ; Moyer, Steven Andrew</creatorcontrib><description>Methods, systems, and devices for techniques to balance log structured merge trees are described. A computing system may rebalance a tree structure having an ordered set of leaf nodes by splitting or joining leaf nodes of the tree structure. To split a leaf node, the computing system may select a key to evenly partition key and value data stored in the leaf. The computing system may place each key block of the leaf node having keys less than or equal to the selected key in a first new leaf node, and may place each key block of the leaf node having keys greater than the selected key in a second new leaf node. To join leaf nodes of the tree structure, the computing system may place each key block and each value block of the leaf node and the adjacent leaf node in a new leaf node.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRIC DIGITAL DATA PROCESSING ; ELECTRICITY ; PHYSICS ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2024</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&date=20240215&DB=EPODOC&CC=US&NR=2024056387A1$$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&date=20240215&DB=EPODOC&CC=US&NR=2024056387A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Meeramohideen Mohamed, Nabeel</creatorcontrib><creatorcontrib>Ramdasi, Gaurav Sanjay</creatorcontrib><creatorcontrib>Becker, Greg Alan</creatorcontrib><creatorcontrib>Tomlinson, Alexander</creatorcontrib><creatorcontrib>Partin, Tristan Antonio</creatorcontrib><creatorcontrib>Moyer, Steven Andrew</creatorcontrib><title>TECHNIQUES TO BALANCE LOG STRUCTURED MERGE TREES</title><description>Methods, systems, and devices for techniques to balance log structured merge trees are described. A computing system may rebalance a tree structure having an ordered set of leaf nodes by splitting or joining leaf nodes of the tree structure. To split a leaf node, the computing system may select a key to evenly partition key and value data stored in the leaf. The computing system may place each key block of the leaf node having keys less than or equal to the selected key in a first new leaf node, and may place each key block of the leaf node having keys greater than the selected key in a second new leaf node. To join leaf nodes of the tree structure, the computing system may place each key block and each value block of the leaf node and the adjacent leaf node in a new leaf node.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>ELECTRICITY</subject><subject>PHYSICS</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2024</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDAIcXX28PMMDHUNVgjxV3By9HH0c3ZV8PF3VwgOCQp1DgkNcnVR8HUNcndVCAlydQ3mYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXxocFGBkYmBqZmxhbmjobGxKkCAMfNJ0E</recordid><startdate>20240215</startdate><enddate>20240215</enddate><creator>Meeramohideen Mohamed, Nabeel</creator><creator>Ramdasi, Gaurav Sanjay</creator><creator>Becker, Greg Alan</creator><creator>Tomlinson, Alexander</creator><creator>Partin, Tristan Antonio</creator><creator>Moyer, Steven Andrew</creator><scope>EVB</scope></search><sort><creationdate>20240215</creationdate><title>TECHNIQUES TO BALANCE LOG STRUCTURED MERGE TREES</title><author>Meeramohideen Mohamed, Nabeel ; Ramdasi, Gaurav Sanjay ; Becker, Greg Alan ; Tomlinson, Alexander ; Partin, Tristan Antonio ; Moyer, Steven Andrew</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2024056387A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2024</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>ELECTRICITY</topic><topic>PHYSICS</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>Meeramohideen Mohamed, Nabeel</creatorcontrib><creatorcontrib>Ramdasi, Gaurav Sanjay</creatorcontrib><creatorcontrib>Becker, Greg Alan</creatorcontrib><creatorcontrib>Tomlinson, Alexander</creatorcontrib><creatorcontrib>Partin, Tristan Antonio</creatorcontrib><creatorcontrib>Moyer, Steven Andrew</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Meeramohideen Mohamed, Nabeel</au><au>Ramdasi, Gaurav Sanjay</au><au>Becker, Greg Alan</au><au>Tomlinson, Alexander</au><au>Partin, Tristan Antonio</au><au>Moyer, Steven Andrew</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>TECHNIQUES TO BALANCE LOG STRUCTURED MERGE TREES</title><date>2024-02-15</date><risdate>2024</risdate><abstract>Methods, systems, and devices for techniques to balance log structured merge trees are described. A computing system may rebalance a tree structure having an ordered set of leaf nodes by splitting or joining leaf nodes of the tree structure. To split a leaf node, the computing system may select a key to evenly partition key and value data stored in the leaf. The computing system may place each key block of the leaf node having keys less than or equal to the selected key in a first new leaf node, and may place each key block of the leaf node having keys greater than the selected key in a second new leaf node. To join leaf nodes of the tree structure, the computing system may place each key block and each value block of the leaf node and the adjacent leaf node in a new leaf node.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2024056387A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC COMMUNICATION TECHNIQUE ELECTRIC DIGITAL DATA PROCESSING ELECTRICITY PHYSICS TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
| title | TECHNIQUES TO BALANCE LOG STRUCTURED MERGE TREES |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T13%3A19%3A23IST&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=Meeramohideen%20Mohamed,%20Nabeel&rft.date=2024-02-15&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2024056387A1%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 |