Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/683
Full metadata record
DC FieldValueLanguage
dc.contributor.authorOtto, M-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.date.accessioned2005-03-24T07:59:10Z-
dc.date.available2005-03-24T07:59:10Z-
dc.date.issued1996-
dc.identifier.citationInformation Processing Letters, 60 (1), p. 37-41-
dc.identifier.issn0020-0190-
dc.identifier.urihttp://hdl.handle.net/1942/683-
dc.description.abstractWe consider "generic" (isomorphism-invariant) queries on relational databases embedded in an infinite background structure. Assume a generic query is expressible by a first-order formula over the embedded domain that may involve both the relations of the database and the relations and functions of the background structure. Then this query is already expressible by a first-order formula involving just an auxiliary linear ordering as background structure. We present an elementary proof of this fact.-
dc.format.extent193625 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherElsevier Science Limited-
dc.titleFirst-order queries on databases embedded in an infinite structure-
dc.typeJournal Contribution-
dc.identifier.epage41-
dc.identifier.issue1-
dc.identifier.spage37-
dc.identifier.volume60-
local.type.specifiedArticle-
dc.bibliographicCitation.oldjcat-
dc.identifier.doi10.1016/S0020-0190(96)00140-8-
item.contributorOtto, M-
item.contributorVAN DEN BUSSCHE, Jan-
item.fullcitationOtto, M & VAN DEN BUSSCHE, Jan (1996) First-order queries on databases embedded in an infinite structure. In: Information Processing Letters, 60 (1), p. 37-41.-
item.accessRightsClosed Access-
item.fulltextWith Fulltext-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
databases_embedded.pdf189.09 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.