Sciweavers

1004 search results - page 35 / 201
» Safe Constraint Queries
Sort
View
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
14 years 14 days ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
ICDE
2010
IEEE
192views Database» more  ICDE 2010»
14 years 3 months ago
XML reasoning made practical
— We present a tool for the static analysis of XPath queries and XML Schemas. The tool introduces techniques used in the field of verification (such as binary decision diagrams...
Pierre Genevès, Nabil Layaïda
WEBDB
2004
Springer
202views Database» more  WEBDB 2004»
14 years 2 months ago
Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we ...
Ullas Nambiar, Subbarao Kambhampati
ICDE
1998
IEEE
99views Database» more  ICDE 1998»
14 years 1 months ago
Query Folding with Inclusion Dependencies
Query folding is a technique for determining how a query may be answered using a given set of resources, which may include materialized views, cached results of previous queries, ...
Jarek Gryz
TCS
1998
13 years 8 months ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...