Decidability of Equivalence of Aggregate Count-Distinct Queries

Decidability of Equivalence of Aggregate Count-Distinct Queries

We address the problem of equivalence of count-distinct aggregate queries, prove that the problem is decidable, and can be decided in the third level of Polynomial hierarchy. We introduce the notion of core for conjunctive queries with comparisons as an extension of the classical notion for relation...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hariri, Babak Bagheri, Tannen, Val
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Databases
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 Hariri, Babak Bagheri
Tannen, Val
description We address the problem of equivalence of count-distinct aggregate queries, prove that the problem is decidable, and can be decided in the third level of Polynomial hierarchy. We introduce the notion of core for conjunctive queries with comparisons as an extension of the classical notion for relational queries, and prove that the existence of isomorphism among cores of queries is a sufficient and necessary condition for equivalence of conjunctive queries with comparisons similar to the classical relational setting. However, it is not a necessary condition for equivalence of count-distinct queries. We introduce a relaxation of this condition based on a new notion, which is a potentially new query equivalent to the initial query, introduced to capture the behavior of count-distinct operator.
doi_str_mv 10.48550/arxiv.1509.00100
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1509_00100</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1509_00100</sourcerecordid><originalsourceid>FETCH-LOGICAL-a670-c31544cc966e4824044a1d78143e5bdc6b9fd8b9b173bb9f489452c8dc84b8a63</originalsourceid><addsrcrecordid>eNotz81OwzAQBGBfOKCWB-BEXiDBrteOfaqqtPxIlRBS79Ha3kSWQgqOU9G3hxZOM3MZ6WPsXvAKjFL8EdN3PFVCcVtxLji_Zest-RjQxSHmc3Hsit3XHE840OjpMjd9n6jHTEVznMdcbuOU4-hz8T5TijQt2U2Hw0R3_7lgh6fdoXkp92_Pr81mX6KueemlUADeW60JzAo4AIpQGwGSlAteO9sF46wTtXS_HYwFtfImeAPOoJYL9vB3exW0nyl-YDq3F0l7lcgfjURDCw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Decidability of Equivalence of Aggregate Count-Distinct Queries</title><source>arXiv.org</source><creator>Hariri, Babak Bagheri ; Tannen, Val</creator><creatorcontrib>Hariri, Babak Bagheri ; Tannen, Val</creatorcontrib><description>We address the problem of equivalence of count-distinct aggregate queries, prove that the problem is decidable, and can be decided in the third level of Polynomial hierarchy. We introduce the notion of core for conjunctive queries with comparisons as an extension of the classical notion for relational queries, and prove that the existence of isomorphism among cores of queries is a sufficient and necessary condition for equivalence of conjunctive queries with comparisons similar to the classical relational setting. However, it is not a necessary condition for equivalence of count-distinct queries. We introduce a relaxation of this condition based on a new notion, which is a potentially new query equivalent to the initial query, introduced to capture the behavior of count-distinct operator.</description><identifier>DOI: 10.48550/arxiv.1509.00100</identifier><language>eng</language><subject>Computer Science - Databases</subject><creationdate>2015-08</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1509.00100$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1509.00100$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Hariri, Babak Bagheri</creatorcontrib><creatorcontrib>Tannen, Val</creatorcontrib><title>Decidability of Equivalence of Aggregate Count-Distinct Queries</title><description>We address the problem of equivalence of count-distinct aggregate queries, prove that the problem is decidable, and can be decided in the third level of Polynomial hierarchy. We introduce the notion of core for conjunctive queries with comparisons as an extension of the classical notion for relational queries, and prove that the existence of isomorphism among cores of queries is a sufficient and necessary condition for equivalence of conjunctive queries with comparisons similar to the classical relational setting. However, it is not a necessary condition for equivalence of count-distinct queries. We introduce a relaxation of this condition based on a new notion, which is a potentially new query equivalent to the initial query, introduced to capture the behavior of count-distinct operator.</description><subject>Computer Science - Databases</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz81OwzAQBGBfOKCWB-BEXiDBrteOfaqqtPxIlRBS79Ha3kSWQgqOU9G3hxZOM3MZ6WPsXvAKjFL8EdN3PFVCcVtxLji_Zest-RjQxSHmc3Hsit3XHE840OjpMjd9n6jHTEVznMdcbuOU4-hz8T5TijQt2U2Hw0R3_7lgh6fdoXkp92_Pr81mX6KueemlUADeW60JzAo4AIpQGwGSlAteO9sF46wTtXS_HYwFtfImeAPOoJYL9vB3exW0nyl-YDq3F0l7lcgfjURDCw</recordid><startdate>20150831</startdate><enddate>20150831</enddate><creator>Hariri, Babak Bagheri</creator><creator>Tannen, Val</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20150831</creationdate><title>Decidability of Equivalence of Aggregate Count-Distinct Queries</title><author>Hariri, Babak Bagheri ; Tannen, Val</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a670-c31544cc966e4824044a1d78143e5bdc6b9fd8b9b173bb9f489452c8dc84b8a63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Computer Science - Databases</topic><toplevel>online_resources</toplevel><creatorcontrib>Hariri, Babak Bagheri</creatorcontrib><creatorcontrib>Tannen, Val</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hariri, Babak Bagheri</au><au>Tannen, Val</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Decidability of Equivalence of Aggregate Count-Distinct Queries</atitle><date>2015-08-31</date><risdate>2015</risdate><abstract>We address the problem of equivalence of count-distinct aggregate queries, prove that the problem is decidable, and can be decided in the third level of Polynomial hierarchy. We introduce the notion of core for conjunctive queries with comparisons as an extension of the classical notion for relational queries, and prove that the existence of isomorphism among cores of queries is a sufficient and necessary condition for equivalence of conjunctive queries with comparisons similar to the classical relational setting. However, it is not a necessary condition for equivalence of count-distinct queries. We introduce a relaxation of this condition based on a new notion, which is a potentially new query equivalent to the initial query, introduced to capture the behavior of count-distinct operator.</abstract><doi>10.48550/arxiv.1509.00100</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1509.00100
ispartof
issn
language eng
recordid cdi_arxiv_primary_1509_00100
source arXiv.org
subjects Computer Science - Databases
title Decidability of Equivalence of Aggregate Count-Distinct Queries
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T04%3A04%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Decidability%20of%20Equivalence%20of%20Aggregate%20Count-Distinct%20Queries&rft.au=Hariri,%20Babak%20Bagheri&rft.date=2015-08-31&rft_id=info:doi/10.48550/arxiv.1509.00100&rft_dat=%3Carxiv_GOX%3E1509_00100%3C/arxiv_GOX%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