Sciweavers

680 search results - page 77 / 136
» Recommending Multidimensional Queries.
Sort
View
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 5 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
13 years 2 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
12 years 23 days ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
ESWS
2008
Springer
14 years 3 days ago
Querying Distributed RDF Data Sources with SPARQL
Integrated access to multiple distributed and autonomous RDF data sources is a key challenge for many semantic web applications. As a reaction to this challenge, SPARQL, the W3C Re...
Bastian Quilitz, Ulf Leser
WWW
2011
ACM
13 years 5 months ago
Context-sensitive query auto-completion
Query auto completion is known to provide poor predictions of the user’s query when her input prefix is very short (e.g., one or two characters). In this paper we show that con...
Ziv Bar-Yossef, Naama Kraus