Sciweavers

29908 search results - page 406 / 5982
» On the Complexity of
Sort
View
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
16 years 8 months ago
Increasing the Expressivity of Conditional Functional Dependencies without Extra Complexity
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...
Loreto Bravo, Wenfei Fan, Floris Geerts, Shuai Ma
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 8 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
ICDE
1996
IEEE
103views Database» more  ICDE 1996»
16 years 8 months ago
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
Martin Sköld, Tore Risch
DAC
2003
ACM
16 years 8 months ago
A complexity effective communication model for behavioral modeling of signal processing applications
In this paper, we argue that the address space of memory regions that participate in inter task communication is over-specified by the traditional communication models used in beh...
M. N. V. Satya Kiran, M. N. Jayram, Pradeep Rao, S...
CP
2009
Springer
16 years 7 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný