333 search results - page 31 / 67 » Read-Once Functions and Query Evaluation in Probabilistic Da... |
131
Voted
ADBIS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In moving object databases, many authors assume that number and position of objects to be processed are always known in advance. Detecting an unknown moving object and pu...
202
Voted
VLDB
2009
ACM
16 years 3 months ago
2009
ACM
Abstract The top-k dominating query returns k data objects which dominate the highest number of objects in a dataset. This query is an important tool for decision support since it ...
145
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
137
click to vote
MOBIDE
2006
ACM
15 years 9 months ago
2006
ACM
Composition of temporal and spatial properties of real world objects in a unified data framework results into Moving Object Databases (MOD). MODs are able to process, manage and a...
142
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...