Skip to main content
SpringerLink
Log in

Linear Versus Polynomial Constraint Databases

  • Reference work entry
  • First Online:
Encyclopedia of GIS

  • 93 Accesses

Synonyms

Constraint database systems; Constraint query languages; First-order logic with constraint queries; Infinite relational databases; Linear constraint databases; Moving object constraint databases; Spatiotemporal constraint databases

Definition

The framework of constraint databases provides a rather general model for spatial databases (Paredaens et al. 1994). In the constraint model, a spatial database contains a finite number of relations that are represented as a finite union of systems of polynomial equations and inequalities, although conceptually viewed as possibly infinite sets of points in the real space.

More specifically, in the polynomial constraint database model, a relation is defined as a boolean combination (union, intersection, complement) of subsets of some real space Rn (in applications, typically n = 2 or 3) that are definable by polynomial constraints of the form p(x1, …, x n ) ≥ 0, where p is a polynomial in the real variables x1, …, x n with integer...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Afrati F, Cosmadakis S, Grumbach S, Kuper G (1994) Linear versus polynomial constraints in database query languages. In: Borning A (ed) Proceedings of the 2nd workshop on principles and practice of constraint programming. Lecture notes in computer science, vol 874. Springer, Berlin/New York, pp 181–192

    Google Scholar 

  • Benedikt M, Dong G, Libkin L, Wong L (1998) Relational expressive power of constraint query languages. J ACM 45(1):1–34

    Article  MathSciNet  MATH  Google Scholar 

  • Benedikt M, Keisler HJ (2000) Definability over linear constraints. In: Clote P, Schwichtenberg H (eds) Proceedings of computer science logic, 14th annual conference of the EACSL. Lecture notes in computer science, vol 1862. Springer, Berlin, pp 217–231

    Google Scholar 

  • Bochnak J, Coste M, Roy M-F (1987) Géométrie algébrique réelle. Springer, Berlin

    MATH  Google Scholar 

  • de Berg M, van Kreveld M, Overmars M, Schwarzkopf O (2000) Computational geometry: algorithms and applications. Springer, Berlin/New York

    Book  MATH  Google Scholar 

  • Grumbach S (1997) Implementing linear constraint databases. In: Gaede V, Brodsky A, Günther O, Srivastava D, Vianu V, Wallace M (eds) Proceedings of the 2nd workshop on constraint databases and applications. Lecture notes in computer science, vol 1191. Springer, Berlin/New York, pp 105–115

    Google Scholar 

  • Grumbach S, Rigaux P, Scholl M, Segoufin L (1998) DEDALE, a spatial constraint database. In: Cluet S, Hull R (eds) Proceedings of the 6th international workshop on database programming languages (DBPL). Lecture notes in computer science, vol 1369. Estes Park, pp 38–59

    Google Scholar 

  • Grumbach S, Rigaux P, Segoufin L (1998) The DEDALE system for complex spatial queries. In: Proceedings of the 23th ACM international conference on management of data (SIGMOD). ACM Press, New York, pp 213–224

    Google Scholar 

  • Grumbach S, Su J, Tollu C (1995) Linear constraint query languages: expressive power and complexity. In: Leivant D (ed) Logic and computational complexity. Lecture notes in computer science, vol 960. Springer, Berlin, pp 426–446

    Chapter  Google Scholar 

  • Haesevoets S (2005) Modelling and querying spatio-temporal data. Ph.D. thesis, Limburgs Universitair Centrum

    Google Scholar 

  • Kanellakis PC, Kuper G, Revesz PZ (1995) Constraint query languages. J Comput Syst Sci 51:26–52

    Article  MathSciNet  Google Scholar 

  • Kuper GM, Libkin L, Paredaens J (eds) (2000) Constraint databases. Springer, Berlin/New York

    MATH  Google Scholar 

  • Paredaens J, Van den Bussche J, Van Gucht D (1994) Towards a theory of spatial database queries. In: Proceedings of the 13th ACM symposium on principles of database systems, Minneapolis, pp 279–288

    Google Scholar 

  • Paredaens J, Van den Bussche J, Van Gucht D (1998) First-order queries on finite structures over the reals. SIAM J Comput 27(6):1747–1763

    Article  MathSciNet  MATH  Google Scholar 

  • Revesz P, Chen R, Kanjamala P, Li Y, Liu Y, Wang Y (2000) The mlpq/gis constraint database system. In: Proceedings of the ACM-SIGMOD international conference on management of data (SIGMOD). ACM Press, New York, p 601

    Google Scholar 

  • Revesz P, Li Y (1997) Mlpq: a linear constraint database system with aggregate operators. In: Proceedings of the 1st international database engineering and applications symposium. IEEE Press, Piscataway, pp 132–137

    Google Scholar 

  • Revesz P, Wu S (2006) Spatiotemporal reasoning about epidemiological data. Artif Intell Med 38(2):157–170

    Article  Google Scholar 

  • Revesz P (2002) Introduction to constraint databases. Springer, New York

    MATH  Google Scholar 

  • Revesz P (2010) Introduction to databases: from biological to spatio-temporal. Springer, New York

    Book  MATH  Google Scholar 

  • Rigaux Ph, Scholl M, Voisard A (2000) Introduction to spatial databases: applications to GIS. Morgan Kaufmann, San Francisco

    Google Scholar 

  • Tarski A (1948) A decision method for elementary algebra and geometry. University of California Press, Berkeley

    MATH  Google Scholar 

  • Vandeurzen L (1999) Logic-based query languages for the linear constraint database model. Ph.D. thesis, Limburgs Universitair Centrum

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Databases and Theoretical Computer Science Research Group, Hasselt University and Transnational University of Limburg, Diepenbeek, Belgium

    Bart Kuijpers

Authors
  1. Bart Kuijpers
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bart Kuijpers .

Editor information

Editors and Affiliations

  1. University of Minnesota, Minneapolis, MN, USA

    Shashi Shekhar

  2. Management Science and Information Systems Department, Rutgers Business School, Rutgers, The State University of New Jersey, Newark, NJ, USA

    Hui Xiong

  3. Department of Management Sciences, Tippie College of Business, University of Iowa, Iowa City, IA, USA

    Xun Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Kuijpers, B. (2017). Linear Versus Polynomial Constraint Databases. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_696

Download citation

Publish with us

Policies and ethics

Search

Navigation