{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:00:58Z","timestamp":1787500858177,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440802","type":"print"},{"value":"9783540460930","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46093-4_11","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T01:02:51Z","timestamp":1179190971000},"page":"182-197","source":"Crossref","is-referenced-by-count":3,"title":["Linear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrary Dimension"],"prefix":"10.1007","author":[{"given":"Floris","family":"Geerts","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"11_CR1","volume-title":"Real Algebraic and Semi-algebraic Sets","author":"R. Benedetti","year":"1990","unstructured":"R. Benedetti and J.J. Risler. Real Algebraic and Semi-algebraic Sets. Hermann, Paris, 1990."},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/273865.273870","volume":"45","author":"M. Benedikt","year":"1998","unstructured":"M. Benedikt, G. Dong, L. Libkin, and L. Wong. Relational expressive power of constraint query languages. Journal of the ACM, 45(1):1\u201334, 1998.","journal-title":"Journal of the ACM"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"M. Benedikt, M. Grohe, L. Libkin, and L. Segoufin. Reachability and connectivity queries in constraint databases. In Proceedings of the 19th ACM Symposium on Principles of Database Systems, pages 104\u2013115. ACM Press, 2000.","DOI":"10.1145\/335168.335213"},{"issue":"5","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1137\/S0097539798342484","volume":"29","author":"M. Benedikt","year":"2000","unstructured":"M. Benedikt and L. Libkin. Safe constraint queries. SIAM Journal of Computing, 29(5):1652\u20131682, 2000.","journal-title":"SIAM Journal of Computing"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"J. Bochnak, M. Coste, and M.-F. Roy. Real Algebraic Geometry, volume 36 of Ergebenisse der Mathematik und ihrer Grenzgebiete. Springer-Verlag, 1998.","DOI":"10.1007\/978-3-662-03718-8"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","volume":"21","author":"A. Chandra","year":"1980","unstructured":"A. Chandra and D. Harel. Computable queries for relational data bases. Journal of Computer and System Sciences, 21(2):156\u2013178, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-44543-9_14","volume-title":"Research Issues in Structured and Semistructured Database Programming. Proceedings of the 8th International Workshop on Database Programming Languages","author":"F. Geerts","year":"1999","unstructured":"F. Geerts and B. Kuijpers. Expressing topological connectivity of spatial databases. In Research Issues in Structured and Semistructured Database Programming. Proceedings of the 8th International Workshop on Database Programming Languages, volume 1949 of Lecture Notes in Computer Science, pages 224\u2013238. Springer-Verlag, 1999."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"F. Geerts and B. Kuijpers. Linear approximation of planar spatial databases using transitive-closure logic. In Proceedings of the 19th ACM Symposium on Principles of Database Systems, pages 126\u2013135. ACM Press, 2000.","DOI":"10.1145\/335168.335215"},{"key":"11_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/BFb0017459","volume-title":"Proceedings of the 3rd Conference on Principles and Practice of Constraint Programming","author":"S. Grumbach","year":"1997","unstructured":"S. Grumbach and G. Kuper. Tractable recursion over geometric data. In G. Smolka, editor, Proceedings of the 3rd Conference on Principles and Practice of Constraint Programming, volume 1330 of Lecture Notes in Computer Science, pages 450\u2013462. Springer-Verlag, 1997."},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1006\/jcss.1997.1524","volume":"55","author":"S. Grumbach","year":"1997","unstructured":"S. Grumbach and J. Su. Finitely representable databases. Journal of Computer and System Sciences, 55(2):273\u2013298, 1997.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(96)00194-6","volume":"173","author":"S. Grumbach","year":"1997","unstructured":"S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173(1):151\u2013181, 1997.","journal-title":"Theoretical Computer Science"},{"key":"11_CR12","unstructured":"V. Guillemin and A. Pollack. Differential topology. Prentice-Hall, 1974."},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1006\/jcss.1999.1630","volume":"58","author":"M. Gyssens","year":"1999","unstructured":"M. Gyssens, J. Van den Bussche, and D. Van Gucht. Complete geometrical query languages. Journal of Computer and System Sciences, 58(1):483\u2013511, 1999.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jcss.1995.1051","volume":"51","author":"P.C. Kanellakis","year":"1995","unstructured":"P.C. Kanellakis, G.M. Kuper, and P.Z. Revesz. Constraint query languages. Journal of Computer and System Science, 51(1):26\u201352, 1995.","journal-title":"Journal of Computer and System Science"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"S. Kreutzer. Fixed-point query languages for linear constraint databases. In Proceedings of the 19th ACM Symposium on Principles of Database Systems, pages 116\u2013125. ACM Press, 2000.","DOI":"10.1145\/335168.335214"},{"key":"11_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-44503-X_17","volume-title":"Proceedings of the 9th International Conference on Database Theory","author":"S. Kreutzer","year":"2001","unstructured":"S. Kreutzer. Query languages for constraint databases: First-order logic, fixed-points, and convex hulls. In J. Van den Bussche and V. Vianu, editors, Proceedings of the 9th International Conference on Database Theory, volume 1973 of Lecture Notes in Computer Science, pages 248\u2013262. Springer-Verlag, 2001."},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"G.M. Kuper, J. Paredaens, and L. Libkin, editors. Constraint Databases. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-662-04031-7"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/PL00009335","volume":"19","author":"E. Rannou","year":"1998","unstructured":"E. Rannou. The complexity of stratification computation. Discrete and Computational Geometry, 19:47\u201379, 1998.","journal-title":"Discrete and Computational Geometry"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"M. Shiota. Geometry of Subanalytic and Semialgebraic Sets. Birkh\u00e4user, 1997.","DOI":"10.1007\/978-1-4612-2008-4"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"L. Vandeurzen, M. Gyssens, and D. Van Gucht. An expressive language for linear spatial database queries. In Proceedings of the 17th ACM Symposium on Principles of Database Systems, pages 109\u2013118. ACM Press, 1998.","DOI":"10.1145\/275487.275500"},{"key":"11_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/3-540-61551-2_94","volume-title":"Proceedings of the 2nd Conference on Principles and Practice of Constraint Programming","author":"L. Vandeurzen","year":"1996","unstructured":"L. Vandeurzen, M. Gyssens, and D. Van Gucht. On query languages for linear queries definable with polynomial constraints. In E. F. Freuder, editor, Proceedings of the 2nd Conference on Principles and Practice of Constraint Programming, volume 1118 of Lecture Notes in Computer Science, pages 468\u2013481, Springer-Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Database Programming Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46093-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:22:00Z","timestamp":1556396520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46093-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440802","9783540460930"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-46093-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}