EFFICIENT DETERMINATION OF JOIN PATHS VIA CARDINALITY ESTIMATION

A probabilistic counting structure such as a hyperloglog may be formed during a table scan for each of a selected set of columns. The columns may be selected based on an initial estimate of relatedness, which may be based on data types of the respective columns. An estimated cardinality of an inters...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	RATH, Timothy Andrew, GUPTA, Anurag Windlass, KALKI, Santosh, RAGHAVAN, Srinivasan Sundar
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	RATH, Timothy Andrew GUPTA, Anurag Windlass KALKI, Santosh RAGHAVAN, Srinivasan Sundar
description	A probabilistic counting structure such as a hyperloglog may be formed during a table scan for each of a selected set of columns. The columns may be selected based on an initial estimate of relatedness, which may be based on data types of the respective columns. An estimated cardinality of an intersection or union of columns may be formed based on an intersection of the probabilistic data structures. A join path may be determined based on the estimated cardinality of an intersection or union of the columns.
format	Patent
fullrecord	<record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_EP3238100B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EP3238100B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_EP3238100B13</originalsourceid><addsrcrecordid>eNrjZHBwdXPzdPZ09QtRcHENcQ3y9fRzDPH091Pwd1Pw8vf0UwhwDPEIVgjzdFRwdgxyAcr6eIZEKrgGh3j6ghXyMLCmJeYUp_JCaW4GBTfXEGcP3dSC_PjU4oLE5NS81JJ41wBjI2MLQwMDJ0NjIpQAAF8qKkk</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>EFFICIENT DETERMINATION OF JOIN PATHS VIA CARDINALITY ESTIMATION</title><source>esp@cenet</source><creator>RATH, Timothy Andrew ; GUPTA, Anurag Windlass ; KALKI, Santosh ; RAGHAVAN, Srinivasan Sundar</creator><creatorcontrib>RATH, Timothy Andrew ; GUPTA, Anurag Windlass ; KALKI, Santosh ; RAGHAVAN, Srinivasan Sundar</creatorcontrib><description>A probabilistic counting structure such as a hyperloglog may be formed during a table scan for each of a selected set of columns. The columns may be selected based on an initial estimate of relatedness, which may be based on data types of the respective columns. An estimated cardinality of an intersection or union of columns may be formed based on an intersection of the probabilistic data structures. A join path may be determined based on the estimated cardinality of an intersection or union of the columns.</description><language>eng ; fre ; ger</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2019</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=20190619&DB=EPODOC&CC=EP&NR=3238100B1$$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&date=20190619&DB=EPODOC&CC=EP&NR=3238100B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>RATH, Timothy Andrew</creatorcontrib><creatorcontrib>GUPTA, Anurag Windlass</creatorcontrib><creatorcontrib>KALKI, Santosh</creatorcontrib><creatorcontrib>RAGHAVAN, Srinivasan Sundar</creatorcontrib><title>EFFICIENT DETERMINATION OF JOIN PATHS VIA CARDINALITY ESTIMATION</title><description>A probabilistic counting structure such as a hyperloglog may be formed during a table scan for each of a selected set of columns. The columns may be selected based on an initial estimate of relatedness, which may be based on data types of the respective columns. An estimated cardinality of an intersection or union of columns may be formed based on an intersection of the probabilistic data structures. A join path may be determined based on the estimated cardinality of an intersection or union of the columns.</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>2019</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHBwdXPzdPZ09QtRcHENcQ3y9fRzDPH091Pwd1Pw8vf0UwhwDPEIVgjzdFRwdgxyAcr6eIZEKrgGh3j6ghXyMLCmJeYUp_JCaW4GBTfXEGcP3dSC_PjU4oLE5NS81JJ41wBjI2MLQwMDJ0NjIpQAAF8qKkk</recordid><startdate>20190619</startdate><enddate>20190619</enddate><creator>RATH, Timothy Andrew</creator><creator>GUPTA, Anurag Windlass</creator><creator>KALKI, Santosh</creator><creator>RAGHAVAN, Srinivasan Sundar</creator><scope>EVB</scope></search><sort><creationdate>20190619</creationdate><title>EFFICIENT DETERMINATION OF JOIN PATHS VIA CARDINALITY ESTIMATION</title><author>RATH, Timothy Andrew ; GUPTA, Anurag Windlass ; KALKI, Santosh ; RAGHAVAN, Srinivasan Sundar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_EP3238100B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; fre ; ger</language><creationdate>2019</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>RATH, Timothy Andrew</creatorcontrib><creatorcontrib>GUPTA, Anurag Windlass</creatorcontrib><creatorcontrib>KALKI, Santosh</creatorcontrib><creatorcontrib>RAGHAVAN, Srinivasan Sundar</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>RATH, Timothy Andrew</au><au>GUPTA, Anurag Windlass</au><au>KALKI, Santosh</au><au>RAGHAVAN, Srinivasan Sundar</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>EFFICIENT DETERMINATION OF JOIN PATHS VIA CARDINALITY ESTIMATION</title><date>2019-06-19</date><risdate>2019</risdate><abstract>A probabilistic counting structure such as a hyperloglog may be formed during a table scan for each of a selected set of columns. The columns may be selected based on an initial estimate of relatedness, which may be based on data types of the respective columns. An estimated cardinality of an intersection or union of columns may be formed based on an intersection of the probabilistic data structures. A join path may be determined based on the estimated cardinality of an intersection or union of the columns.</abstract><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier
ispartof
issn
language	eng ; fre ; ger
recordid	cdi_epo_espacenet_EP3238100B1
source	esp@cenet
subjects	CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS
title	EFFICIENT DETERMINATION OF JOIN PATHS VIA CARDINALITY ESTIMATION
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-30T22%3A57%3A07IST&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=RATH,%20Timothy%20Andrew&rft.date=2019-06-19&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EEP3238100B1%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