Sciweavers

1160 search results - page 140 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
160
Voted
SIGMOD
2007
ACM
170views Database» more  SIGMOD 2007»
15 years 10 months ago
Cardinality estimation using sample views with quality assurance
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...
Per-Åke Larson, Wolfgang Lehner, Jingren Zho...
103
Voted
FOCS
2009
IEEE
15 years 2 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
164
Voted
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
15 years 11 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
91
Voted
WWW
2005
ACM
15 years 11 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
95
Voted
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 3 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...