Approximating data in constraint databases

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Approximate representation of any spatio-temporal variable, by some interpolation function, is necessary when it is measured only sporadically. This paper argues that the approximate representation can be captured by a constraint database. Since constraint databases can be queried via standard query languages - such as relational algebra, SQL and Datalog - this provides an immediate benefit for flexible querying of the data. We propose a concrete system that implements a version of this approach. We also add beyond the standard queries new ones like cartogram similarity queries and an advanced graphical user interface with 3-D animation of GIS-based data. © 2000 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Chen, R., Ouyang, M., & Revesz, P. Z. (2000). Approximating data in constraint databases. Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), 1864, 124–143. https://doi.org/10.1007/3-540-44914-0_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free