Sciweavers

316 search results - page 17 / 64
» Evaluation of Conditional Preference Queries
Sort
View
ICDT
2012
ACM
235views Database» more  ICDT 2012»
12 years 9 days ago
Equivalence and minimization of conjunctive queries under combined semantics
The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...
Rada Chirkova
VLDB
2007
ACM
126views Database» more  VLDB 2007»
14 years 10 months ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish
SCCC
1997
IEEE
14 years 2 months ago
Reactive Ranking for Cooperative Databases
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
Berthier A. Ribeiro-Neto, Guilherme T. de Assis
TKDE
2008
231views more  TKDE 2008»
13 years 9 months ago
Personalized Concept-Based Clustering of Search Engine Queries
A major problem of current Web search is that search queries are usually short and ambiguous, and thus are insufficient for specifying the precise user needs. To alleviate this pro...
Kenneth Wai-Ting Leung, Wilfred Ng, Dik Lun Lee
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 9 months ago
FAS - A Freshness-Sensitive Coordination Middleware for a Cluster of OLAP Components
Data warehouses offer a compromise between freshness of data and query evaluation times. However, a fixed preference ratio between these two variables is too undifferentiated. Wit...
Uwe Röhm, Klemens Böhm, Hans-Jörg S...