OPTIMIZED RECORD PLACEMENT IN DEFRAGMENTING GRAPH DATABASE

OPTIMIZED RECORD PLACEMENT IN DEFRAGMENTING GRAPH DATABASE

Methods and systems are disclosed for optimizing record placement in defragmenting a graph database. Issues with fragmented data within a graph database are addressed on the record level by placing data that is frequently accessed together contiguously within memory. For example, a dynamic rule set...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: KREUTZER, Tor, KVALNES, Åge, KARLBERG, Jan-Ove, VALVÅG, Steffen, JOHANSEN, Amund
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 KREUTZER, Tor
KVALNES, Åge
KARLBERG, Jan-Ove
VALVÅG, Steffen
JOHANSEN, Amund
description Methods and systems are disclosed for optimizing record placement in defragmenting a graph database. Issues with fragmented data within a graph database are addressed on the record level by placing data that is frequently accessed together contiguously within memory. For example, a dynamic rule set may be developed based on dynamically analyzing access patterns of the graph database, policies, system characteristics and/or other heuristics. Based on statistics regarding normal query patterns, the systems and methods may identify an optimal position for certain types of edges that are often traversed with respect to particular types of nodes.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2022004494A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2022004494A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2022004494A13</originalsourceid><addsrcrecordid>eNrjZLDyDwjx9PWMcnVRCHJ19g9yUQjwcXR29XX1C1Hw9FNwcXULcnQH8Tz93BXcgxwDPBRcHEMcnRyDXXkYWNMSc4pTeaE0N4Oym2uIs4duakF-fGpxQWJyal5qSXxosJGBkZGBgYmJpYmjoTFxqgBRPinR</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>OPTIMIZED RECORD PLACEMENT IN DEFRAGMENTING GRAPH DATABASE</title><source>esp@cenet</source><creator>KREUTZER, Tor ; KVALNES, Åge ; KARLBERG, Jan-Ove ; VALVÅG, Steffen ; JOHANSEN, Amund</creator><creatorcontrib>KREUTZER, Tor ; KVALNES, Åge ; KARLBERG, Jan-Ove ; VALVÅG, Steffen ; JOHANSEN, Amund</creatorcontrib><description>Methods and systems are disclosed for optimizing record placement in defragmenting a graph database. Issues with fragmented data within a graph database are addressed on the record level by placing data that is frequently accessed together contiguously within memory. For example, a dynamic rule set may be developed based on dynamically analyzing access patterns of the graph database, policies, system characteristics and/or other heuristics. Based on statistics regarding normal query patterns, the systems and methods may identify an optimal position for certain types of edges that are often traversed with respect to particular types of nodes.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2022</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=20220106&amp;DB=EPODOC&amp;CC=US&amp;NR=2022004494A1$$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=20220106&amp;DB=EPODOC&amp;CC=US&amp;NR=2022004494A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>KREUTZER, Tor</creatorcontrib><creatorcontrib>KVALNES, Åge</creatorcontrib><creatorcontrib>KARLBERG, Jan-Ove</creatorcontrib><creatorcontrib>VALVÅG, Steffen</creatorcontrib><creatorcontrib>JOHANSEN, Amund</creatorcontrib><title>OPTIMIZED RECORD PLACEMENT IN DEFRAGMENTING GRAPH DATABASE</title><description>Methods and systems are disclosed for optimizing record placement in defragmenting a graph database. Issues with fragmented data within a graph database are addressed on the record level by placing data that is frequently accessed together contiguously within memory. For example, a dynamic rule set may be developed based on dynamically analyzing access patterns of the graph database, policies, system characteristics and/or other heuristics. Based on statistics regarding normal query patterns, the systems and methods may identify an optimal position for certain types of edges that are often traversed with respect to particular types of nodes.</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>2022</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLDyDwjx9PWMcnVRCHJ19g9yUQjwcXR29XX1C1Hw9FNwcXULcnQH8Tz93BXcgxwDPBRcHEMcnRyDXXkYWNMSc4pTeaE0N4Oym2uIs4duakF-fGpxQWJyal5qSXxosJGBkZGBgYmJpYmjoTFxqgBRPinR</recordid><startdate>20220106</startdate><enddate>20220106</enddate><creator>KREUTZER, Tor</creator><creator>KVALNES, Åge</creator><creator>KARLBERG, Jan-Ove</creator><creator>VALVÅG, Steffen</creator><creator>JOHANSEN, Amund</creator><scope>EVB</scope></search><sort><creationdate>20220106</creationdate><title>OPTIMIZED RECORD PLACEMENT IN DEFRAGMENTING GRAPH DATABASE</title><author>KREUTZER, Tor ; KVALNES, Åge ; KARLBERG, Jan-Ove ; VALVÅG, Steffen ; JOHANSEN, Amund</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2022004494A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2022</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>KREUTZER, Tor</creatorcontrib><creatorcontrib>KVALNES, Åge</creatorcontrib><creatorcontrib>KARLBERG, Jan-Ove</creatorcontrib><creatorcontrib>VALVÅG, Steffen</creatorcontrib><creatorcontrib>JOHANSEN, Amund</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>KREUTZER, Tor</au><au>KVALNES, Åge</au><au>KARLBERG, Jan-Ove</au><au>VALVÅG, Steffen</au><au>JOHANSEN, Amund</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>OPTIMIZED RECORD PLACEMENT IN DEFRAGMENTING GRAPH DATABASE</title><date>2022-01-06</date><risdate>2022</risdate><abstract>Methods and systems are disclosed for optimizing record placement in defragmenting a graph database. Issues with fragmented data within a graph database are addressed on the record level by placing data that is frequently accessed together contiguously within memory. For example, a dynamic rule set may be developed based on dynamically analyzing access patterns of the graph database, policies, system characteristics and/or other heuristics. Based on statistics regarding normal query patterns, the systems and methods may identify an optimal position for certain types of edges that are often traversed with respect to particular types of nodes.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2022004494A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title OPTIMIZED RECORD PLACEMENT IN DEFRAGMENTING GRAPH DATABASE
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T07%3A31%3A08IST&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=KREUTZER,%20Tor&rft.date=2022-01-06&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2022004494A1%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