Results 1 - 10
of
57
Relational Expressive Power of Constraint Query Languages
"... ... In the course of proving these results for the active-domain semantics, we establish Ramsey-type theorems saying that any query involving certain kinds of constraints coincides with a constraint-free query on databases whose elements come from a certain infinite subset of the domain. To prove th ..."
Abstract
-
Cited by 82 (18 self)
- Add to MetaCart
... In the course of proving these results for the active-domain semantics, we establish Ramsey-type theorems saying that any query involving certain kinds of constraints coincides with a constraint-free query on databases whose elements come from a certain infinite subset of the domain. To prove the collapse results for the natural semantics, we make use of techniques from nonstandard analysis and from the model theory of ordered structures.
Topological Queries in Spatial Databases
- In Journal of Computer and System Sciences 58(1
, 1999
"... All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
-
Cited by 48 (4 self)
- Add to MetaCart
All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
New Results on Quantifier Elimination Over Real Closed Fields and Applications to Constraint Databases
- Journal of the ACM
, 1999
"... In this paper we give a new algorithm for quantifier elimination in the first order theory of real closed fields that improves the complexity of the best known algorithm for this problem till now. Unlike previously known algorithms [3, 28, 22] the combinatorial part of the complexity (the part depen ..."
Abstract
-
Cited by 42 (5 self)
- Add to MetaCart
In this paper we give a new algorithm for quantifier elimination in the first order theory of real closed fields that improves the complexity of the best known algorithm for this problem till now. Unlike previously known algorithms [3, 28, 22] the combinatorial part of the complexity (the part depending on the number of polynomials in the input) of this new algorithm is independent of the number of free variables. Moreover, under the assumption that each polynomial in the input depend only on a constant number of the free variables, the algebraic part of the complexity (the part depending on the degrees of the input polynomials) can also be made independent of the number of free variables. This new feature of our algorithm allows us to obtain a new algorithm for a variant of the quantifier elimination problem. We give an almost optimal algorithm for this new problem, which we call the uniform quantifier elimination problem. Using the uniform quantifier elimination algorithm, we give a...
Automatic construction of simple artifact-based workflows
- In: Proc. of the 12th Int. Conf. on Database Theory (ICDT 2009
, 2009
"... Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification of these workflow schemas and their piece-parts, so that they can be adapted to new business situations. This paper desc ..."
Abstract
-
Cited by 34 (2 self)
- Add to MetaCart
(Show Context)
Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification of these workflow schemas and their piece-parts, so that they can be adapted to new business situations. This paper describes an approach for automatic construction (and thus, evolution) of a workflow schema that satisfies a specified condition (or “goal”), starting from a set of basic building block services (or “tasks”). We use a workflow model based on “business artifacts”, which represent key (real or conceptual) business entities, and include both the business-relevant data about them and a specification of their lifecycle, that is, how they can evolve over time as they move through the workflow as the result of services being applied to them. This paper uses a declarative form of artifact-centric workflow. The
First-order queries on finite structures over the reals
"... We investigate properties of finite relational structures over the reals expressed by first-order sentences whose predicates are the relations of the structure plus arbitrary polynomial inequalities, and whose quantifiers can range over the whole set of reals. In constraint programming terminology, ..."
Abstract
-
Cited by 32 (2 self)
- Add to MetaCart
We investigate properties of finite relational structures over the reals expressed by first-order sentences whose predicates are the relations of the structure plus arbitrary polynomial inequalities, and whose quantifiers can range over the whole set of reals. In constraint programming terminology, this corresponds to Boolean real polynomial constraint queries on finite structures. The fact that quantifiers range over all reals seems crucial � however, we observe that each sentence in the first-order theory of the reals can be evaluated by letting each quantifier range over only a finite set of real numbers without changing its truth value. Inspired by this observation, we then show that when all polynomials used are linear, each query can be expressed uniformly on all finite structures by a sentence of which the quantifiers range only over the finite domain of the structure. In other words, linear constraint programming on finite structures can be reduced to ordinary query evaluation as usual in finite model theory and databases. Moreover, if only "generic" queries are taken into consideration, we show that this can be reduced even further by proving that such
Moving Objects: Logical Relationships and Queries, C.S. Jensen etc. : Advances in Spatial and Temporal Databases
- A Spatiotemporal Model and Language for Moving Objects on Road Networks, C.S. Jensen etc. : Advances in Spatial and Temporal Databases
, 2001
"... Abstract. In moving object databases, object locations in some multidimensional space depend on time. Previous work focuses mainly on moving object modeling (e.g., using ADTs, temporal logics) and ad hoc query optimization. In this paper we investigate logical properties of moving objects in connect ..."
Abstract
-
Cited by 27 (0 self)
- Add to MetaCart
(Show Context)
Abstract. In moving object databases, object locations in some multidimensional space depend on time. Previous work focuses mainly on moving object modeling (e.g., using ADTs, temporal logics) and ad hoc query optimization. In this paper we investigate logical properties of moving objects in connection with queries over such objects using tools from differential geometry. In an abstract model, object locations can be described as vectors of continuous functions of time. Using this conceptual model, we examine the logical relationships between moving objects, and between moving objects and (stationary) spatial objects in the database. We characterize these relationships in terms of position, velocity, and acceleration. We show that these fundamental relationships can be used to describe natural queries involving time instants and intervals. Based on this foundation, we develop a concrete data model for moving objects which is an extension of linear constraint databases. We also present a preliminary version of a logical query language for moving object databases. 1
The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases
- Theoretical Computer Science
, 1997
"... In previous work we have developed the scheme of indefinite L-constraint databases where L, the parameter, is a first-order constraint language. This scheme extends the constraint database proposal of Kanellakis, Kuper and Revesz to include indefinite (or uncertain) information in the style of Imiel ..."
Abstract
-
Cited by 27 (11 self)
- Add to MetaCart
(Show Context)
In previous work we have developed the scheme of indefinite L-constraint databases where L, the parameter, is a first-order constraint language. This scheme extends the constraint database proposal of Kanellakis, Kuper and Revesz to include indefinite (or uncertain) information in the style of Imielinski and Lipski. In this paper we study the complexity of query evaluation in an important instance of this abstract scheme: indefinite temporal constraint databases. Our results indicate that the data/combined complexity of query evaluation does not change when we move from queries in relational calculus over relational databases, to queries in relational calculus with temporal constraints over temporal constraint databases. This fact remains true even when we consider query evaluation in relational databases with indefinite information vs. query evaluation in indefinite temporal constraint databases. In the course of our work, we provide precise bounds on the complexity of decision/quanti...
Linear constraint query languages: Expressive power and complexity
- Logic and Computational Complexity
, 1994
"... Abstract. We giveanAC 0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressibility ofvarious usual queries, such as the parity of the cardinality of a set or the connectivity of a graph i ..."
Abstract
-
Cited by 26 (12 self)
- Add to MetaCart
(Show Context)
Abstract. We giveanAC 0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressibility ofvarious usual queries, such as the parity of the cardinality of a set or the connectivity of a graph in rst-order logic with linear constraints. 1
On the Structure of Queries in Constraint Query Languages
"... Westudythestructureofrst-orderandsecondorderqueriesoverconstraintdatabases. Constraint databasesareformallymodeledasniterelational structuresembeddedinsomexedinnitestructure. Weconcentrateonproblemsofeliminationofconstraints, reducingquanticationrangetotheactivedomainofthedatabase andobtainingnewcom ..."
Abstract
-
Cited by 26 (11 self)
- Add to MetaCart
Westudythestructureofrst-orderandsecondorderqueriesoverconstraintdatabases. Constraint databasesareformallymodeledasniterelational structuresembeddedinsomexedinnitestructure. Weconcentrateonproblemsofeliminationofconstraints, reducingquanticationrangetotheactivedomainofthedatabase andobtainingnewcomplexity bounds.Weshowthatforalargeclassofsignatures, includingrealarithmeticconstraints,unboundedquantication canbeeliminated.Thatis,onecantransform asentencecontainingunrestrictedquanticationover theinniteuniversetogetanequivalentsentencein whichquantiersrangeovertheniterelationalstructure. Weusethisresulttogetanewcomplexityupper boundontheevaluationofrealarithmeticconstraints. Wealsoexpandupontechniquesin[21]and[4]forgettingupper boundsontheexpressivenessofconstraint querylanguages,andapplyittoanumberofrst-order and second-orderquerylanguages.
