Sciweavers

710 search results - page 14 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
DBPL
1999
Springer
101views Database» more  DBPL 1999»
13 years 12 months ago
On the Power of Incremental Evaluation in SQL-Like Languages
We consider IES(SQL), the incremental evaluation system over an SQL-like language with grouping, arithmetics, and aggregation. We show that every second order query is in IES(SQL) ...
Leonid Libkin, Limsoon Wong
LOGCOM
2007
97views more  LOGCOM 2007»
13 years 7 months ago
A General Framework for Expressing Preferences in Causal Reasoning and Planning
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...
James P. Delgrande, Torsten Schaub, Hans Tompits
ICDT
1997
ACM
138views Database» more  ICDT 1997»
13 years 11 months ago
Tractable Iteration Mechanisms for Bag Languages
Abstract. The goal of this paper is to study tractable iteration mechanisms for bags. The presence of duplicates in bags prevents iteration mechanisms developed in the context of s...
Latha S. Colby, Leonid Libkin
ICDT
2003
ACM
121views Database» more  ICDT 2003»
14 years 26 days ago
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
Floris Geerts, Bart Kuijpers
SOFSEM
2004
Springer
14 years 1 months ago
Processing XPath Expressions in Relational Databases
Abstract. Research on processing XML documents gained much activity in recent times. XML query languages are mostly based on XPath expressions, which are used to select parts of XM...
Tadeusz Pankowski