Sciweavers

610 search results - page 39 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
16 years 1 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
94
Voted
WWW
2007
ACM
16 years 1 months ago
Exploit sequencing views in semantic cache to accelerate xpath query evaluation
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
Jianhua Feng, Na Ta, Yong Zhang, Guoliang Li
92
Voted
CORR
2006
Springer
125views Education» more  CORR 2006»
15 years 16 days ago
10^(10^6) Worlds and Beyond: Efficient Representation and Processing of Incomplete Information
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...
Lyublena Antova, Christoph Koch, Dan Olteanu
BTW
2007
Springer
153views Database» more  BTW 2007»
15 years 4 months ago
Efficient Time-Travel on Versioned Text Collections
: The availability of versioned text collections such as the Internet Archive opens up opportunities for time-aware exploration of their contents. In this paper, we propose time-tr...
Klaus Berberich, Srikanta J. Bedathur, Gerhard Wei...
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
16 years 1 months ago
A Generic Framework for Continuous Motion Pattern Query Evaluation
We introduce a novel query type defined over streaming moving object data, namely, the Continuous Motion Pattern (CMP) Queries. A motion pattern is defined as a sequence of distin...
Petko Bakalov, Vassilis J. Tsotras