Sciweavers

750 search results - page 95 / 150
» Aggregates in Possibilistic Databases
Sort
View
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 11 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
ICDE
2009
IEEE
115views Database» more  ICDE 2009»
14 years 11 months ago
Efficient Evaluation of Multiple Preference Queries
Consider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attri...
Leong Hou U, Nikos Mamoulis, Kyriakos Mouratidis
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
14 years 11 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
ICDE
2005
IEEE
185views Database» more  ICDE 2005»
14 years 11 months ago
A Multiresolution Symbolic Representation of Time Series
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
Vasileios Megalooikonomou, Qiang Wang, Guo Li, Chr...
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 11 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura