Sciweavers

493 search results - page 37 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
ICDT
2010
ACM
219views Database» more  ICDT 2010»
15 years 8 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
15 years 11 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
GIS
2008
ACM
15 years 5 days ago
Heuristic algorithms for route-search queries over geographical data
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach...
GIS
2007
ACM
16 years 5 days ago
An interactive framework for raster data spatial joins
Many Geographic Information System (GIS) applications must handle large geospatial datasets stored in raster representation. Spatial joins over raster data are important queries i...
Wan D. Bae, Petr Vojtechovský, Shayma Alkob...
VLDB
2011
ACM
276views Database» more  VLDB 2011»
14 years 6 months ago
Ranking queries on uncertain data
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Xuemin Lin