Sciweavers

1039 search results - page 20 / 208
» Query reformulation with constraints
Sort
View
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
14 years 8 months ago
QPIAD: Query Processing over Incomplete Autonomous Databases
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
Hemal Khatri, Jianchun Fan, Yi Chen, Subbarao Kamb...
NAACL
2007
13 years 8 months ago
Relationship between Non-Projective Edges, Their Level Types, and Well-Nestedness
Dependency analysis of natural language gives rise to non-projective structures. The constraint of well-nestedness on dependency trees has been recently shown to give a good fit ...
Jirí Havelka
PPDP
2010
Springer
13 years 5 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
ADBIS
2000
Springer
188views Database» more  ADBIS 2000»
13 years 11 months ago
Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
Sara Cohen, Werner Nutt, Alexander Serebrenik
SIGIR
2006
ACM
14 years 1 months ago
Action modeling: language models that predict query behavior
We present a novel language modeling approach to capturing the query reformulation behavior of Web search users. Based on a framework that categorizes eight different types of “...
G. Craig Murray, Jimmy J. Lin, Abdur Chowdhury