Memory-efficient management of computer network resources
Systems and methods are provided for managing a data store, invalidation requests, and/or resource requests. The system and methods may use one or more data structures, such as hash data structures and/or probabilistic data structures, to achieve various levels of granularity and/or computer resourc...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| 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 | Solapurkar Chaitanya Ashok |
| description | Systems and methods are provided for managing a data store, invalidation requests, and/or resource requests. The system and methods may use one or more data structures, such as hash data structures and/or probabilistic data structures, to achieve various levels of granularity and/or computer resource efficiencies. Further, the invalidation request data may be stored at a front-end layer separate from a data store layer, such that the invalidation requests are processed based on resource requests. In the example, the hash data structure can be used for recent invalidation requests and older request data can be stored in memory-efficient probabilistic data structures. For example, probabilistic filters, such as a bloom filter, can store resource identifiers along with an associated version for space-efficient invalidation comparisons. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US9928178B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US9928178B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US9928178B13</originalsourceid><addsrcrecordid>eNrjZLD0Tc3NL6rUTU1Ly0zOTM0rUchNzEtMT80FMfPTFJLzcwtKS1KLFPJSS8rzi7IVilKL80uLklOLeRhY0xJzilN5oTQ3g4Kba4izh25qQX58anFBYnIqUE98aLClpZGFobmFk6ExEUoANvsvQQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Memory-efficient management of computer network resources</title><source>esp@cenet</source><creator>Solapurkar Chaitanya Ashok</creator><creatorcontrib>Solapurkar Chaitanya Ashok</creatorcontrib><description>Systems and methods are provided for managing a data store, invalidation requests, and/or resource requests. The system and methods may use one or more data structures, such as hash data structures and/or probabilistic data structures, to achieve various levels of granularity and/or computer resource efficiencies. Further, the invalidation request data may be stored at a front-end layer separate from a data store layer, such that the invalidation requests are processed based on resource requests. In the example, the hash data structure can be used for recent invalidation requests and older request data can be stored in memory-efficient probabilistic data structures. For example, probabilistic filters, such as a bloom filter, can store resource identifiers along with an associated version for space-efficient invalidation comparisons.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2018</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=20180327&DB=EPODOC&CC=US&NR=9928178B1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76318</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20180327&DB=EPODOC&CC=US&NR=9928178B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Solapurkar Chaitanya Ashok</creatorcontrib><title>Memory-efficient management of computer network resources</title><description>Systems and methods are provided for managing a data store, invalidation requests, and/or resource requests. The system and methods may use one or more data structures, such as hash data structures and/or probabilistic data structures, to achieve various levels of granularity and/or computer resource efficiencies. Further, the invalidation request data may be stored at a front-end layer separate from a data store layer, such that the invalidation requests are processed based on resource requests. In the example, the hash data structure can be used for recent invalidation requests and older request data can be stored in memory-efficient probabilistic data structures. For example, probabilistic filters, such as a bloom filter, can store resource identifiers along with an associated version for space-efficient invalidation comparisons.</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>2018</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLD0Tc3NL6rUTU1Ly0zOTM0rUchNzEtMT80FMfPTFJLzcwtKS1KLFPJSS8rzi7IVilKL80uLklOLeRhY0xJzilN5oTQ3g4Kba4izh25qQX58anFBYnIqUE98aLClpZGFobmFk6ExEUoANvsvQQ</recordid><startdate>20180327</startdate><enddate>20180327</enddate><creator>Solapurkar Chaitanya Ashok</creator><scope>EVB</scope></search><sort><creationdate>20180327</creationdate><title>Memory-efficient management of computer network resources</title><author>Solapurkar Chaitanya Ashok</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US9928178B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2018</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Solapurkar Chaitanya Ashok</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Solapurkar Chaitanya Ashok</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Memory-efficient management of computer network resources</title><date>2018-03-27</date><risdate>2018</risdate><abstract>Systems and methods are provided for managing a data store, invalidation requests, and/or resource requests. The system and methods may use one or more data structures, such as hash data structures and/or probabilistic data structures, to achieve various levels of granularity and/or computer resource efficiencies. Further, the invalidation request data may be stored at a front-end layer separate from a data store layer, such that the invalidation requests are processed based on resource requests. In the example, the hash data structure can be used for recent invalidation requests and older request data can be stored in memory-efficient probabilistic data structures. For example, probabilistic filters, such as a bloom filter, can store resource identifiers along with an associated version for space-efficient invalidation comparisons.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US9928178B1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | Memory-efficient management of computer network resources |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T14%3A10%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=Solapurkar%20Chaitanya%20Ashok&rft.date=2018-03-27&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS9928178B1%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 |