QUERY TREE LABELING AND PROCESSING

Systems and techniques are provided for query tree labeling and processing. A query may be received. A query tree may be generated from the query and identifiers may be generated for nodes of the query tree and stored in the nodes. Labels may be stored in nodes determined to meet at least one criter...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Joffe, Nitay, O'Clair, Brian
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 Joffe, Nitay
O'Clair, Brian
description Systems and techniques are provided for query tree labeling and processing. A query may be received. A query tree may be generated from the query and identifiers may be generated for nodes of the query tree and stored in the nodes. Labels may be stored in nodes determined to meet at least one criteria for being labeled nodes to generate a labeled query tree. The nodes of the labeled query tree may be processed by receiving results from an entry in a results data structure and returning the results from the entry as the results for the node if the identifier of the nodes matches the identifier of an entry in the results data structure. If there is no match, results may be computed for the node. The results generated by computing the node may be stored in the results data structure if the node has a label.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2022207042A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2022207042A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2022207042A13</originalsourceid><addsrcrecordid>eNrjZFAKDHUNilQICXJ1VfBxdHL18fRzV3D0c1EICPJ3dg0OBnJ5GFjTEnOKU3mhNDeDsptriLOHbmpBfnxqcUFicmpeakl8aLCRgZGRkYG5gYmRo6ExcaoAuRIjOw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>QUERY TREE LABELING AND PROCESSING</title><source>esp@cenet</source><creator>Joffe, Nitay ; O'Clair, Brian</creator><creatorcontrib>Joffe, Nitay ; O'Clair, Brian</creatorcontrib><description>Systems and techniques are provided for query tree labeling and processing. A query may be received. A query tree may be generated from the query and identifiers may be generated for nodes of the query tree and stored in the nodes. Labels may be stored in nodes determined to meet at least one criteria for being labeled nodes to generate a labeled query tree. The nodes of the labeled query tree may be processed by receiving results from an entry in a results data structure and returning the results from the entry as the results for the node if the identifier of the nodes matches the identifier of an entry in the results data structure. If there is no match, results may be computed for the node. The results generated by computing the node may be stored in the results data structure if the node has a label.</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=20220630&amp;DB=EPODOC&amp;CC=US&amp;NR=2022207042A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,309,781,886,25569,76552</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20220630&amp;DB=EPODOC&amp;CC=US&amp;NR=2022207042A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Joffe, Nitay</creatorcontrib><creatorcontrib>O'Clair, Brian</creatorcontrib><title>QUERY TREE LABELING AND PROCESSING</title><description>Systems and techniques are provided for query tree labeling and processing. A query may be received. A query tree may be generated from the query and identifiers may be generated for nodes of the query tree and stored in the nodes. Labels may be stored in nodes determined to meet at least one criteria for being labeled nodes to generate a labeled query tree. The nodes of the labeled query tree may be processed by receiving results from an entry in a results data structure and returning the results from the entry as the results for the node if the identifier of the nodes matches the identifier of an entry in the results data structure. If there is no match, results may be computed for the node. The results generated by computing the node may be stored in the results data structure if the node has a label.</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>eNrjZFAKDHUNilQICXJ1VfBxdHL18fRzV3D0c1EICPJ3dg0OBnJ5GFjTEnOKU3mhNDeDsptriLOHbmpBfnxqcUFicmpeakl8aLCRgZGRkYG5gYmRo6ExcaoAuRIjOw</recordid><startdate>20220630</startdate><enddate>20220630</enddate><creator>Joffe, Nitay</creator><creator>O'Clair, Brian</creator><scope>EVB</scope></search><sort><creationdate>20220630</creationdate><title>QUERY TREE LABELING AND PROCESSING</title><author>Joffe, Nitay ; O'Clair, Brian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2022207042A13</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>Joffe, Nitay</creatorcontrib><creatorcontrib>O'Clair, Brian</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Joffe, Nitay</au><au>O'Clair, Brian</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>QUERY TREE LABELING AND PROCESSING</title><date>2022-06-30</date><risdate>2022</risdate><abstract>Systems and techniques are provided for query tree labeling and processing. A query may be received. A query tree may be generated from the query and identifiers may be generated for nodes of the query tree and stored in the nodes. Labels may be stored in nodes determined to meet at least one criteria for being labeled nodes to generate a labeled query tree. The nodes of the labeled query tree may be processed by receiving results from an entry in a results data structure and returning the results from the entry as the results for the node if the identifier of the nodes matches the identifier of an entry in the results data structure. If there is no match, results may be computed for the node. The results generated by computing the node may be stored in the results data structure if the node has a label.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2022207042A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title QUERY TREE LABELING AND PROCESSING
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-15T21%3A30%3A25IST&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=Joffe,%20Nitay&rft.date=2022-06-30&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2022207042A1%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