Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/49897
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBRIJDER, Robert-
dc.contributor.authorGILLIS, Joris-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.date.accessioned2026-08-26T13:46:10Z-
dc.date.available2026-08-26T13:46:10Z-
dc.date.issued2026-
dc.date.submitted2026-08-26T13:39:56Z-
dc.identifier.citationAcm Transactions on Database Systems, 51 (4) (Art N° 20)-
dc.identifier.urihttp://hdl.handle.net/1942/49897-
dc.description.abstractDNAQL is a query language for databases implemented as DNA molecules in solution, with well-known DNA wetlab procedures as operators. DNAQL focusses on faithful implementability in DNA, and, as a result, does not include powerful, but difficult to implement, features like nonterminating/recursive hybridization needed for general computation (i.e., Turing-completeness). In this article, we show that DNAQL is relationally complete, i.e., the full relational algebra can be performed by DNAQL programs.-
dc.description.sponsorshipAcknowledgments We thank the anonymous reviewers for their valuable comments on an earlier version of this article-
dc.language.isoen-
dc.publisherASSOC COMPUTING MACHINERY-
dc.rights2026 Copyright held by the owner/author(s). This work is licensed under a Creative Commons Attribution 4.0 International License.-
dc.subject.otherQuery languages-
dc.subject.otherCCS Concepts: • Information systems → Relational database query languages-
dc.subject.other• Hardware → Biology- related information processing-
dc.subject.othermolecular computing-
dc.subject.other• Theory of computation → Models of computation-
dc.subject.otherrelational algebra-
dc.subject.otherAdditional Key Words and Phrases: Query languages, molecular computing, relational algebra, DNA computing, relational completeness-
dc.subject.otherDNA computing-
dc.subject.otherrelational completeness-
dc.titleThe Relational Completeness of the DNA Query Language DNAQL-
dc.typeJournal Contribution-
dc.identifier.issue4-
dc.identifier.volume51-
local.format.pages30-
local.bibliographicCitation.jcatA1-
dc.description.notesBrijder, R (corresponding author), Eindhoven Univ Technol, M&CS Dept, Eindhoven, Netherlands.-
dc.description.notesr.brijder@tue.nl; joris.gillis@gmail.com; jan.vandenbussche@uhasselt.be-
local.publisher.place1601 Broadway, 10th Floor, NEW YORK, NY USA-
local.type.refereedRefereed-
local.type.specifiedArticle-
local.bibliographicCitation.artnr20-
dc.identifier.doi10.1145/3779650-
dc.identifier.isi001842592100001-
local.provider.typewosris-
local.description.affiliation[Brijder, Robert; Gillis, Joris] Eindhoven Univ Technol, M&CS Dept, Eindhoven, Netherlands.-
local.description.affiliation[van den Bussche, Jan] Hasselt Univ, Data Sci Inst, Hasselt, Belgium.-
local.uhasselt.internationalyes-
item.fulltextWith Fulltext-
item.fullcitationBRIJDER, Robert; GILLIS, Joris & VAN DEN BUSSCHE, Jan (2026) The Relational Completeness of the DNA Query Language DNAQL. In: Acm Transactions on Database Systems, 51 (4) (Art N° 20).-
item.contributorBRIJDER, Robert-
item.contributorGILLIS, Joris-
item.contributorVAN DEN BUSSCHE, Jan-
item.accessRightsOpen Access-
crisitem.journal.issn0362-5915-
crisitem.journal.eissn1557-4644-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
3779650.pdfPublished version445.57 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.