B+TREE ON-DISK RECORDING METHOD AND PROGRAM
PROBLEM TO BE SOLVED: To effectively utilize a space in a single disk block when data amount of a single inner node is smaller with respect to the space in a single disk block.SOLUTION: The recording method creates a B+tree index from an integer sequence which is input through an integer sequence in...
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 | YAMAMURO MASASHI HIDAKA HARUSHIO YAMAMURO KEN |
| description | PROBLEM TO BE SOLVED: To effectively utilize a space in a single disk block when data amount of a single inner node is smaller with respect to the space in a single disk block.SOLUTION: The recording method creates a B+tree index from an integer sequence which is input through an integer sequence input device, and allots plural internal nodes to a single disk block to write the same in a storing unit of the B+tree index. The B+tree index is divided according to the height of the internal node of the B+tree index and each of the internal nodes belonging to an identical height i is decomposed into plural sets of j. A piece of information necessary for processing database and a piece of offset information for plural mini disk blocks are stored at the head of the disk block as a header. A piece of information necessary for search is written in the header of a k-th mini disk block in the disk block. The information of a set of the k-th internal nodes is stored in the k-th mini disk block. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_JP2013149097A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>JP2013149097A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_JP2013149097A3</originalsourceid><addsrcrecordid>eNrjZNB20g4JcnVV8PfTdfEM9lYIcnX2D3Lx9HNX8HUN8fB3UXD0c1EICPJ3D3L05WFgTUvMKU7lhdLcDEpuriHOHrqpBfnxqcUFicmpeakl8V4BRgaGxoYmlgaW5o7GRCkCAJONJQk</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>B+TREE ON-DISK RECORDING METHOD AND PROGRAM</title><source>esp@cenet</source><creator>YAMAMURO MASASHI ; HIDAKA HARUSHIO ; YAMAMURO KEN</creator><creatorcontrib>YAMAMURO MASASHI ; HIDAKA HARUSHIO ; YAMAMURO KEN</creatorcontrib><description>PROBLEM TO BE SOLVED: To effectively utilize a space in a single disk block when data amount of a single inner node is smaller with respect to the space in a single disk block.SOLUTION: The recording method creates a B+tree index from an integer sequence which is input through an integer sequence input device, and allots plural internal nodes to a single disk block to write the same in a storing unit of the B+tree index. The B+tree index is divided according to the height of the internal node of the B+tree index and each of the internal nodes belonging to an identical height i is decomposed into plural sets of j. A piece of information necessary for processing database and a piece of offset information for plural mini disk blocks are stored at the head of the disk block as a header. A piece of information necessary for search is written in the header of a k-th mini disk block in the disk block. The information of a set of the k-th internal nodes is stored in the k-th mini disk block.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2013</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=20130801&DB=EPODOC&CC=JP&NR=2013149097A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76290</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20130801&DB=EPODOC&CC=JP&NR=2013149097A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>YAMAMURO MASASHI</creatorcontrib><creatorcontrib>HIDAKA HARUSHIO</creatorcontrib><creatorcontrib>YAMAMURO KEN</creatorcontrib><title>B+TREE ON-DISK RECORDING METHOD AND PROGRAM</title><description>PROBLEM TO BE SOLVED: To effectively utilize a space in a single disk block when data amount of a single inner node is smaller with respect to the space in a single disk block.SOLUTION: The recording method creates a B+tree index from an integer sequence which is input through an integer sequence input device, and allots plural internal nodes to a single disk block to write the same in a storing unit of the B+tree index. The B+tree index is divided according to the height of the internal node of the B+tree index and each of the internal nodes belonging to an identical height i is decomposed into plural sets of j. A piece of information necessary for processing database and a piece of offset information for plural mini disk blocks are stored at the head of the disk block as a header. A piece of information necessary for search is written in the header of a k-th mini disk block in the disk block. The information of a set of the k-th internal nodes is stored in the k-th mini disk block.</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>2013</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZNB20g4JcnVV8PfTdfEM9lYIcnX2D3Lx9HNX8HUN8fB3UXD0c1EICPJ3D3L05WFgTUvMKU7lhdLcDEpuriHOHrqpBfnxqcUFicmpeakl8V4BRgaGxoYmlgaW5o7GRCkCAJONJQk</recordid><startdate>20130801</startdate><enddate>20130801</enddate><creator>YAMAMURO MASASHI</creator><creator>HIDAKA HARUSHIO</creator><creator>YAMAMURO KEN</creator><scope>EVB</scope></search><sort><creationdate>20130801</creationdate><title>B+TREE ON-DISK RECORDING METHOD AND PROGRAM</title><author>YAMAMURO MASASHI ; HIDAKA HARUSHIO ; YAMAMURO KEN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_JP2013149097A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2013</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>YAMAMURO MASASHI</creatorcontrib><creatorcontrib>HIDAKA HARUSHIO</creatorcontrib><creatorcontrib>YAMAMURO KEN</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>YAMAMURO MASASHI</au><au>HIDAKA HARUSHIO</au><au>YAMAMURO KEN</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>B+TREE ON-DISK RECORDING METHOD AND PROGRAM</title><date>2013-08-01</date><risdate>2013</risdate><abstract>PROBLEM TO BE SOLVED: To effectively utilize a space in a single disk block when data amount of a single inner node is smaller with respect to the space in a single disk block.SOLUTION: The recording method creates a B+tree index from an integer sequence which is input through an integer sequence input device, and allots plural internal nodes to a single disk block to write the same in a storing unit of the B+tree index. The B+tree index is divided according to the height of the internal node of the B+tree index and each of the internal nodes belonging to an identical height i is decomposed into plural sets of j. A piece of information necessary for processing database and a piece of offset information for plural mini disk blocks are stored at the head of the disk block as a header. A piece of information necessary for search is written in the header of a k-th mini disk block in the disk block. The information of a set of the k-th internal nodes is stored in the k-th mini disk block.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_JP2013149097A |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | B+TREE ON-DISK RECORDING METHOD AND PROGRAM |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T19%3A22%3A54IST&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=YAMAMURO%20MASASHI&rft.date=2013-08-01&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EJP2013149097A%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 |