Optimizing aggregates over correlated windows in a stream-query system

Optimizing aggregates over correlated windows in a stream-query system

Methods, systems, apparatuses, and computer program products are provided for determining a query plan. A query is received that comprises a request for a data result for each of a plurality of original time windows. The plurality of original time windows included in the query are identified. An ini...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Wu, Wentao, Raizman, Alexander, Bernstein, Philip A
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 Wu, Wentao
Raizman, Alexander
Bernstein, Philip A
description Methods, systems, apparatuses, and computer program products are provided for determining a query plan. A query is received that comprises a request for a data result for each of a plurality of original time windows. The plurality of original time windows included in the query are identified. An initial window representation is generated that identifies a set of connections between windows in a window set that includes at least the original time windows. A revised window representation is generated that includes an alternative set of connections between windows in the window set based at least on an execution cost for at least one window. The revised window representation is selected to obtain the data result for each of the plurality of original time windows. A revised query plan based on the revised window representation is provided to obtain the data result for each of the plurality of original time windows.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US11507577B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US11507577B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US11507577B23</originalsourceid><addsrcrecordid>eNrjZHDzLyjJzM2sysxLV0hMTy9KTU8sSS1WyC9LLVJIzi8qSs0B8lMUyjPzUvLLixUy8xQSFYpLilITc3ULS1OLKhWKK4tLUnN5GFjTEnOKU3mhNDeDoptriLOHbmpBfnxqcUFicmpeakl8aLChoamBuam5uZORMTFqAILbNF8</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Optimizing aggregates over correlated windows in a stream-query system</title><source>esp@cenet</source><creator>Wu, Wentao ; Raizman, Alexander ; Bernstein, Philip A</creator><creatorcontrib>Wu, Wentao ; Raizman, Alexander ; Bernstein, Philip A</creatorcontrib><description>Methods, systems, apparatuses, and computer program products are provided for determining a query plan. A query is received that comprises a request for a data result for each of a plurality of original time windows. The plurality of original time windows included in the query are identified. An initial window representation is generated that identifies a set of connections between windows in a window set that includes at least the original time windows. A revised window representation is generated that includes an alternative set of connections between windows in the window set based at least on an execution cost for at least one window. The revised window representation is selected to obtain the data result for each of the plurality of original time windows. A revised query plan based on the revised window representation is provided to obtain the data result for each of the plurality of original time windows.</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=20221122&amp;DB=EPODOC&amp;CC=US&amp;NR=11507577B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,309,781,886,25566,76549</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20221122&amp;DB=EPODOC&amp;CC=US&amp;NR=11507577B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Wu, Wentao</creatorcontrib><creatorcontrib>Raizman, Alexander</creatorcontrib><creatorcontrib>Bernstein, Philip A</creatorcontrib><title>Optimizing aggregates over correlated windows in a stream-query system</title><description>Methods, systems, apparatuses, and computer program products are provided for determining a query plan. A query is received that comprises a request for a data result for each of a plurality of original time windows. The plurality of original time windows included in the query are identified. An initial window representation is generated that identifies a set of connections between windows in a window set that includes at least the original time windows. A revised window representation is generated that includes an alternative set of connections between windows in the window set based at least on an execution cost for at least one window. The revised window representation is selected to obtain the data result for each of the plurality of original time windows. A revised query plan based on the revised window representation is provided to obtain the data result for each of the plurality of original time windows.</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>eNrjZHDzLyjJzM2sysxLV0hMTy9KTU8sSS1WyC9LLVJIzi8qSs0B8lMUyjPzUvLLixUy8xQSFYpLilITc3ULS1OLKhWKK4tLUnN5GFjTEnOKU3mhNDeDoptriLOHbmpBfnxqcUFicmpeakl8aLChoamBuam5uZORMTFqAILbNF8</recordid><startdate>20221122</startdate><enddate>20221122</enddate><creator>Wu, Wentao</creator><creator>Raizman, Alexander</creator><creator>Bernstein, Philip A</creator><scope>EVB</scope></search><sort><creationdate>20221122</creationdate><title>Optimizing aggregates over correlated windows in a stream-query system</title><author>Wu, Wentao ; Raizman, Alexander ; Bernstein, Philip A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US11507577B23</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>Wu, Wentao</creatorcontrib><creatorcontrib>Raizman, Alexander</creatorcontrib><creatorcontrib>Bernstein, Philip A</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Wu, Wentao</au><au>Raizman, Alexander</au><au>Bernstein, Philip A</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Optimizing aggregates over correlated windows in a stream-query system</title><date>2022-11-22</date><risdate>2022</risdate><abstract>Methods, systems, apparatuses, and computer program products are provided for determining a query plan. A query is received that comprises a request for a data result for each of a plurality of original time windows. The plurality of original time windows included in the query are identified. An initial window representation is generated that identifies a set of connections between windows in a window set that includes at least the original time windows. A revised window representation is generated that includes an alternative set of connections between windows in the window set based at least on an execution cost for at least one window. The revised window representation is selected to obtain the data result for each of the plurality of original time windows. A revised query plan based on the revised window representation is provided to obtain the data result for each of the plurality of original time windows.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US11507577B2
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Optimizing aggregates over correlated windows in a stream-query system
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-18T13%3A12%3A10IST&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=Wu,%20Wentao&rft.date=2022-11-22&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS11507577B2%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