Sciweavers

735 search results - page 12 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
CIKM
2009
Springer
15 years 6 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
16 years 1 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
64
Voted
JISE
2007
66views more  JISE 2007»
14 years 11 months ago
A Path-based Approach for Efficient Evaluation of Twig Queries over XML Data
Ya-Hui Chang, Cheng-Ta Lee, Wang-Chien Lee
114
Voted
MDM
2005
Springer
174views Communications» more  MDM 2005»
15 years 5 months ago
GPAC: generic and progressive processing of mobile queries over mobile data
This paper introduces a new family of Generic and Progressive algorithms (GPAC, for short) for continuous mobile queries over mobile objects. GPAC provides a general skeleton that...
Mohamed F. Mokbel, Walid G. Aref
VLDB
2007
ACM
118views Database» more  VLDB 2007»
15 years 12 months ago
Materialized Views in Probabilistic Databases for Information Exchange and Query Optimization
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...
Christopher Re, Dan Suciu