Sciweavers

525 search results - page 37 / 105
» On Query Algebras for Probabilistic Databases
Sort
View
WWW
2007
ACM
16 years 4 months ago
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
144
Voted
SIGMOD
2001
ACM
221views Database» more  SIGMOD 2001»
16 years 3 months ago
Adaptable Query Optimization and Evaluation in Temporal Middleware
Time-referenced data are pervasive in most real-world databases. Recent advances in temporal query languages show that such database applications may benefit substantially from bu...
Giedrius Slivinskas, Christian S. Jensen, Richard ...
125
Voted
ICDE
2007
IEEE
89views Database» more  ICDE 2007»
15 years 7 months ago
A Flexible Query Graph Based Model for the Efficient Execution of Continuous Queries
In this paper, we propose a simple and flexible execution model that (i) supports a wide spectrum of alternative optimization and execution strategies and their mixtures, (ii) pro...
Yijian Bai, Hetal Thakkar, Haixun Wang, Carlo Zani...
177
Voted
EDBT
2012
ACM
224views Database» more  EDBT 2012»
13 years 6 months ago
Aggregate queries on probabilistic record linkages
Record linkage analysis, which matches records referring to the same real world entities from different data sets, is an important task in data integration. Uncertainty often exi...
Ming Hua, Jian Pei
152
Voted
SSDBM
2008
IEEE
107views Database» more  SSDBM 2008»
15 years 10 months ago
ProUD: Probabilistic Ranking in Uncertain Databases
There are a lot of application domains, e.g. sensor databases, traffic management or recognition systems, where objects have to be compared based on vague and uncertain data. Feat...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...