1039 search results - page 138 / 208 » Query reformulation with constraints |
264
Voted
ICDE
2004
IEEE
16 years 6 months ago
2004
IEEE
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
163
click to vote
RTSS
2006
IEEE
15 years 10 months ago
2006
IEEE
With the emergence of large wired and wireless sensor networks, many real-time applications need to operate on continuous unbounded data streams. At the same time, many of these s...
161
click to vote
SIGMOD
2012
ACM
13 years 7 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
255
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
We propose a class of constraints, referred to as conditional functional dependencies (CFDs), and study their applications in data cleaning. In contrast to traditional functional ...
143
click to vote
AMW
2009
15 years 5 months ago
2009
Abstract. The chase procedure, an algorithm proposed 25+ years ago to fix constraint violations in database instances, has been successfully applied in a variety of contexts, such ...