Sciweavers

189 search results - page 15 / 38
» Approximating predicates and expressive queries on probabili...
Sort
View
PODS
2010
ACM
213views Database» more  PODS 2010»
14 years 1 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
EDBT
2009
ACM
115views Database» more  EDBT 2009»
14 years 3 months ago
Top-k dominating queries in uncertain databases
Due to the existence of uncertain data in a wide spectrum of real applications, uncertain query processing has become increasingly important, which dramatically differs from handl...
Xiang Lian, Lei Chen 0002
VLDB
2004
ACM
98views Database» more  VLDB 2004»
14 years 1 months ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 10 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
SIGMOD
2002
ACM
145views Database» more  SIGMOD 2002»
14 years 8 months ago
Continuously adaptive continuous queries over streams
We present a continuously adaptive, continuous query (CACQ) implementation based on the eddy query processing framework. We show that our design provides significant performance b...
Samuel Madden, Mehul A. Shah, Joseph M. Hellerstei...