Sciweavers

643 search results - page 57 / 129
» Dynamic prioritization of database queries
Sort
View
ICDE
2009
IEEE
192views Database» more  ICDE 2009»
15 years 11 months ago
Topologically Sorted Skylines for Partially Ordered Domains
The vast majority of work on skyline queries considers totally ordered domains, whereas in many applications some attributes are partially ordered, as for instance, domains of set ...
Dimitris Sacharidis, Stavros Papadopoulos, Dimitri...
ICDE
2009
IEEE
149views Database» more  ICDE 2009»
15 years 11 months ago
Online Tuning of Aggregation Tables for OLAP
Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...
Katja Hose, Daniel Klan, Kai-Uwe Sattler
SIGMOD
2006
ACM
170views Database» more  SIGMOD 2006»
15 years 10 months ago
Energy-efficient monitoring of extreme values in sensor networks
Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorit...
Adam Silberstein, Jun Yang 0001, Kamesh Munagala
VLDB
2002
ACM
108views Database» more  VLDB 2002»
14 years 9 months ago
Adaptive Index Structures
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
Yufei Tao, Dimitris Papadias
GIS
2002
ACM
14 years 9 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...