ACCELERATED AND MEMORY EFFICIENT SIMILARITY MATCHING

ACCELERATED AND MEMORY EFFICIENT SIMILARITY MATCHING

A method, a system, and a computer program product for performing accelerated and memory efficient similarity matching. A data stream having a plurality of data zones is received. Each zone includes a zone identifier. A plurality of hashing values for each zone are generated. Each hashing value is g...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: ARRUDA, Luis, WATKINS, Peter, ZIEBER, Raz, POIRIER, Jamey C, SMITH, Stephen A, VANDERSPEK, Adrian T
Format: Patent
Sprache:eng ; fre ; ger
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 ARRUDA, Luis
WATKINS, Peter
ZIEBER, Raz
POIRIER, Jamey C
SMITH, Stephen A
VANDERSPEK, Adrian T
description A method, a system, and a computer program product for performing accelerated and memory efficient similarity matching. A data stream having a plurality of data zones is received. Each zone includes a zone identifier. A plurality of hashing values for each zone are generated. Each hashing value is generated based on a portion of a zone. A storage structure having a plurality of storage containers is generated. Each storage container stores one or more hashing values associated with each respective storage container and a plurality of zone identifiers referencing the associated hashing values. At least one storage container includes a listing of zone identifiers stored in each storage container. Using the storage structure, the received data stream is deduplicated.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_EP3832476A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EP3832476A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_EP3832476A13</originalsourceid><addsrcrecordid>eNrjZDBxdHZ29XENcgxxdVFw9HNR8HX19Q-KVHB1c_N09nT1C1EI9vT19HEM8gyJVPB1DHH28PRz52FgTUvMKU7lhdLcDApurkAp3dSC_PjU4oLE5NS81JJ41wBjC2MjE3MzR0NjIpQAAHL0Jv0</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>ACCELERATED AND MEMORY EFFICIENT SIMILARITY MATCHING</title><source>esp@cenet</source><creator>ARRUDA, Luis ; WATKINS, Peter ; ZIEBER, Raz ; POIRIER, Jamey C ; SMITH, Stephen A ; VANDERSPEK, Adrian T</creator><creatorcontrib>ARRUDA, Luis ; WATKINS, Peter ; ZIEBER, Raz ; POIRIER, Jamey C ; SMITH, Stephen A ; VANDERSPEK, Adrian T</creatorcontrib><description>A method, a system, and a computer program product for performing accelerated and memory efficient similarity matching. A data stream having a plurality of data zones is received. Each zone includes a zone identifier. A plurality of hashing values for each zone are generated. Each hashing value is generated based on a portion of a zone. A storage structure having a plurality of storage containers is generated. Each storage container stores one or more hashing values associated with each respective storage container and a plurality of zone identifiers referencing the associated hashing values. At least one storage container includes a listing of zone identifiers stored in each storage container. Using the storage structure, the received data stream is deduplicated.</description><language>eng ; fre ; ger</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2021</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=20210609&amp;DB=EPODOC&amp;CC=EP&amp;NR=3832476A1$$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&amp;date=20210609&amp;DB=EPODOC&amp;CC=EP&amp;NR=3832476A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>ARRUDA, Luis</creatorcontrib><creatorcontrib>WATKINS, Peter</creatorcontrib><creatorcontrib>ZIEBER, Raz</creatorcontrib><creatorcontrib>POIRIER, Jamey C</creatorcontrib><creatorcontrib>SMITH, Stephen A</creatorcontrib><creatorcontrib>VANDERSPEK, Adrian T</creatorcontrib><title>ACCELERATED AND MEMORY EFFICIENT SIMILARITY MATCHING</title><description>A method, a system, and a computer program product for performing accelerated and memory efficient similarity matching. A data stream having a plurality of data zones is received. Each zone includes a zone identifier. A plurality of hashing values for each zone are generated. Each hashing value is generated based on a portion of a zone. A storage structure having a plurality of storage containers is generated. Each storage container stores one or more hashing values associated with each respective storage container and a plurality of zone identifiers referencing the associated hashing values. At least one storage container includes a listing of zone identifiers stored in each storage container. Using the storage structure, the received data stream is deduplicated.</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>2021</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDBxdHZ29XENcgxxdVFw9HNR8HX19Q-KVHB1c_N09nT1C1EI9vT19HEM8gyJVPB1DHH28PRz52FgTUvMKU7lhdLcDApurkAp3dSC_PjU4oLE5NS81JJ41wBjC2MjE3MzR0NjIpQAAHL0Jv0</recordid><startdate>20210609</startdate><enddate>20210609</enddate><creator>ARRUDA, Luis</creator><creator>WATKINS, Peter</creator><creator>ZIEBER, Raz</creator><creator>POIRIER, Jamey C</creator><creator>SMITH, Stephen A</creator><creator>VANDERSPEK, Adrian T</creator><scope>EVB</scope></search><sort><creationdate>20210609</creationdate><title>ACCELERATED AND MEMORY EFFICIENT SIMILARITY MATCHING</title><author>ARRUDA, Luis ; WATKINS, Peter ; ZIEBER, Raz ; POIRIER, Jamey C ; SMITH, Stephen A ; VANDERSPEK, Adrian T</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_EP3832476A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; fre ; ger</language><creationdate>2021</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>ARRUDA, Luis</creatorcontrib><creatorcontrib>WATKINS, Peter</creatorcontrib><creatorcontrib>ZIEBER, Raz</creatorcontrib><creatorcontrib>POIRIER, Jamey C</creatorcontrib><creatorcontrib>SMITH, Stephen A</creatorcontrib><creatorcontrib>VANDERSPEK, Adrian T</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>ARRUDA, Luis</au><au>WATKINS, Peter</au><au>ZIEBER, Raz</au><au>POIRIER, Jamey C</au><au>SMITH, Stephen A</au><au>VANDERSPEK, Adrian T</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>ACCELERATED AND MEMORY EFFICIENT SIMILARITY MATCHING</title><date>2021-06-09</date><risdate>2021</risdate><abstract>A method, a system, and a computer program product for performing accelerated and memory efficient similarity matching. A data stream having a plurality of data zones is received. Each zone includes a zone identifier. A plurality of hashing values for each zone are generated. Each hashing value is generated based on a portion of a zone. A storage structure having a plurality of storage containers is generated. Each storage container stores one or more hashing values associated with each respective storage container and a plurality of zone identifiers referencing the associated hashing values. At least one storage container includes a listing of zone identifiers stored in each storage container. Using the storage structure, the received data stream is deduplicated.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng ; fre ; ger
recordid cdi_epo_espacenet_EP3832476A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title ACCELERATED AND MEMORY EFFICIENT SIMILARITY MATCHING
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T03%3A27%3A19IST&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=ARRUDA,%20Luis&rft.date=2021-06-09&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EEP3832476A1%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