Sciweavers

3514 search results - page 198 / 703
» On Moving Object Queries
Sort
View
VLDB
1990
ACM
116views Database» more  VLDB 1990»
15 years 10 months ago
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases
A probabilistic learning model for vague queries and missing or imprecise information in databases is described. Instead of retrieving only a set of answers, our approach yields a...
Norbert Fuhr
CCCG
2008
15 years 7 months ago
Data Structures for Range-Aggregate Extent Queries
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Mich...
EDBT
2009
ACM
164views Database» more  EDBT 2009»
15 years 11 months ago
Fast object search on road networks
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...
Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
EDBT
2008
ACM
140views Database» more  EDBT 2008»
16 years 6 months ago
Dynamic skyline queries in metric spaces
Skyline query is of great importance in many applications, such as multi-criteria decision making and business planning. In particular, a skyline point is a data object in the dat...
Lei Chen 0002, Xiang Lian
SSD
2005
Springer
105views Database» more  SSD 2005»
15 years 11 months ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis