Sciweavers

128 search results - page 9 / 26
» Efficient Evaluation of Multiple Preference Queries
Sort
View
WWW
2005
ACM
14 years 8 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
ICDE
2010
IEEE
243views Database» more  ICDE 2010»
14 years 7 months ago
Probabilistic Contextual Skylines
The skyline query returns the most interesting tuples according to a set of explicitly defined preferences among attribute values. This work relaxes this requirement, and allows us...
Anastasios Arvanitis, Dimitris Sacharidis, Timos K...
EDBT
2009
ACM
165views Database» more  EDBT 2009»
13 years 5 months ago
Exploiting the power of relational databases for efficient stream processing
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a di...
Erietta Liarou, Romulo Goncalves, Stratos Idreos
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
14 years 7 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
14 years 8 months ago
Ranked Join Indices
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
Panayiotis Tsaparas, Themistoklis Palpanas, Yannis...