Dense-Order Constraint Databases (Extended Abstract)
Summary: Finite representations of infinite databases via dense-order constraints; study query languages (order, addition, recursion, nested sets) and give an exact PTIME characterization (data complexity) of computable dense-order queries. Show limitations—region and graph connectivity not definable with linear constraints—and extend to complex-object constraint databases under active-domain semantics, proving expressive-power and complexity profiles similar to the classical complex-object calculus. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Stéphane Grumbach (INRIA; University of Toronto)
- 2. Jianwen Su (University of California Santa Barbara)
BibTeX Citation
@inproceedings{grumbach_pods95,
address = {New York, NY, USA},
series = {{PODS} '95},
title = {{Dense-Order Constraint Databases (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/212433.212453},
doi = {10.1145/212433.212453},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Grumbach, Stéphane and Su, Jianwen},
year = {1995}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,771 | Topological Queries in Spatial Databases | 1996 | PODS | 7.0297786e-05 |
| 4,110 | Linear vs. Order Constraint Queries Over Rational Databases (Extended Abstract) | 1996 | PODS | 6.8008012e-05 |
| 5,841 | On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract) | 1997 | PODS | 5.9735439e-05 |
| 8,726 | Towards Practical Constraint Databases (Extended Abstract) | 1996 | PODS | 5.2905577e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 140 | Remarks on the Algebra of Non First Normal Form Relations | 1982 | PODS | 0.00029346895 |
| 914 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00013104061 |
| 1,512 | Towards a Theory of Spatial Database Queries (Extended Abstract) | 1994 | PODS | 0.00010429539 |
| 2,292 | Finitely Representable Databases | 1994 | PODS | 8.6854411e-05 |
| 3,046 | Tractable Query Languages for Complex Object Databases | 1991 | PODS | 7.7144804e-05 |
| 3,667 | The LyriC Language: Querying Constraint Objects | 1995 | SIGMOD | 7.1163605e-05 |
| 4,230 | Completeness Results for Recursive Data Bases | 1993 | PODS | 6.7161738e-05 |
| 5,170 | Toward Practical Constraint Databases | 1993 | VLDB | 6.2448851e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,919 | The Expressiveness of a Family of Finite Set Languages | 1991 | PODS |
| 2 | 421 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 3 | 4,110 | Linear vs. Order Constraint Queries Over Rational Databases (Extended Abstract) | 1996 | PODS |
| 4 | 5,841 | On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract) | 1997 | PODS |
| 5 | 3,183 | On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions | 1989 | SIGMOD |
| 6 | 1,950 | Relational Expressive Power of Constraint Query Languages | 1996 | PODS |
| 7 | 3,046 | Tractable Query Languages for Complex Object Databases | 1991 | PODS |
| 8 | 642 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 9 | 8,726 | Towards Practical Constraint Databases (Extended Abstract) | 1996 | PODS |
| 10 | 13,165 | Fixed-Point Query Languages for Linear Constraint Databases | 2000 | PODS |