Tractable recursion over geometric data: (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1330, Issue , 1997, Pages 450-462

  Grumbach, Stéphane ^a   Kuper, Gabriel ^b  

^a INRIA   (France)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; POLYNOMIAL APPROXIMATION;

COMPUTABLE QUERY; EXTENDED ABSTRACTS; GEOMETRIC OPERATIONS; INFLATIONARY FIXPOINT; LINEAR CONSTRAINTS; LOGICAL CHARACTERIZATION; RECURSION OPERATORS; SPATIAL DATABASE;

QUERY LANGUAGES;

EID: 84948985438     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (12)

1. [AHV94] S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1994.
2. [DGVG97] F. Dumortier, M. Gyssens, L. Vandeurzen, and D. Van Gucht. On the decidability of semi-linearity for semi-algebraic sets and its implications for spatial databases. In Proc. ACM Symp. on Principles of Database Systems, 1997.
3. [GS97] S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173(1):151-181, 1997.
4. [GST94] S. Grumbach, J. Su, and C. Tollu. Linear constraint query languages: Expressive power and complexity. In D. Leivant, editor, Logic and Computational Complexity, Indianapolis, 1994. Springer Verlag. LNCS 960.
5. [Gue94] R. Gueting. An Introduction to Spatial Database Systems. The VLDB Journal, 3(4), 1994.
6. [Gur88] Y. Gurevich. Current Trends in Theoretical Computer Science, E. Borger Ed., chapter Logic and the Challenge of Computer Science, pages 1-57. Computer Science Press, 1988.
7. [Imm86] N. Immerman. Relational queries computable in polynomial time. Inf. and Control, 68:86-104, 1986.
8. [KKR90] P. Kanellakis, G Kuper, and P. Revesz. Constraint query languages. In Proc. 9th ACM Symp. on Principles of Database Systems, pages 299-313, Nashville, 1990.
9. [PVV95] J. Paredaens, J. Van den Bussche, and D. Van Gucht. First-order queries on finite structures over the reals. In Proceedings 10th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1995.
10. [Var82] M. Vardi. The complexity of relational query languages. In Proc. 14th ACM Symp. on Theory of Computing, pages 137-146, 1982.
11. [VGV95] L. Vandeurzen, M. Gyssens, and D. Van Gucht. On the desirability and limitations of linear spatial database models. In Advances in Spatial Databases, 4th Int. Symp., SSD'95, pages 14-28. Springer, 1995.
12. [Whi57] H. Whitney. Elementary structure of real algebraic varieties. Annals of Mathematics, 66:545-556, 1957.