On Safety of Unary and Nonunary IFP Operators
— The article investigates the safety of unary inflationary fixed point operators (IFP-operators), i.e., their computability in finitely many steps. Such operators correspond exactly to recursive SQL queries. Therefore, the problem under investigation is directly related to database theory. The prob...
Uloženo v:
| Vydáno v: | Automatic control and computer sciences Ročník 53; číslo 7; s. 683 - 688 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Moscow
Pleiades Publishing
01.12.2019
Springer Nature B.V |
| Témata: | |
| ISSN: | 0146-4116, 1558-108X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | —
The article investigates the safety of unary inflationary fixed point operators (IFP-operators), i.e., their computability in finitely many steps. Such operators correspond exactly to recursive SQL queries. Therefore, the problem under investigation is directly related to database theory. The problem arises from the fact that if recursion and universe relations, e.g., addition, are simultaneously used in a SQL query, then a query evaluation can fall into an infinite loop. Moreover, such a combination makes it possible to model a universal computing device, e.g., a Turing machine. Hence, the problem of finite computability for such SQL queries is undecidable. In our previous works, we established some properties of a universe those guarantee the finite computability of any IFP-operator in the universe. In this article, we investigate a connection between an arity of IFP-operators and their safety. The main result of this article is that some results for general IFP-operators do not hold for unary ones. An instance of a universe is constructed in which all unnested unary IFP-operators are safe. However, there are unsafe binary IFP-operators in this universe. Therefore, IFP-operators can become unsafe if the arity changes. In addition, there are unsafe nested unary operators. This contrasts with the general case in which this is impossible. There are also elementary equivalent universes where the same unary IFP-operators are unsafe. This behavior is also different from the behavior of general IFP-operators. |
|---|---|
| AbstractList | —
The article investigates the safety of unary inflationary fixed point operators (IFP-operators), i.e., their computability in finitely many steps. Such operators correspond exactly to recursive SQL queries. Therefore, the problem under investigation is directly related to database theory. The problem arises from the fact that if recursion and universe relations, e.g., addition, are simultaneously used in a SQL query, then a query evaluation can fall into an infinite loop. Moreover, such a combination makes it possible to model a universal computing device, e.g., a Turing machine. Hence, the problem of finite computability for such SQL queries is undecidable. In our previous works, we established some properties of a universe those guarantee the finite computability of any IFP-operator in the universe. In this article, we investigate a connection between an arity of IFP-operators and their safety. The main result of this article is that some results for general IFP-operators do not hold for unary ones. An instance of a universe is constructed in which all unnested unary IFP-operators are safe. However, there are unsafe binary IFP-operators in this universe. Therefore, IFP-operators can become unsafe if the arity changes. In addition, there are unsafe nested unary operators. This contrasts with the general case in which this is impossible. There are also elementary equivalent universes where the same unary IFP-operators are unsafe. This behavior is also different from the behavior of general IFP-operators. Abstract—The article investigates the safety of unary inflationary fixed point operators (IFP-operators), i.e., their computability in finitely many steps. Such operators correspond exactly to recursive SQL queries. Therefore, the problem under investigation is directly related to database theory. The problem arises from the fact that if recursion and universe relations, e.g., addition, are simultaneously used in a SQL query, then a query evaluation can fall into an infinite loop. Moreover, such a combination makes it possible to model a universal computing device, e.g., a Turing machine. Hence, the problem of finite computability for such SQL queries is undecidable. In our previous works, we established some properties of a universe those guarantee the finite computability of any IFP-operator in the universe. In this article, we investigate a connection between an arity of IFP-operators and their safety. The main result of this article is that some results for general IFP-operators do not hold for unary ones. An instance of a universe is constructed in which all unnested unary IFP-operators are safe. However, there are unsafe binary IFP-operators in this universe. Therefore, IFP-operators can become unsafe if the arity changes. In addition, there are unsafe nested unary operators. This contrasts with the general case in which this is impossible. There are also elementary equivalent universes where the same unary IFP-operators are unsafe. This behavior is also different from the behavior of general IFP-operators. |
| Author | Dudakov, S. M. |
| Author_xml | – sequence: 1 givenname: S. M. surname: Dudakov fullname: Dudakov, S. M. email: sergeydudakov@yandex.ru organization: Tver State University |
| BookMark | eNp9kE1LAzEQhoNUsK3-AG8Lnldnks1ucpRitVCs0AreluxuIltqUpP00H9vagVB0dPM8L7PfI3IwDqrCblEuGYI7GYJWJQFYokSKgBWnJAhci5yBPEyIMODnB_0MzIKYQ2QNFEOSb6w2VIZHfeZM9mzVX6fKdtlj87uPovZ9ClbbLVX0flwTk6N2gR98RXHZDW9W00e8vnifja5nectK2XMadVoKjU2CA3t2o7xpkopk9Kg4Y0BRZkWgtGi5LwB0SnNtCql6ajismVjcnVsu_XufadDrNdu522aWFNWIVZQCJZc1dHVeheC16Zu-6hi72z0qt_UCPXhNfWv1yQSf5Bb37-la_9l6JEJyWtftf_e6W_oA20kc_c |
| CitedBy_id | crossref_primary_10_1088_1742_6596_1902_1_012085 |
| Cites_doi | 10.1134/S1995080215040022 10.1016/0168-0072(86)90055-2 10.1006/jcss.1995.1051 |
| ContentType | Journal Article |
| Copyright | Allerton Press, Inc. 2019 2019© Allerton Press, Inc. 2019 |
| Copyright_xml | – notice: Allerton Press, Inc. 2019 – notice: 2019© Allerton Press, Inc. 2019 |
| DBID | AAYXX CITATION JQ2 |
| DOI | 10.3103/S0146411619070034 |
| DatabaseName | CrossRef ProQuest Computer Science Collection |
| DatabaseTitle | CrossRef ProQuest Computer Science Collection |
| DatabaseTitleList | ProQuest Computer Science Collection |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1558-108X |
| EndPage | 688 |
| ExternalDocumentID | 10_3103_S0146411619070034 |
| GroupedDBID | -59 -5G -BR -EM -Y2 -~C -~X .86 .VR 06D 0R~ 0VY 1N0 23N 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 2~H 30V 4.4 408 40D 40E 5GY 5VS 6NX 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABDZT ABECU ABFTD ABFTV ABHQN ABJNI ABJOX ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACCUX ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADRFC ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AEOHA AEPYU AETLH AEVLU AEXYK AFBBN AFFNX AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ AXYYD B-. BA0 BDATZ BGNMA CAG COF CS3 DDRTE DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 H13 HF~ HG6 HLICF HMJXF HRMNR HZ~ IJ- IKXTQ IWAJR I~X I~Z J-C JBSCW JZLTJ KOV LLZTM M4Y MA- NPVJJ NQJWS NU0 O9- O93 O9J P9O PF0 PT4 QOS R89 R9I RNS ROL RPX RSV S16 S1Z S27 S3B SAP SCO SDH SHX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TN5 TSG TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 W48 WK8 XU3 YLTOR Z7R Z83 Z88 ZMTXR ~A9 AAPKM AAYXX ABDBE ABFSG ABJCF ABRTQ ACSTC AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AHPBZ AHWEU AIXLP ARAPS ATHPR BENPR BGLVJ CCPQU CITATION HCIFZ K7- M7S PHGZM PHGZT PQGLB PTHSS JQ2 |
| ID | FETCH-LOGICAL-c369t-27be29e1b10b2dcd35b710b399f1f5bf0a23e88324655b08dae3ea69fd2a59c3 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000519474100011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0146-4116 |
| IngestDate | Wed Sep 17 23:58:55 EDT 2025 Sat Nov 29 05:52:09 EST 2025 Tue Nov 18 20:42:49 EST 2025 Fri Feb 21 02:36:34 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Keywords | arity inflationary fixed point safety |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c369t-27be29e1b10b2dcd35b710b399f1f5bf0a23e88324655b08dae3ea69fd2a59c3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2371170483 |
| PQPubID | 2043879 |
| PageCount | 6 |
| ParticipantIDs | proquest_journals_2371170483 crossref_citationtrail_10_3103_S0146411619070034 crossref_primary_10_3103_S0146411619070034 springer_journals_10_3103_S0146411619070034 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-12-01 |
| PublicationDateYYYYMMDD | 2019-12-01 |
| PublicationDate_xml | – month: 12 year: 2019 text: 2019-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Moscow |
| PublicationPlace_xml | – name: Moscow – name: New York |
| PublicationTitle | Automatic control and computer sciences |
| PublicationTitleAbbrev | Aut. Control Comp. Sci |
| PublicationYear | 2019 |
| Publisher | Pleiades Publishing Springer Nature B.V |
| Publisher_xml | – name: Pleiades Publishing – name: Springer Nature B.V |
| References | KanellakisP.KuperG.ReveszP.Constraint query languagesJ. Comput. Syst. Sci.1995512652134794210.1006/jcss.1995.1051 Dudakov S.M., On safety of IFP-operators and recursive queries, Vestn. Tversk. Gos. Univ., Ser.: Prikl. Mat., 2013, no. 2, pp. 5–13. MarkerD.Model Theory: An Introduction2002New YorkSpringer-Verlag1003.03034 CoddE.F.Relational completeness of data base sublanguages, in Database Systems1972 GurevichY.ShelahS.Fixed-point extensions of first-order logicAnn. Pure Appl. Logic19863226528086599210.1016/0168-0072(86)90055-2 DudakovS.M.On inflationary fix-point operators safetyLobachevskii J. Math.201536328331343119110.1134/S1995080215040022 Dudakov S. M., On safety of recursive queries, Vestn. Tversk. Gos. Univ., Ser.: Prikl. Mat., 2012, no. 4, pp. 71–80. S.M. Dudakov (7169_CR4) 2015; 36 Y. Gurevich (7169_CR5) 1986; 32 7169_CR3 7169_CR2 E.F. Codd (7169_CR1) 1972 D. Marker (7169_CR7) 2002 P. Kanellakis (7169_CR6) 1995; 51 |
| References_xml | – reference: Dudakov S.M., On safety of IFP-operators and recursive queries, Vestn. Tversk. Gos. Univ., Ser.: Prikl. Mat., 2013, no. 2, pp. 5–13. – reference: KanellakisP.KuperG.ReveszP.Constraint query languagesJ. Comput. Syst. Sci.1995512652134794210.1006/jcss.1995.1051 – reference: GurevichY.ShelahS.Fixed-point extensions of first-order logicAnn. Pure Appl. Logic19863226528086599210.1016/0168-0072(86)90055-2 – reference: MarkerD.Model Theory: An Introduction2002New YorkSpringer-Verlag1003.03034 – reference: CoddE.F.Relational completeness of data base sublanguages, in Database Systems1972 – reference: DudakovS.M.On inflationary fix-point operators safetyLobachevskii J. Math.201536328331343119110.1134/S1995080215040022 – reference: Dudakov S. M., On safety of recursive queries, Vestn. Tversk. Gos. Univ., Ser.: Prikl. Mat., 2012, no. 4, pp. 71–80. – volume: 36 start-page: 328 year: 2015 ident: 7169_CR4 publication-title: Lobachevskii J. Math. doi: 10.1134/S1995080215040022 – volume: 32 start-page: 265 year: 1986 ident: 7169_CR5 publication-title: Ann. Pure Appl. Logic doi: 10.1016/0168-0072(86)90055-2 – ident: 7169_CR2 – volume-title: Model Theory: An Introduction year: 2002 ident: 7169_CR7 – ident: 7169_CR3 – volume-title: Relational completeness of data base sublanguages, in Database Systems year: 1972 ident: 7169_CR1 – volume: 51 start-page: 26 year: 1995 ident: 7169_CR6 publication-title: J. Comput. Syst. Sci. doi: 10.1006/jcss.1995.1051 |
| SSID | ssj0055886 |
| Score | 2.1151848 |
| Snippet | —
The article investigates the safety of unary inflationary fixed point operators (IFP-operators), i.e., their computability in finitely many steps. Such... Abstract—The article investigates the safety of unary inflationary fixed point operators (IFP-operators), i.e., their computability in finitely many steps.... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 683 |
| SubjectTerms | Computer Science Control Structures and Microprogramming Fixed points (mathematics) Investigations Operators Queries Query languages Safety Turing machines Universe |
| Title | On Safety of Unary and Nonunary IFP Operators |
| URI | https://link.springer.com/article/10.3103/S0146411619070034 https://www.proquest.com/docview/2371170483 |
| Volume | 53 |
| WOSCitedRecordID | wos000519474100011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1558-108X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0055886 issn: 0146-4116 databaseCode: RSV dateStart: 20070201 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PS8MwFH7o9KAHp1NxOiUHT0qxbdImPYo4FGQbbspuJUkTEKQbWyf435ukrb8V9Fj6GkqSl_c93sv3ARybEGJQe5Z4OOLYI7HBcJwQ6YXMkZ_TKNROteSG9npsPE4G1T3ued3tXpck3Unt8kofn9k2pJgEBqGYfM7SqizDiol2zOo13A7v6-M3ipiTd7TWnjUvS5nfD_ExGL0hzE9FURdrus1__eUmbFTQEp2Xe2ELllTegmYt24AqL27B-jsOwm3w-jkacq2KZzTR6M7ezkU8z1Bvki_cw3V3gPpT5crx8x0YdS9HF1depaHgSRwnhRdSocJEBSLwRZjJDEfCYAphYIkOdCS0z0OsmHFry6MmfJZxhRWPE52FPEok3oVGPsnVHiCCY0V9QaXAnGghGCZCBkwRSn1usrY2-PVcprLiF7cyF4-pyTPs3KRf5qYNJ6-fTEtyjd-MO_UCpZWfzdMQUyudQxhuw2m9IG-vfxxs_0_WB7BmcFJSdrF0oFHMFuoQVuVT8TCfHbnt9wITzs0M |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fS8MwED50CuqD06k4nZoHn5Ri26S_HkUcG85uuCl7K0mbgCDdWDvB_94kbZ2_QR9Lr6Ekudx33OX7AE5lCJGoPQkM7FBsEFdiOEpIbNi-Jj_3HFto1ZKeF4b-eBwMynvcWdXtXpUk9Umt80oTX6g2JJdYEqHIfE7RqizDCpEBSxHm3w0fquPXcXwt76isDWVelDK_H-JjMFogzE9FUR1r2vV__eUWbJbQEl0We2EblnjagHol24BKL27AxjsOwh0w-ikaUsHzFzQR6F7dzkU0TVA4Sef6odseoP6U63J8tguj9vXoqmOUGgpGjN0gN2yPcTvgFrNMZidxgh0mMQWTsERYwmHCpDbmvnRrxaPGTD-hHHPqBiKxqRPEeA9q6STl-4AIdrlnMi9mmBLBmI8Jiy2fE88zqczammBWcxnFJb-4krl4imSeoeYm-jI3TTh7-2RakGv8ZtyqFigq_SyLbOwp6Rzi4yacVwuyeP3jYAd_sj6Btc7othf1uuHNIaxLzBQUHS0tqOWzOT-C1fg5f8xmx3orvgK5oM_w |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fS8MwED50iuiD06k4nZoHn5Sytkmb9lHU4nB0g03ZW0naBATpxtoJ_vcm_eFvBfGx9BJKkut9x12-D-BUhRCF2hPfwA7DBnEVhmOExIbtFeTn1LFloVrSp2HoTSb-sNI5zepu97okWd5p0CxNad6dJbJb5Jgm7uqWJJdYCq2o3E5TrCzDCtF99DpdH93Xv2LH8QqpR21taPOyrPn9FB8D0xva_FQgLeJO0Pz3F2_BZgU50UV5RrZhSaQtaNZyDqjy7hZsvOMm3AFjkKIRkyJ_RlOJ7vStXcTSBIXTdFE89IIhGsxEUabPdmEcXI8vb4xKW8GIsevnhk25sH1hccvkdhIn2OEKa3AFV6QlHS5NZmPhKXfX_Grc9BImsGCuLxObOX6M96CRTlOxD4hgV1CT05hjRiTnHiY8tjxBKDWZyubaYNbrGsUV77iWv3iMVP6h1yb6sjZtOHsdMitJN34z7tSbFVX-l0U2plpSh3i4Def15ry9_nGygz9Zn8Da8CqI-r3w9hDWFZTyy0aXDjTy-UIcwWr8lD9k8-PiVL4ACp_Y1A |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+Safety+of+Unary+and+Nonunary+IFP+Operators&rft.jtitle=Automatic+control+and+computer+sciences&rft.au=Dudakov%2C+S.+M.&rft.date=2019-12-01&rft.issn=0146-4116&rft.eissn=1558-108X&rft.volume=53&rft.issue=7&rft.spage=683&rft.epage=688&rft_id=info:doi/10.3103%2FS0146411619070034&rft.externalDBID=n%2Fa&rft.externalDocID=10_3103_S0146411619070034 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0146-4116&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0146-4116&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0146-4116&client=summon |