Measuring Infinite Relations (Extended Abstract)
Summary: Propose mu_n, an aggregation operator for constraint databases that measures infinite subsets of n‑dimensional space defined by linear constraints. mu_n is well‑defined for real linear arithmetic (and for integer linear with periodicity) and yields closure of relational algebra in the real case and, under certain restrictions, in the integer case. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jan Chomicki (Kansas State University)
- 2. Gabriel Kuper (European Computer-Industry Research Center)
BibTeX Citation
@inproceedings{chomicki_pods95,
address = {New York, NY, USA},
series = {{PODS} '95},
title = {{Measuring Infinite Relations (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/212433.212455},
doi = {10.1145/212433.212455},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Chomicki, Jan and Kuper, Gabriel},
year = {1995}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 914 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00013104061 |
| 4,242 | Variable Independence and Aggregation Closure | 1996 | PODS | 6.7070443e-05 |
| 4,640 | Exact and Approximate Aggregation in Constraint Query Languages | 1999 | PODS | 6.4903073e-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 |
|---|---|---|---|---|
| 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,152 | Querying Constraints | 1990 | PODS | 8.951621e-05 |
| 2,292 | Finitely Representable Databases | 1994 | PODS | 8.6854411e-05 |
| 2,937 | Pushing Constraint Selections | 1992 | PODS | 7.8356559e-05 |
| 4,438 | Handling Infinite Temporal Data | 1990 | PODS | 6.6000332e-05 |
| 5,170 | Toward Practical Constraint Databases | 1993 | VLDB | 6.2448851e-05 |
| 6,035 | Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data | 1995 | PODS | 5.9088735e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,950 | Relational Expressive Power of Constraint Query Languages | 1996 | PODS |
| 2 | 5,658 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS |
| 3 | 4,881 | Evaluation Of The Size Of A Query Expressed In Relational Algebra | 1981 | SIGMOD |
| 4 | 4,110 | Linear vs. Order Constraint Queries Over Rational Databases (Extended Abstract) | 1996 | PODS |
| 5 | 7,576 | A Generalized Transitive Closure for Relational Queries | 1988 | PODS |
| 6 | 5,841 | On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract) | 1997 | PODS |
| 7 | 4,640 | Exact and Approximate Aggregation in Constraint Query Languages | 1999 | PODS |
| 8 | 8,726 | Towards Practical Constraint Databases (Extended Abstract) | 1996 | PODS |
| 9 | 4,438 | Handling Infinite Temporal Data | 1990 | PODS |
| 10 | 4,242 | Variable Independence and Aggregation Closure | 1996 | PODS |