Sciweavers

126 search results - page 20 / 26
» The Complexity of Acyclic Conjunctive Queries
Sort
View
ICDT
2005
ACM
102views Database» more  ICDT 2005»
14 years 1 months ago
Selecting and Using Views to Compute Aggregate Queries (Extended Abstract)
d abstract) Foto Afrati1 and Rada Chirkova2 1 Electrical and Computing Eng., National Technical University of Athens, 157 73 Athens, Greece 2 Computer Science Department, North Car...
Foto N. Afrati, Rada Chirkova
SIGMOD
2011
ACM
170views Database» more  SIGMOD 2011»
12 years 10 months ago
Querying contract databases based on temporal behavior
Considering a broad definition for service contracts (beyond web services and software, e.g. airline tickets and insurance policies), we tackle the challenges of building a high ...
Elio Damaggio, Alin Deutsch, Dayou Zhou
CP
2009
Springer
14 years 8 months ago
Same-Relation Constraints
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
Christopher Jefferson, Karen E. Petrie, Meinolf Se...
CONCUR
2009
Springer
14 years 2 months ago
Query-Based Model Checking of Ad Hoc Network Protocols
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
Anu Singh, C. R. Ramakrishnan, Scott A. Smolka
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 7 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...