Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/723
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGEERTS, Floris-
dc.date.accessioned2005-04-14T09:42:52Z-
dc.date.available2005-04-14T09:42:52Z-
dc.date.issued2001-
dc.identifier.citationDATABASE PROGRAMMING LANGUAGES. p. 182-197.-
dc.identifier.isbn3-540-44080-1-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/1942/723-
dc.description.abstractWe consider n-dimensional semi-algebraic spatial databases. We compute in first-order logic extended with a transitive closure operator, a linear spatial database which characterizes the semi-algebraic spatial database up to a homeomorphism. In this way, we generalize our earlier results to semi-algebraic spatial databases in arbitrary dimensions, our earlier results being true for only two dimensions. Consequently, we can prove that first-order logic with a transitive closure operator extended with stop conditions, can express all Boolean topological queries on semi-algebraic spatial databases of arbitrary dimension.-
dc.format.extent213425 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherSpringer-
dc.relation.ispartofseriesLECTURE NOTES IN COMPUTER SCIENCE-
dc.titleLinear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrary Dimension-
dc.typeProceedings Paper-
local.bibliographicCitation.conferencenameDATABASE PROGRAMMING LANGUAGES-
dc.identifier.epage197-
dc.identifier.spage182-
local.bibliographicCitation.jcatC1-
local.type.refereedRefereed-
local.type.specifiedArticle-
local.relation.ispartofseriesnr2397-
dc.bibliographicCitation.oldjcatC1-
dc.identifier.doi10.1007/3-540-46093-4_11-
dc.identifier.isi000181438100011-
local.bibliographicCitation.btitleDATABASE PROGRAMMING LANGUAGES-
item.accessRightsClosed Access-
item.contributorGEERTS, Floris-
item.fullcitationGEERTS, Floris (2001) Linear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrary Dimension. In: DATABASE PROGRAMMING LANGUAGES. p. 182-197..-
item.fulltextWith Fulltext-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
linear.pdf208.42 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.