Sciweavers

2853 search results - page 226 / 571
» On the Efficiency of Provenance Queries
Sort
View
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
15 years 10 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
16 years 8 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
16 years 8 months ago
Representing and Querying Correlated Tuples in Probabilistic Databases
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
Prithviraj Sen, Amol Deshpande
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
15 years 11 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....
PVLDB
2008
108views more  PVLDB 2008»
15 years 6 months ago
Sliding-window top-k queries on uncertain streams
Query processing on uncertain data streams has attracted a lot of attentions lately, due to the imprecise nature in the data generated from a variety of streaming applications, su...
Cheqing Jin, Ke Yi, Lei Chen 0002, Jeffrey Xu Yu, ...