ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Dense-Order Constraint Databases.

Stéphane Grumbach, Jianwen Su: Dense-Order Constraint Databases. PODS 1995: 66-77
@inproceedings{DBLP:conf/pods/GrumbachS95,
  author    = {St{\'e}phane Grumbach and
               Jianwen Su},
  title     = {Dense-Order Constraint Databases},
  booktitle = {Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium
               on Principles of Database Systems, May 22-25, 1995, San Jose,
               California},
  publisher = {ACM Press},
  year      = {1995},
  isbn      = {0-89791-730-8},
  pages     = {66-77},
  ee        = {http://doi.acm.org/10.1145/212433.212453, db/conf/pods/GrumbachS95.html},
  crossref  = {DBLP:conf/pods/95},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

We consider infinite databases which admit a finite representation in terms of dense-order constraints. We study the complexity and the expressive power of various query languages over dense order constraint databases, allowing order, addition, recursion, or nested sets. We provide in particular an exact characterization of the class of dense order queries computable in PTIME (data complexity). We also prove that region and graph connectivity queries are not definable with linear constraints. We then investigate complex object models for constraint databases. Complex objects are fundamental to deal with pointsets as first-class citizens. We introduce an active domain semantics, and show that in terms of complexity and expressive power, the characterizations of the calculus for constraint complex objects are similar to the case of the classical complex object calculus.

Copyright © 1995 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98. and ... Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings. and ... BibTeX

Printed Edition

Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 22-25, 1995, San Jose, California. ACM Press 1995, ISBN 0-89791-730-8
Contents BibTeX

Online Edition: ACM Digital Library

[Index Terms]
[Full Text in PDF Format, 1098 KB]

References

[AB87]
Serge Abiteboul, Catriel Beeri: The Power of Languages for the Manipulation of Complex Values. VLDB J. 4(4): 727-794(1995) BibTeX
[ACGK94]
...
[AV89]
Serge Abiteboul, Victor Vianu: Fixpoint Extensions of First-Order Logic and Datalog-Like Languages. LICS 1989: 71-79 BibTeX
[BJM93]
Alexander Brodsky, Joxan Jaffar, Michael J. Maher: Toward Practical Constraint Databases. VLDB 1993: 567-580 BibTeX
[BK95]
Alexander Brodsky, Yoram Kornatzky: The LyriC Language: Querying Constraint Objects. SIGMOD Conference 1995: 35-46 BibTeX
[CH80]
Ashok K. Chandra, David Harel: Computable Queries for Relational Data Bases. J. Comput. Syst. Sci. 21(2): 156-178(1980) BibTeX
[CK73]
...
[Cod70]
E. F. Codd: A Relational Model of Data for Large Shared Data Banks. Commun. ACM 13(6): 377-387(1970) BibTeX
[Col75]
...
[Dri82]
...
[FSS84]
Merrick L. Furst, James B. Saxe, Michael Sipser: Parity, Circuits, and the Polynomial-Time Hierarchy. Mathematical Systems Theory 17(1): 13-27(1984) BibTeX
[FT83]
...
[GJ79]
M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX
[GS86]
...
[GS94]
Stéphane Grumbach, Jianwen Su: Finitely Representable Databases. PODS 1994: 289-300 BibTeX
[GST95]
Stéphane Grumbach, Jianwen Su, Christophe Tollu: Linear Constraint Query Languages: Expressive Power and Complexity. LCC 1994: 426-446 BibTeX
[GV91]
Stéphane Grumbach, Victor Vianu: Tractable Query Languages for Complex Object Databases. PODS 1991: 315-327 BibTeX
[HH93]
Tirza Hirst, David Harel: Completeness Results for Recursive Data Bases. PODS 1993: 244-252 BibTeX
[HS91]
Richard Hull, Jianwen Su: On the Expressive Power of Database Queries with Intermediate Types. J. Comput. Syst. Sci. 43(1): 219-267(1991) BibTeX
[HS93]
Richard Hull, Jianwen Su: Algebraic and Calculus Query Languages for Recursively Typed Complex Objects. J. Comput. Syst. Sci. 47(1): 121-156(1993) BibTeX
[Imm86]
Neil Immerman: Relational Queries Computable in Polynomial Time. Information and Control 68(1-3): 86-104(1986) BibTeX
[JS82]
Gerhard Jaeschke, Hans-Jörg Schek: Remarks on the Algebra of Non First Normal Form Relations. PODS 1982: 124-138 BibTeX
[KG94]
...
[KKR90]
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz: Constraint Query Languages. PODS 1990: 299-313 BibTeX
[Kup93]
Gabriel M. Kuper: Aggregation in Constraint Databases. PPCP 1993: 166-173 BibTeX
[KY85]
Dexter Kozen, Chee-Keng Yap: Algebraic Cell Decomposition in NC (Preliminary Version). FOCS 1985: 515-521 BibTeX
[PVV94]
Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht: Towards a Theory of Spatial Database Queries. PODS 1994: 279-288 BibTeX
[Rev93]
Peter Z. Revesz: A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints. Theor. Comput. Sci. 116(1&2): 117-149(1993) BibTeX
[Rev95]
Peter Z. Revesz: Datalog Queries of Set Constraint Databases. ICDT 1995: 425-438 BibTeX
[RKS88]
Mark A. Roth, Henry F. Korth, Abraham Silberschatz: Extended Algebra and Calculus for Nested Relational Databases. ACM Trans. Database Syst. 13(4): 389-417(1988) BibTeX
[SRR94]
Divesh Srivastava, Raghu Ramakrishnan, Peter Z. Revesz: Constraint Objects. PPCP 1994: 218-228 BibTeX
[SRS94]
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan: Foundations of Aggregation Constraints. PPCP 1994: 193-204 BibTeX
[Tar51]
...
[Var82]
...

Referenced by

  1. Xun Cheng, Guozhu Dong, Tzekwan Lau, Jianwen Su: Data Integration by Describing Sources with Constraint Databases. ICDE 1999: 374-381
  2. Peter Z. Revesz: Safe Query Languages for Constraint Databases. ACM Trans. Database Syst. 23(1): 58-99(1998)
  3. Alberto Belussi, Elisa Bertino, Barbara Catania: An Extended Algebra for Constraint Databases. IEEE Trans. Knowl. Data Eng. 10(5): 686-705(1998)
  4. Oscar H. Ibarra, Jianwen Su: On the Containment and Equivalence of Database Queries with Linear Constraints. PODS 1997: 32-43
  5. Stéphane Grumbach, Philippe Rigaux, Michel Scholl, Luc Segoufin: DEDALE, A Spatial Constraint Database. DBPL 1997: 38-59
  6. Alexei P. Stolboushkin, Michael A. Taitslin: Linear vs. Order Contstrained Queries Over Rational Databases. PODS 1996: 17-27
  7. Christos H. Papadimitriou, Dan Suciu, Victor Vianu: Topological Queries in Spatial Databases. PODS 1996: 81-92
  8. Stéphane Grumbach, Jianwen Su: Towards Practical Constraint Databases. PODS 1996: 28-39
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:34:12 2009