Dense-Order Constraint Databases

@inproceedings{Grumbach1995DenseOrderCD,
  title={Dense-Order Constraint Databases},
  author={St{\'e}phane Grumbach and Jianwen Su},
  booktitle={PODS},
  year={1995}
}
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… CONTINUE READING

Similar Papers

Loading similar papers…