Partitioning data according to relative differences indicated by a cover tree

Partitioning data according to relative differences indicated by a cover tree

A data set may be partitioned according to relative differences indicated by a cover tree. A cover tree may be generated for a data set. Items in the data set may be stored at the same or different nodes according to the relative difference between the items indicated in the cover tree. Portions of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Perumalla, Poorna Chand Srinivas, Stefani, Stefano, Gupta, Pracheer, Kandalam Srinivasa, Srikanth, Zhang, Jia Bi, Jampani, Madan Mohan Rao
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
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 Perumalla, Poorna Chand Srinivas
Stefani, Stefano
Gupta, Pracheer
Kandalam Srinivasa, Srikanth
Zhang, Jia Bi
Jampani, Madan Mohan Rao
description A data set may be partitioned according to relative differences indicated by a cover tree. A cover tree may be generated for a data set. Items in the data set may be stored at the same or different nodes according to the relative difference between the items indicated in the cover tree. Portions of the cover tree may be assigned to different nodes storing the data set. Access requests for the data set may be performed by sending the access requests to nodes identified according to the assigned portions of the cover tree.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US10616338B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US10616338B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US10616338B13</originalsourceid><addsrcrecordid>eNqNyjEKAjEQRuE0FqLeYTyAYAgs1opiIwhqvYzJHxlYkmUyLHh7ETyA1eODN3eXK6uJSS1SXpTYmDjGqulLq6QY2GQCJckZihLRSEqSyIZEzzcxxTpByRRYulnmoWH168KtT8f74bzBWHu0kSMKrH_c_LbzXQi7vQ__PB_nKzZH</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Partitioning data according to relative differences indicated by a cover tree</title><source>esp@cenet</source><creator>Perumalla, Poorna Chand Srinivas ; Stefani, Stefano ; Gupta, Pracheer ; Kandalam Srinivasa, Srikanth ; Zhang, Jia Bi ; Jampani, Madan Mohan Rao</creator><creatorcontrib>Perumalla, Poorna Chand Srinivas ; Stefani, Stefano ; Gupta, Pracheer ; Kandalam Srinivasa, Srikanth ; Zhang, Jia Bi ; Jampani, Madan Mohan Rao</creatorcontrib><description>A data set may be partitioned according to relative differences indicated by a cover tree. A cover tree may be generated for a data set. Items in the data set may be stored at the same or different nodes according to the relative difference between the items indicated in the cover tree. Portions of the cover tree may be assigned to different nodes storing the data set. Access requests for the data set may be performed by sending the access requests to nodes identified according to the assigned portions of the cover tree.</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>2020</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=20200407&amp;DB=EPODOC&amp;CC=US&amp;NR=10616338B1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,778,883,25551,76302</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20200407&amp;DB=EPODOC&amp;CC=US&amp;NR=10616338B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Perumalla, Poorna Chand Srinivas</creatorcontrib><creatorcontrib>Stefani, Stefano</creatorcontrib><creatorcontrib>Gupta, Pracheer</creatorcontrib><creatorcontrib>Kandalam Srinivasa, Srikanth</creatorcontrib><creatorcontrib>Zhang, Jia Bi</creatorcontrib><creatorcontrib>Jampani, Madan Mohan Rao</creatorcontrib><title>Partitioning data according to relative differences indicated by a cover tree</title><description>A data set may be partitioned according to relative differences indicated by a cover tree. A cover tree may be generated for a data set. Items in the data set may be stored at the same or different nodes according to the relative difference between the items indicated in the cover tree. Portions of the cover tree may be assigned to different nodes storing the data set. Access requests for the data set may be performed by sending the access requests to nodes identified according to the assigned portions of the cover tree.</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>2020</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyjEKAjEQRuE0FqLeYTyAYAgs1opiIwhqvYzJHxlYkmUyLHh7ETyA1eODN3eXK6uJSS1SXpTYmDjGqulLq6QY2GQCJckZihLRSEqSyIZEzzcxxTpByRRYulnmoWH168KtT8f74bzBWHu0kSMKrH_c_LbzXQi7vQ__PB_nKzZH</recordid><startdate>20200407</startdate><enddate>20200407</enddate><creator>Perumalla, Poorna Chand Srinivas</creator><creator>Stefani, Stefano</creator><creator>Gupta, Pracheer</creator><creator>Kandalam Srinivasa, Srikanth</creator><creator>Zhang, Jia Bi</creator><creator>Jampani, Madan Mohan Rao</creator><scope>EVB</scope></search><sort><creationdate>20200407</creationdate><title>Partitioning data according to relative differences indicated by a cover tree</title><author>Perumalla, Poorna Chand Srinivas ; Stefani, Stefano ; Gupta, Pracheer ; Kandalam Srinivasa, Srikanth ; Zhang, Jia Bi ; Jampani, Madan Mohan Rao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US10616338B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2020</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>Perumalla, Poorna Chand Srinivas</creatorcontrib><creatorcontrib>Stefani, Stefano</creatorcontrib><creatorcontrib>Gupta, Pracheer</creatorcontrib><creatorcontrib>Kandalam Srinivasa, Srikanth</creatorcontrib><creatorcontrib>Zhang, Jia Bi</creatorcontrib><creatorcontrib>Jampani, Madan Mohan Rao</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Perumalla, Poorna Chand Srinivas</au><au>Stefani, Stefano</au><au>Gupta, Pracheer</au><au>Kandalam Srinivasa, Srikanth</au><au>Zhang, Jia Bi</au><au>Jampani, Madan Mohan Rao</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Partitioning data according to relative differences indicated by a cover tree</title><date>2020-04-07</date><risdate>2020</risdate><abstract>A data set may be partitioned according to relative differences indicated by a cover tree. A cover tree may be generated for a data set. Items in the data set may be stored at the same or different nodes according to the relative difference between the items indicated in the cover tree. Portions of the cover tree may be assigned to different nodes storing the data set. Access requests for the data set may be performed by sending the access requests to nodes identified according to the assigned portions of the cover tree.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US10616338B1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Partitioning data according to relative differences indicated by a cover tree
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T19%3A12%3A30IST&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=Perumalla,%20Poorna%20Chand%20Srinivas&rft.date=2020-04-07&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS10616338B1%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