2313 search results - page 430 / 463 » On Heuristic Time Hierarchies |
189
click to vote
POPL
2006
ACM
16 years 5 days ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
181
click to vote
SIGMOD
2009
ACM
16 years 2 days ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
108
click to vote
SIGMOD
2004
ACM
16 years 14 hour ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
101
click to vote
PODS
2002
ACM
16 years 2 hour ago
2002
ACM
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
136
click to vote
EDBT
2008
ACM
15 years 12 months ago
2008
ACM
Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to "certain" data, ...