Sciweavers

132 search results - page 8 / 27
» Preference query evaluation over expensive attributes
Sort
View
BTW
2011
Springer
218views Database» more  BTW 2011»
13 years 10 days ago
Tracking Hot-k Items over Web 2.0 Streams
Abstract: The rise of the Web 2.0 has made content publishing easier than ever. Yesterday’s passive consumers are now active users who generate and contribute new data to the web...
Parisa Haghani, Sebastian Michel, Karl Aberer
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
14 years 8 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 2 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
IJCSA
2008
108views more  IJCSA 2008»
13 years 8 months ago
Consistency Check Algorithms for Multi-Dimensional Preference Trade-Offs
: Skyline Queries have recently received a lot of attention due to their intuitive query capabilities. Following the concept of Pareto optimality all `best' database objects a...
Christoph Lofi, Wolf-Tilo Balke, Ulrich Güntz...
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
14 years 10 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...