Sciweavers

4468 search results - page 313 / 894
» Processing Forecasting Queries
Sort
View
VLDB
2007
ACM
114views Database» more  VLDB 2007»
16 years 7 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
SIGMOD
2006
ACM
109views Database» more  SIGMOD 2006»
16 years 6 months ago
OMCAT: optimal maintenance of continuous queries' answers for trajectories
We present our prototype system, OMCAT, which optimizes the reevaluation of a set of pending continuous spatio-temporal queries on trajectory data, when some of the trajectories a...
Hui Ding, Goce Trajcevski, Peter Scheuermann
SIGMOD
2003
ACM
140views Database» more  SIGMOD 2003»
16 years 6 months ago
The Design of an Acquisitional Query Processor For Sensor Networks
We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is...
Samuel Madden, Michael J. Franklin, Joseph M. Hell...
SAC
2009
ACM
16 years 1 months ago
Building an efficient preference XML query processor
Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enablin...
SungRan Cho, Wolf-Tilo Balke
SEMWEB
2009
Springer
16 years 1 months ago
Executing SPARQL Queries over the Web of Linked Data
The Web of Linked Data forms a single, globally distributed dataspace. Due to the openness of this dataspace, it is not possible to know in advance all data sources that might be r...
Olaf Hartig, Christian Bizer, Johann Christoph Fre...